{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QSKAZEAG5KRGOKRHHJM4JFLRRY","short_pith_number":"pith:QSKAZEAG","canonical_record":{"source":{"id":"1804.08097","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-22T11:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"8009ed52ceab93fb28559f08c0f6d9e58e266a99a933dd010ae392ab09353aea","abstract_canon_sha256":"8c7d64ed7d0190a2f5ccced67189d6da78ddc1fc457a8bb44ca9a5959ee946dd"},"schema_version":"1.0"},"canonical_sha256":"84940c9006eaa2672a273a59c495718e2ed4ea4004a0466366a86c116073f662","source":{"kind":"arxiv","id":"1804.08097","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08097","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08097v2","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08097","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"QSKAZEAG5KRG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QSKAZEAG5KRGOKRH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QSKAZEAG","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QSKAZEAG5KRGOKRHHJM4JFLRRY","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08097","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-22T11:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"8009ed52ceab93fb28559f08c0f6d9e58e266a99a933dd010ae392ab09353aea","abstract_canon_sha256":"8c7d64ed7d0190a2f5ccced67189d6da78ddc1fc457a8bb44ca9a5959ee946dd"},"schema_version":"1.0"},"canonical_sha256":"84940c9006eaa2672a273a59c495718e2ed4ea4004a0466366a86c116073f662","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:11.587536Z","signature_b64":"x0ZjOa8hFLC5dIfoptSOyWNezD8Cio6TFK5/fLFLywr368Oi6IUsy4T2UEF0hxbJL5Uud1O51ckHLSL9OVhdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84940c9006eaa2672a273a59c495718e2ed4ea4004a0466366a86c116073f662","last_reissued_at":"2026-05-18T00:06:11.586728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:11.586728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08097","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:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDndlYRRGRvwf2HTBLAEoSOSP4RVH9aMMmu3zYG+tdv19VzwTcoRCuTXtebyM7V2e4QHsyF62AYLrE+gkg9EAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:04:56.169873Z"},"content_sha256":"11eaddb1c42758ddc986ec1dde69ccc57ad09db08eb978e1ec472468d74a4d71","schema_version":"1.0","event_id":"sha256:11eaddb1c42758ddc986ec1dde69ccc57ad09db08eb978e1ec472468d74a4d71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QSKAZEAG5KRGOKRHHJM4JFLRRY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Primal-Dual Online Deterministic Algorithm for Matching with Delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Artur Kraska, Hsiang-Hsuan Liu, Marcin Bienkowski, Pawe{\\l} Schmidt","submitted_at":"2018-04-22T11:11:31Z","abstract_excerpt":"In the Min-cost Perfect Matching with Delays (MPMD) problem, 2 m requests arrive over time at points of a metric space. An online algorithm has to connect these requests in pairs, but a decision to match may be postponed till a more suitable matching pair is found. The goal is to minimize the joint cost of connection and the total waiting time of all requests.\n  We present an O(m)-competitive deterministic algorithm for this problem, improving on an existing bound of O(m^(log(5.5))) = O(m^2.46). Our algorithm also solves (with the same competitive ratio) a bipartite variant of MPMD, where requ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08097","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:06:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jF/LBj1hmQytQ3Ap3Is3z1msUh4Zfr9QSRhZ8aXuVjEyKoFgiaS7Wz4RfmfHUVGd0BhH15U44jqXsO37AGqbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:04:56.170580Z"},"content_sha256":"2293a47fca6bf04240dbc2c64b2d00ab2505d6e07baac802aa88e1e1fc2ed3f1","schema_version":"1.0","event_id":"sha256:2293a47fca6bf04240dbc2c64b2d00ab2505d6e07baac802aa88e1e1fc2ed3f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QSKAZEAG5KRGOKRHHJM4JFLRRY/bundle.json","state_url":"https://pith.science/pith/QSKAZEAG5KRGOKRHHJM4JFLRRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QSKAZEAG5KRGOKRHHJM4JFLRRY/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-26T05:04:56Z","links":{"resolver":"https://pith.science/pith/QSKAZEAG5KRGOKRHHJM4JFLRRY","bundle":"https://pith.science/pith/QSKAZEAG5KRGOKRHHJM4JFLRRY/bundle.json","state":"https://pith.science/pith/QSKAZEAG5KRGOKRHHJM4JFLRRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QSKAZEAG5KRGOKRHHJM4JFLRRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QSKAZEAG5KRGOKRHHJM4JFLRRY","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":"8c7d64ed7d0190a2f5ccced67189d6da78ddc1fc457a8bb44ca9a5959ee946dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-22T11:11:31Z","title_canon_sha256":"8009ed52ceab93fb28559f08c0f6d9e58e266a99a933dd010ae392ab09353aea"},"schema_version":"1.0","source":{"id":"1804.08097","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08097","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08097v2","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08097","created_at":"2026-05-18T00:06:11Z"},{"alias_kind":"pith_short_12","alias_value":"QSKAZEAG5KRG","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QSKAZEAG5KRGOKRH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QSKAZEAG","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:2293a47fca6bf04240dbc2c64b2d00ab2505d6e07baac802aa88e1e1fc2ed3f1","target":"graph","created_at":"2026-05-18T00:06:11Z","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 Min-cost Perfect Matching with Delays (MPMD) problem, 2 m requests arrive over time at points of a metric space. An online algorithm has to connect these requests in pairs, but a decision to match may be postponed till a more suitable matching pair is found. The goal is to minimize the joint cost of connection and the total waiting time of all requests.\n  We present an O(m)-competitive deterministic algorithm for this problem, improving on an existing bound of O(m^(log(5.5))) = O(m^2.46). Our algorithm also solves (with the same competitive ratio) a bipartite variant of MPMD, where requ","authors_text":"Artur Kraska, Hsiang-Hsuan Liu, Marcin Bienkowski, Pawe{\\l} Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-22T11:11:31Z","title":"A Primal-Dual Online Deterministic Algorithm for Matching with Delays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08097","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:11eaddb1c42758ddc986ec1dde69ccc57ad09db08eb978e1ec472468d74a4d71","target":"record","created_at":"2026-05-18T00:06:11Z","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":"8c7d64ed7d0190a2f5ccced67189d6da78ddc1fc457a8bb44ca9a5959ee946dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-22T11:11:31Z","title_canon_sha256":"8009ed52ceab93fb28559f08c0f6d9e58e266a99a933dd010ae392ab09353aea"},"schema_version":"1.0","source":{"id":"1804.08097","kind":"arxiv","version":2}},"canonical_sha256":"84940c9006eaa2672a273a59c495718e2ed4ea4004a0466366a86c116073f662","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84940c9006eaa2672a273a59c495718e2ed4ea4004a0466366a86c116073f662","first_computed_at":"2026-05-18T00:06:11.586728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:11.586728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x0ZjOa8hFLC5dIfoptSOyWNezD8Cio6TFK5/fLFLywr368Oi6IUsy4T2UEF0hxbJL5Uud1O51ckHLSL9OVhdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:11.587536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08097","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11eaddb1c42758ddc986ec1dde69ccc57ad09db08eb978e1ec472468d74a4d71","sha256:2293a47fca6bf04240dbc2c64b2d00ab2505d6e07baac802aa88e1e1fc2ed3f1"],"state_sha256":"2268187eee39fea8b41941cabc6a01f010399ef2832eecaede7ad5ceaa9ff2db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEgsfvGYA0ZP7d7DRde2H3OoH2kOpnVHH51KUiu1ee040uVyzCPK3IE8iXVFcUu73Z9/UrSIUZGhMSD8BHsZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T05:04:56.174055Z","bundle_sha256":"76ab6b3e8b01d5b0db15533dae48619f654c061a484df0509dd98e0c8d430a8f"}}