{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CISIRZE3NHQVI6LAZENLV4EU4Z","short_pith_number":"pith:CISIRZE3","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"},"canonical_sha256":"122488e49b69e1547960c91abaf094e67a46835107e75660a6d208a2223edcfc","source":{"kind":"arxiv","id":"1712.07099","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07099","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07099v1","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07099","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"CISIRZE3NHQV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CISIRZE3NHQVI6LA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CISIRZE3","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CISIRZE3NHQVI6LAZENLV4EU4Z","target":"record","payload":{"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"},"canonical_sha256":"122488e49b69e1547960c91abaf094e67a46835107e75660a6d208a2223edcfc","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"},"source_kind":"arxiv","source_id":"1712.07099","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ziASFJy4r+hEzTqfA/HhT6Jp7YhHOLVJz+kGFBeXz8bviPvK5obndfbJrLkvyfvHKWGEXfTqZl4Z+ALsWBc9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:42:48.435997Z"},"content_sha256":"fa43f76f11661bae3245bd88465f7ae460377f55fb7757bbb5c3764780ba90bb","schema_version":"1.0","event_id":"sha256:fa43f76f11661bae3245bd88465f7ae460377f55fb7757bbb5c3764780ba90bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CISIRZE3NHQVI6LAZENLV4EU4Z","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n1ze/h1lhLeygHutYkbyyu37faac/Ea3I3RkGEBQP0krTb3bhK7Fz6uYqHD5vNEzMV9bqFjZa4upWAoyNuY9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:42:48.436355Z"},"content_sha256":"a65311496f990f6672006516d75b9b9f102b22e6d24c1c6d9db309000c9c7abe","schema_version":"1.0","event_id":"sha256:a65311496f990f6672006516d75b9b9f102b22e6d24c1c6d9db309000c9c7abe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/bundle.json","state_url":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T22:42:48Z","links":{"resolver":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z","bundle":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/bundle.json","state":"https://pith.science/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CISIRZE3NHQVI6LAZENLV4EU4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CISIRZE3NHQVI6LAZENLV4EU4Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1c2dbcb466baff722839f7e2fab90bede691b1ec63189c7eb1ce431836e1d3ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T18:35:28Z","title_canon_sha256":"c46184ebc870e5fa3aab0e6ae0cbdc4398f6000658430daed22f718e7f2771b8"},"schema_version":"1.0","source":{"id":"1712.07099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07099","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07099v1","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07099","created_at":"2026-05-18T00:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"CISIRZE3NHQV","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CISIRZE3NHQVI6LA","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CISIRZE3","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:a65311496f990f6672006516d75b9b9f102b22e6d24c1c6d9db309000c9c7abe","target":"graph","created_at":"2026-05-18T00:27:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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$.","authors_text":"Andreas T\\\"onnis, Antonios Antoniadis, Carsten Fischer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T18:35:28Z","title":"A Collection of Lower Bounds for Online Matching on the Line"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07099","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fa43f76f11661bae3245bd88465f7ae460377f55fb7757bbb5c3764780ba90bb","target":"record","created_at":"2026-05-18T00:27:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1c2dbcb466baff722839f7e2fab90bede691b1ec63189c7eb1ce431836e1d3ac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-19T18:35:28Z","title_canon_sha256":"c46184ebc870e5fa3aab0e6ae0cbdc4398f6000658430daed22f718e7f2771b8"},"schema_version":"1.0","source":{"id":"1712.07099","kind":"arxiv","version":1}},"canonical_sha256":"122488e49b69e1547960c91abaf094e67a46835107e75660a6d208a2223edcfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"122488e49b69e1547960c91abaf094e67a46835107e75660a6d208a2223edcfc","first_computed_at":"2026-05-18T00:27:37.187105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:37.187105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EadF2nHKt+XGGZInfMiTzhuwQkkMWGltMFk2ZUqm189jmMNVQPqa5DEWHq0zl4eMS0YlMEh7ifU7U3oJbTKsBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:37.187891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa43f76f11661bae3245bd88465f7ae460377f55fb7757bbb5c3764780ba90bb","sha256:a65311496f990f6672006516d75b9b9f102b22e6d24c1c6d9db309000c9c7abe"],"state_sha256":"9eccd9693bcd3f11177d5299010c1520fb9a0297ffc5da4c5b424a9aeb4cbd1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EisB2qk5pGxEtXqbm7llbULh9T84ydZFE8MllBxWp/F7J4YBptf8NB0cXo4CcAeGLvXG4j0wP/NMXmATjIZcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:42:48.438247Z","bundle_sha256":"643da153e66acff9018637bde6fa55e8500ec22282cbaad1e0a064679e743192"}}