{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JLCEIWEV3H2Y4EPWOKVAJE44LR","short_pith_number":"pith:JLCEIWEV","canonical_record":{"source":{"id":"1610.05155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T15:05:32Z","cross_cats_sorted":[],"title_canon_sha256":"b08ec616e1eb5d7508c18dcba70847fdd661839f944e2973ea05c1c62d3bc181","abstract_canon_sha256":"8b1b155e4f236404e560f97cb4bed52d8ab05157bae382b93205a86108285b1a"},"schema_version":"1.0"},"canonical_sha256":"4ac4445895d9f58e11f672aa04939c5c6fc43b4288ea7dd9256d49be8dc29f77","source":{"kind":"arxiv","id":"1610.05155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05155","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05155v1","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05155","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"JLCEIWEV3H2Y","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JLCEIWEV3H2Y4EPW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JLCEIWEV","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JLCEIWEV3H2Y4EPWOKVAJE44LR","target":"record","payload":{"canonical_record":{"source":{"id":"1610.05155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T15:05:32Z","cross_cats_sorted":[],"title_canon_sha256":"b08ec616e1eb5d7508c18dcba70847fdd661839f944e2973ea05c1c62d3bc181","abstract_canon_sha256":"8b1b155e4f236404e560f97cb4bed52d8ab05157bae382b93205a86108285b1a"},"schema_version":"1.0"},"canonical_sha256":"4ac4445895d9f58e11f672aa04939c5c6fc43b4288ea7dd9256d49be8dc29f77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:06.030987Z","signature_b64":"n2HFFAWmIBkYF0J2do2O0iikKWVtD3XN2UqrX5tF5dvFDJCljdmZlIErkM6afzgHQHVWiMwP73oq1UAQmPkbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ac4445895d9f58e11f672aa04939c5c6fc43b4288ea7dd9256d49be8dc29f77","last_reissued_at":"2026-05-18T01:02:06.030419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:06.030419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.05155","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-18T01:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vi95u4LCq+jAGsL0wyo6KwJwfUpm7wQN+OSxILGXXswS5nCgQ88YFpQ/ibHqyF0nf9+1pITzzigFNOXWdykjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:51:15.474001Z"},"content_sha256":"442684859b932dd1067c28e21a680357d590b0d128c03f23fb668a75a113d14d","schema_version":"1.0","event_id":"sha256:442684859b932dd1067c28e21a680357d590b0d128c03f23fb668a75a113d14d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JLCEIWEV3H2Y4EPWOKVAJE44LR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashish Chiplunkar, Haim Kaplan, Yossi Azar","submitted_at":"2016-10-17T15:05:32Z","abstract_excerpt":"We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) recently introduced by Emek et al, (STOC 2016). This problem is defined on an underlying $n$-point metric space. An adversary presents real-time requests online at points of the metric space, and the algorithm is required to match them, possibly after keeping them waiting for some time. The cost incurred is the sum of the distances between matched pairs of points (the connection cost), and the sum of the waiting times of the requests (the delay cost). We present an algorithm with a competitive ratio of $O(\\log n)$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05155","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-18T01:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYEZJfO92hLlnbKgr3ruTWLK8Ey9spCzU37EZggD01Ys71ssa7qe6+1s/9r5L3nr2SdAWtRDfVwttOL5Fgs2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:51:15.474381Z"},"content_sha256":"abef5b4e60b2abaf772a7dc7f1c349ef23ecdb0046093f08a09b45027e9e771c","schema_version":"1.0","event_id":"sha256:abef5b4e60b2abaf772a7dc7f1c349ef23ecdb0046093f08a09b45027e9e771c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLCEIWEV3H2Y4EPWOKVAJE44LR/bundle.json","state_url":"https://pith.science/pith/JLCEIWEV3H2Y4EPWOKVAJE44LR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLCEIWEV3H2Y4EPWOKVAJE44LR/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-05-28T12:51:15Z","links":{"resolver":"https://pith.science/pith/JLCEIWEV3H2Y4EPWOKVAJE44LR","bundle":"https://pith.science/pith/JLCEIWEV3H2Y4EPWOKVAJE44LR/bundle.json","state":"https://pith.science/pith/JLCEIWEV3H2Y4EPWOKVAJE44LR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLCEIWEV3H2Y4EPWOKVAJE44LR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JLCEIWEV3H2Y4EPWOKVAJE44LR","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":"8b1b155e4f236404e560f97cb4bed52d8ab05157bae382b93205a86108285b1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T15:05:32Z","title_canon_sha256":"b08ec616e1eb5d7508c18dcba70847fdd661839f944e2973ea05c1c62d3bc181"},"schema_version":"1.0","source":{"id":"1610.05155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.05155","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1610.05155v1","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05155","created_at":"2026-05-18T01:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"JLCEIWEV3H2Y","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JLCEIWEV3H2Y4EPW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JLCEIWEV","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:abef5b4e60b2abaf772a7dc7f1c349ef23ecdb0046093f08a09b45027e9e771c","target":"graph","created_at":"2026-05-18T01:02:06Z","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":"We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) recently introduced by Emek et al, (STOC 2016). This problem is defined on an underlying $n$-point metric space. An adversary presents real-time requests online at points of the metric space, and the algorithm is required to match them, possibly after keeping them waiting for some time. The cost incurred is the sum of the distances between matched pairs of points (the connection cost), and the sum of the waiting times of the requests (the delay cost). We present an algorithm with a competitive ratio of $O(\\log n)$, ","authors_text":"Ashish Chiplunkar, Haim Kaplan, Yossi Azar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T15:05:32Z","title":"Polylogarithmic Bounds on the Competitiveness of Min-cost (Bipartite) Perfect Matching with Delays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05155","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:442684859b932dd1067c28e21a680357d590b0d128c03f23fb668a75a113d14d","target":"record","created_at":"2026-05-18T01:02:06Z","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":"8b1b155e4f236404e560f97cb4bed52d8ab05157bae382b93205a86108285b1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-17T15:05:32Z","title_canon_sha256":"b08ec616e1eb5d7508c18dcba70847fdd661839f944e2973ea05c1c62d3bc181"},"schema_version":"1.0","source":{"id":"1610.05155","kind":"arxiv","version":1}},"canonical_sha256":"4ac4445895d9f58e11f672aa04939c5c6fc43b4288ea7dd9256d49be8dc29f77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ac4445895d9f58e11f672aa04939c5c6fc43b4288ea7dd9256d49be8dc29f77","first_computed_at":"2026-05-18T01:02:06.030419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:06.030419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n2HFFAWmIBkYF0J2do2O0iikKWVtD3XN2UqrX5tF5dvFDJCljdmZlIErkM6afzgHQHVWiMwP73oq1UAQmPkbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:06.030987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.05155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:442684859b932dd1067c28e21a680357d590b0d128c03f23fb668a75a113d14d","sha256:abef5b4e60b2abaf772a7dc7f1c349ef23ecdb0046093f08a09b45027e9e771c"],"state_sha256":"f52703ec1a0fa89dd3baf78a7656ebc96d2e8ae1a1ce183270e8615976647548"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sW4Z/ddeeSeQilmrjZ7l0BzrUg8lM8ObWvxuvIGtfP8VotYm0SIZjG9JBPd3kk+o5k+xY/cxUQWhT3jBowbDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:51:15.476408Z","bundle_sha256":"8047266ae038278976e0988a76d76f45c086e11ea1d5689715d18d8c3eb75317"}}