{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:BCGOKA5Q35UBOKHQQOYO2ZRVJF","short_pith_number":"pith:BCGOKA5Q","canonical_record":{"source":{"id":"2210.07018","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-10-13T13:26:41Z","cross_cats_sorted":[],"title_canon_sha256":"57632850e661b128c70171709320a961c187e4e836a56419e20c165d4c8c0312","abstract_canon_sha256":"252685c54fdbdefcc6dba5d342879317e03933da1bbe9cd036734eff3bad382a"},"schema_version":"1.0"},"canonical_sha256":"088ce503b0df681728f083b0ed6635496697b4755be6e36f5f0bf83fdeedfbd8","source":{"kind":"arxiv","id":"2210.07018","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.07018","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"arxiv_version","alias_value":"2210.07018v3","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.07018","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"pith_short_12","alias_value":"BCGOKA5Q35UB","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"pith_short_16","alias_value":"BCGOKA5Q35UBOKHQ","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"pith_short_8","alias_value":"BCGOKA5Q","created_at":"2026-07-05T09:57:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:BCGOKA5Q35UBOKHQQOYO2ZRVJF","target":"record","payload":{"canonical_record":{"source":{"id":"2210.07018","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-10-13T13:26:41Z","cross_cats_sorted":[],"title_canon_sha256":"57632850e661b128c70171709320a961c187e4e836a56419e20c165d4c8c0312","abstract_canon_sha256":"252685c54fdbdefcc6dba5d342879317e03933da1bbe9cd036734eff3bad382a"},"schema_version":"1.0"},"canonical_sha256":"088ce503b0df681728f083b0ed6635496697b4755be6e36f5f0bf83fdeedfbd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:17.789102Z","signature_b64":"810wIyKWPp7OIjlI6ECBOulOVYPINjFhgNA4/G/Q4+Q8Py4hlDbcNsm1sfl17L2vz8P2DVMjO0zRxrmyXi/iBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"088ce503b0df681728f083b0ed6635496697b4755be6e36f5f0bf83fdeedfbd8","last_reissued_at":"2026-07-05T09:57:17.788615Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:17.788615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.07018","source_version":3,"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-07-05T09:57:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YuptIlzygLc7K71OvZkDRhUFWH5bjmOTka5gS/0eRuCZ5g4DVnTYYUZCm3L/0JK7W7FGDoRXaTA3YQc3rzSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T03:51:07.623544Z"},"content_sha256":"907e7b94d71ece2cc22e6bc2065d97c1c40b3335f83109660dea2aab4c70334f","schema_version":"1.0","event_id":"sha256:907e7b94d71ece2cc22e6bc2065d97c1c40b3335f83109660dea2aab4c70334f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:BCGOKA5Q35UBOKHQQOYO2ZRVJF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online matching with delays and stochastic arrival times","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mathieu Mari, Micha{\\l} Paw{\\l}owski, Piotr Sankowski, Runtian Ren","submitted_at":"2022-10-13T13:26:41Z","abstract_excerpt":"This paper presents a new research direction for the Min-cost Perfect Matching with Delays (MPMD) - a problem introduced by Emek et al. (STOC'16). In the original version of this problem, we are given an $n$-point metric space, where requests arrive in an online fashion. The goal is to minimise the matching cost for an even number of requests. However, contrary to traditional online matching problems, a request does not have to be paired immediately at the time of its arrival. Instead, the decision of whether to match a request can be postponed for time $t$ at a delay cost of $t$. For this rea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.07018","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.07018/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"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-07-05T09:57:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/iLNDykwUpOfKBg4iQmrxTciLpd20pw3Xg5h5o2XWRMKS5bHyrfI1nIMU+I6Xh/vd+brxFIyTrXwd9RqO3SDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-11-16T03:51:07.623882Z"},"content_sha256":"2f68c353424b94c0e8f9dca7999d28ef5f1d0f929bb109095a88c2fef960a5d1","schema_version":"1.0","event_id":"sha256:2f68c353424b94c0e8f9dca7999d28ef5f1d0f929bb109095a88c2fef960a5d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCGOKA5Q35UBOKHQQOYO2ZRVJF/bundle.json","state_url":"https://pith.science/pith/BCGOKA5Q35UBOKHQQOYO2ZRVJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCGOKA5Q35UBOKHQQOYO2ZRVJF/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-11-16T03:51:07Z","links":{"resolver":"https://pith.science/pith/BCGOKA5Q35UBOKHQQOYO2ZRVJF","bundle":"https://pith.science/pith/BCGOKA5Q35UBOKHQQOYO2ZRVJF/bundle.json","state":"https://pith.science/pith/BCGOKA5Q35UBOKHQQOYO2ZRVJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCGOKA5Q35UBOKHQQOYO2ZRVJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BCGOKA5Q35UBOKHQQOYO2ZRVJF","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":"252685c54fdbdefcc6dba5d342879317e03933da1bbe9cd036734eff3bad382a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-10-13T13:26:41Z","title_canon_sha256":"57632850e661b128c70171709320a961c187e4e836a56419e20c165d4c8c0312"},"schema_version":"1.0","source":{"id":"2210.07018","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.07018","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"arxiv_version","alias_value":"2210.07018v3","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.07018","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"pith_short_12","alias_value":"BCGOKA5Q35UB","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"pith_short_16","alias_value":"BCGOKA5Q35UBOKHQ","created_at":"2026-07-05T09:57:17Z"},{"alias_kind":"pith_short_8","alias_value":"BCGOKA5Q","created_at":"2026-07-05T09:57:17Z"}],"graph_snapshots":[{"event_id":"sha256:2f68c353424b94c0e8f9dca7999d28ef5f1d0f929bb109095a88c2fef960a5d1","target":"graph","created_at":"2026-07-05T09:57:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.07018/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a new research direction for the Min-cost Perfect Matching with Delays (MPMD) - a problem introduced by Emek et al. (STOC'16). In the original version of this problem, we are given an $n$-point metric space, where requests arrive in an online fashion. The goal is to minimise the matching cost for an even number of requests. However, contrary to traditional online matching problems, a request does not have to be paired immediately at the time of its arrival. Instead, the decision of whether to match a request can be postponed for time $t$ at a delay cost of $t$. For this rea","authors_text":"Mathieu Mari, Micha{\\l} Paw{\\l}owski, Piotr Sankowski, Runtian Ren","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-10-13T13:26:41Z","title":"Online matching with delays and stochastic arrival times"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.07018","kind":"arxiv","version":3},"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:907e7b94d71ece2cc22e6bc2065d97c1c40b3335f83109660dea2aab4c70334f","target":"record","created_at":"2026-07-05T09:57:17Z","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":"252685c54fdbdefcc6dba5d342879317e03933da1bbe9cd036734eff3bad382a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-10-13T13:26:41Z","title_canon_sha256":"57632850e661b128c70171709320a961c187e4e836a56419e20c165d4c8c0312"},"schema_version":"1.0","source":{"id":"2210.07018","kind":"arxiv","version":3}},"canonical_sha256":"088ce503b0df681728f083b0ed6635496697b4755be6e36f5f0bf83fdeedfbd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"088ce503b0df681728f083b0ed6635496697b4755be6e36f5f0bf83fdeedfbd8","first_computed_at":"2026-07-05T09:57:17.788615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:57:17.788615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"810wIyKWPp7OIjlI6ECBOulOVYPINjFhgNA4/G/Q4+Q8Py4hlDbcNsm1sfl17L2vz8P2DVMjO0zRxrmyXi/iBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:57:17.789102Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.07018","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:907e7b94d71ece2cc22e6bc2065d97c1c40b3335f83109660dea2aab4c70334f","sha256:2f68c353424b94c0e8f9dca7999d28ef5f1d0f929bb109095a88c2fef960a5d1"],"state_sha256":"49c5791438bf4da7d6ea1efd97946a8d8248d66aa6d03745003df0c386ef7047"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upkszXyHOAIa81ALSWlG8CPH/riGmUQSEYzgFzx5atDKMN7Bu0wYReZEd2dmEXGRJGSIHKEMUzFE66qPC4lNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-11-16T03:51:07.630896Z","bundle_sha256":"7a2b00391f50350d76ba856117941b81c2bb9518f448aac13e188f43c14367d5"}}