{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CISIRZE3NHQVI6LAZENLV4EU4Z","short_pith_number":"pith:CISIRZE3","schema_version":"1.0","canonical_sha256":"122488e49b69e1547960c91abaf094e67a46835107e75660a6d208a2223edcfc","source":{"kind":"arxiv","id":"1712.07099","version":1},"attestation_state":"computed","paper":{"title":"A Collection of Lower Bounds for Online Matching on the Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas T\\\"onnis, Antonios Antoniadis, Carsten Fischer","submitted_at":"2017-12-19T18:35:28Z","abstract_excerpt":"In the online matching on the line problem, the task is to match a set of requests $R$ online to a given set of servers $S$. The distance metric between any two points in $R\\,\\cup\\, S$ is a line metric and the objective for the online algorithm is to minimize the sum of distances between matched server-request pairs. This problem is well-studied and - despite recent improvements - there is still a large gap between the best known lower and upper bounds: The best known deterministic algorithm for the problem is $O(\\log^2n)$-competitive, while the best known deterministic lower bound is $9.001$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1712.07099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T18:35:28Z","cross_cats_sorted":[],"title_canon_sha256":"c46184ebc870e5fa3aab0e6ae0cbdc4398f6000658430daed22f718e7f2771b8","abstract_canon_sha256":"1c2dbcb466baff722839f7e2fab90bede691b1ec63189c7eb1ce431836e1d3ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:37.187891Z","signature_b64":"EadF2nHKt+XGGZInfMiTzhuwQkkMWGltMFk2ZUqm189jmMNVQPqa5DEWHq0zl4eMS0YlMEh7ifU7U3oJbTKsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"122488e49b69e1547960c91abaf094e67a46835107e75660a6d208a2223edcfc","last_reissued_at":"2026-05-18T00:27:37.187105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:37.187105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Collection of Lower Bounds for Online Matching on the Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas T\\\"onnis, Antonios Antoniadis, Carsten Fischer","submitted_at":"2017-12-19T18:35:28Z","abstract_excerpt":"In the online matching on the line problem, the task is to match a set of requests $R$ online to a given set of servers $S$. The distance metric between any two points in $R\\,\\cup\\, S$ is a line metric and the objective for the online algorithm is to minimize the sum of distances between matched server-request pairs. This problem is well-studied and - despite recent improvements - there is still a large gap between the best known lower and upper bounds: The best known deterministic algorithm for the problem is $O(\\log^2n)$-competitive, while the best known deterministic lower bound is $9.001$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07099","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.07099","created_at":"2026-05-18T00:27:37.187262+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07099v1","created_at":"2026-05-18T00:27:37.187262+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07099","created_at":"2026-05-18T00:27:37.187262+00:00"},{"alias_kind":"pith_short_12","alias_value":"CISIRZE3NHQV","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CISIRZE3NHQVI6LA","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CISIRZE3","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z","json":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z.json","graph_json":"https://pith.science/api/pith-number/CISIRZE3NHQVI6LAZENLV4EU4Z/graph.json","events_json":"https://pith.science/api/pith-number/CISIRZE3NHQVI6LAZENLV4EU4Z/events.json","paper":"https://pith.science/paper/CISIRZE3"},"agent_actions":{"view_html":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z","download_json":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z.json","view_paper":"https://pith.science/paper/CISIRZE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07099&json=true","fetch_graph":"https://pith.science/api/pith-number/CISIRZE3NHQVI6LAZENLV4EU4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/CISIRZE3NHQVI6LAZENLV4EU4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/action/storage_attestation","attest_author":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/action/author_attestation","sign_citation":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/action/citation_signature","submit_replication":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/action/replication_record"}},"created_at":"2026-05-18T00:27:37.187262+00:00","updated_at":"2026-05-18T00:27:37.187262+00:00"}