{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EMULACVVMFSQO2S5NMHRKE22XM","short_pith_number":"pith:EMULACVV","schema_version":"1.0","canonical_sha256":"2328b00ab56165076a5d6b0f15135abb04966ef8f1d3f92fbe83a45c47f8e5c4","source":{"kind":"arxiv","id":"1603.03024","version":1},"attestation_state":"computed","paper":{"title":"Online Matching: Haste makes Waste!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Roger Wattenhofer, Shay Kutten, Yuval Emek","submitted_at":"2016-03-09T20:43:29Z","abstract_excerpt":"This paper studies a new online problem, referred to as \\emph{min-cost perfect matching with delays (MPMD)}, defined over a finite metric space (i.e., a complete graph with positive edge weights obeying the triangle inequality) $\\mathcal{M}$ that is known to the algorithm in advance. Requests arrive in a continuous time online fashion at the points of $\\mathcal{M}$ and should be served by matching them to each other. The algorithm is allowed to delay its request matching commitments, but this does not come for free: the total cost of the algorithm is the sum of metric distances between matched"},"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":"1603.03024","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-09T20:43:29Z","cross_cats_sorted":[],"title_canon_sha256":"0c0882331488dbe449e3dfb196b868b1457f25af88a6738f8c267cb24ffadb8b","abstract_canon_sha256":"a1a8ff96563baf489ff0415f2b1daab57f1f735192f3cf957294a9619af10a7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:19.332948Z","signature_b64":"XGCqJ7ZJxtXeC6M1hXdjfTvtnoYpZpdYaEw2BB2qbFkGy36RsWV4eow4F6YPyESyBYCAyWAmLWPE+rAw7OIbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2328b00ab56165076a5d6b0f15135abb04966ef8f1d3f92fbe83a45c47f8e5c4","last_reissued_at":"2026-05-18T01:19:19.332577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:19.332577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Matching: Haste makes Waste!","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Roger Wattenhofer, Shay Kutten, Yuval Emek","submitted_at":"2016-03-09T20:43:29Z","abstract_excerpt":"This paper studies a new online problem, referred to as \\emph{min-cost perfect matching with delays (MPMD)}, defined over a finite metric space (i.e., a complete graph with positive edge weights obeying the triangle inequality) $\\mathcal{M}$ that is known to the algorithm in advance. Requests arrive in a continuous time online fashion at the points of $\\mathcal{M}$ and should be served by matching them to each other. The algorithm is allowed to delay its request matching commitments, but this does not come for free: the total cost of the algorithm is the sum of metric distances between matched"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03024","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":"1603.03024","created_at":"2026-05-18T01:19:19.332633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.03024v1","created_at":"2026-05-18T01:19:19.332633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03024","created_at":"2026-05-18T01:19:19.332633+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMULACVVMFSQ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMULACVVMFSQO2S5","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMULACVV","created_at":"2026-05-18T12:30:12.583610+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/EMULACVVMFSQO2S5NMHRKE22XM","json":"https://pith.science/pith/EMULACVVMFSQO2S5NMHRKE22XM.json","graph_json":"https://pith.science/api/pith-number/EMULACVVMFSQO2S5NMHRKE22XM/graph.json","events_json":"https://pith.science/api/pith-number/EMULACVVMFSQO2S5NMHRKE22XM/events.json","paper":"https://pith.science/paper/EMULACVV"},"agent_actions":{"view_html":"https://pith.science/pith/EMULACVVMFSQO2S5NMHRKE22XM","download_json":"https://pith.science/pith/EMULACVVMFSQO2S5NMHRKE22XM.json","view_paper":"https://pith.science/paper/EMULACVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.03024&json=true","fetch_graph":"https://pith.science/api/pith-number/EMULACVVMFSQO2S5NMHRKE22XM/graph.json","fetch_events":"https://pith.science/api/pith-number/EMULACVVMFSQO2S5NMHRKE22XM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMULACVVMFSQO2S5NMHRKE22XM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMULACVVMFSQO2S5NMHRKE22XM/action/storage_attestation","attest_author":"https://pith.science/pith/EMULACVVMFSQO2S5NMHRKE22XM/action/author_attestation","sign_citation":"https://pith.science/pith/EMULACVVMFSQO2S5NMHRKE22XM/action/citation_signature","submit_replication":"https://pith.science/pith/EMULACVVMFSQO2S5NMHRKE22XM/action/replication_record"}},"created_at":"2026-05-18T01:19:19.332633+00:00","updated_at":"2026-05-18T01:19:19.332633+00:00"}