{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LUU44E7YHS2FOVZKLQTSCLJSHO","short_pith_number":"pith:LUU44E7Y","canonical_record":{"source":{"id":"1806.03708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T19:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"fa7953fff96c14e0ccdd7350d0be62b3b7d50e08c50ca1143628668a34ffa426","abstract_canon_sha256":"2fa3c45dac6c540f795dfb8624c3fbb8b007b6326245e17f611124437eb5b872"},"schema_version":"1.0"},"canonical_sha256":"5d29ce13f83cb457572a5c27212d323bafef8a6c0f3e6541d9d74f25cc21b858","source":{"kind":"arxiv","id":"1806.03708","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03708","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03708v2","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03708","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"LUU44E7YHS2F","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LUU44E7YHS2FOVZK","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LUU44E7Y","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LUU44E7YHS2FOVZKLQTSCLJSHO","target":"record","payload":{"canonical_record":{"source":{"id":"1806.03708","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T19:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"fa7953fff96c14e0ccdd7350d0be62b3b7d50e08c50ca1143628668a34ffa426","abstract_canon_sha256":"2fa3c45dac6c540f795dfb8624c3fbb8b007b6326245e17f611124437eb5b872"},"schema_version":"1.0"},"canonical_sha256":"5d29ce13f83cb457572a5c27212d323bafef8a6c0f3e6541d9d74f25cc21b858","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:48.016173Z","signature_b64":"cMHINz+hKrSXateFAGoom02HYa4BKdVXDGOayN8fXJdow0knQ7RiRXKXhx6cbof0KuQKT7uNEi2RHLxmQM+tDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d29ce13f83cb457572a5c27212d323bafef8a6c0f3e6541d9d74f25cc21b858","last_reissued_at":"2026-05-18T00:08:48.015505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:48.015505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.03708","source_version":2,"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:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uiYT/xZo8FMAv22N+Vh8Yb19UrQdM1MC105Q5RsqbGvoqTxTcnCbtEJ6vCatsY/WmGocDoQK+ZGx+oyYAWArCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:47:19.314744Z"},"content_sha256":"c670edaabdc9f6e9bf6d9c9fca288a974d0fa188dd3a2a51dd089487441587a7","schema_version":"1.0","event_id":"sha256:c670edaabdc9f6e9bf6d9c9fca288a974d0fa188dd3a2a51dd089487441587a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LUU44E7YHS2FOVZKLQTSCLJSHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Min-Cost Matching with Delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amit Jacob-Fanani, Yossi Azar","submitted_at":"2018-06-10T19:00:01Z","abstract_excerpt":"We consider the online Minimum-Cost Perfect Matching with Delays (MPMD) problem introduced by Emek et al. (STOC 2016), in which a general metric space is given, and requests are submitted in different times in this space by an adversary. The goal is to match requests, while minimizing the sum of distances between matched pairs in addition to the time intervals passed from the moment each request appeared until it is matched.\n  In the online Minimum-Cost Bipartite Perfect Matching with Delays (MBPMD) problem introduced by Ashlagi et al. (APPROX/RANDOM 2017), each request is also associated with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03708","kind":"arxiv","version":2},"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:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsJuBcd/RxkDZD3y6HLedNFkXx7R6NwIQbIa4gS3llAHzt3TcX5SyP/wcAXrlY75pt4n2lXS753gcSEXmnDOBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:47:19.315083Z"},"content_sha256":"8558de870e0304e82bd19c252716a7f445247705caee54a4f39e393dbe6b870e","schema_version":"1.0","event_id":"sha256:8558de870e0304e82bd19c252716a7f445247705caee54a4f39e393dbe6b870e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUU44E7YHS2FOVZKLQTSCLJSHO/bundle.json","state_url":"https://pith.science/pith/LUU44E7YHS2FOVZKLQTSCLJSHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUU44E7YHS2FOVZKLQTSCLJSHO/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-28T10:47:19Z","links":{"resolver":"https://pith.science/pith/LUU44E7YHS2FOVZKLQTSCLJSHO","bundle":"https://pith.science/pith/LUU44E7YHS2FOVZKLQTSCLJSHO/bundle.json","state":"https://pith.science/pith/LUU44E7YHS2FOVZKLQTSCLJSHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUU44E7YHS2FOVZKLQTSCLJSHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LUU44E7YHS2FOVZKLQTSCLJSHO","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":"2fa3c45dac6c540f795dfb8624c3fbb8b007b6326245e17f611124437eb5b872","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T19:00:01Z","title_canon_sha256":"fa7953fff96c14e0ccdd7350d0be62b3b7d50e08c50ca1143628668a34ffa426"},"schema_version":"1.0","source":{"id":"1806.03708","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03708","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03708v2","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03708","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"LUU44E7YHS2F","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LUU44E7YHS2FOVZK","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LUU44E7Y","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:8558de870e0304e82bd19c252716a7f445247705caee54a4f39e393dbe6b870e","target":"graph","created_at":"2026-05-18T00:08:48Z","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 online Minimum-Cost Perfect Matching with Delays (MPMD) problem introduced by Emek et al. (STOC 2016), in which a general metric space is given, and requests are submitted in different times in this space by an adversary. The goal is to match requests, while minimizing the sum of distances between matched pairs in addition to the time intervals passed from the moment each request appeared until it is matched.\n  In the online Minimum-Cost Bipartite Perfect Matching with Delays (MBPMD) problem introduced by Ashlagi et al. (APPROX/RANDOM 2017), each request is also associated with","authors_text":"Amit Jacob-Fanani, Yossi Azar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T19:00:01Z","title":"Deterministic Min-Cost Matching with Delays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03708","kind":"arxiv","version":2},"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:c670edaabdc9f6e9bf6d9c9fca288a974d0fa188dd3a2a51dd089487441587a7","target":"record","created_at":"2026-05-18T00:08:48Z","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":"2fa3c45dac6c540f795dfb8624c3fbb8b007b6326245e17f611124437eb5b872","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-10T19:00:01Z","title_canon_sha256":"fa7953fff96c14e0ccdd7350d0be62b3b7d50e08c50ca1143628668a34ffa426"},"schema_version":"1.0","source":{"id":"1806.03708","kind":"arxiv","version":2}},"canonical_sha256":"5d29ce13f83cb457572a5c27212d323bafef8a6c0f3e6541d9d74f25cc21b858","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d29ce13f83cb457572a5c27212d323bafef8a6c0f3e6541d9d74f25cc21b858","first_computed_at":"2026-05-18T00:08:48.015505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:48.015505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cMHINz+hKrSXateFAGoom02HYa4BKdVXDGOayN8fXJdow0knQ7RiRXKXhx6cbof0KuQKT7uNEi2RHLxmQM+tDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:48.016173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03708","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c670edaabdc9f6e9bf6d9c9fca288a974d0fa188dd3a2a51dd089487441587a7","sha256:8558de870e0304e82bd19c252716a7f445247705caee54a4f39e393dbe6b870e"],"state_sha256":"cefc1d2acd9b7a9523b315f49b876f964ee68106978970dbf7c34c7a29d24f94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TyZ1RWZpHRlTe/3N4XGq1vjtxH9iSr+hjSh2U/52FYVvGlH38LSEG51lmNJbUYJoxWAF4/cESEGbQWpD7MeODA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:47:19.317011Z","bundle_sha256":"630c2b826488851501b4025b0647c50cc4ce30c4cb9cf1bac91e628d058b863f"}}