{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NI6WAUGIURR3BJ6KA4MAIQVCE6","short_pith_number":"pith:NI6WAUGI","canonical_record":{"source":{"id":"2607.00536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T07:25:14Z","cross_cats_sorted":[],"title_canon_sha256":"e61dea9a9e5263d34afa89c184b911f73ee17f78b316cee4a5edb55acd895a2a","abstract_canon_sha256":"ab206968a6652aa83d554045b3bd9e96e1f728ad51734fe10e6f3c56eed4c1b8"},"schema_version":"1.0"},"canonical_sha256":"6a3d6050c8a463b0a7ca07180442a227aeaf3535a03a992fd96573d6955e5ed7","source":{"kind":"arxiv","id":"2607.00536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00536","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00536v1","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00536","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"NI6WAUGIURR3","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"pith_short_16","alias_value":"NI6WAUGIURR3BJ6K","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"pith_short_8","alias_value":"NI6WAUGI","created_at":"2026-07-02T01:17:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NI6WAUGIURR3BJ6KA4MAIQVCE6","target":"record","payload":{"canonical_record":{"source":{"id":"2607.00536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T07:25:14Z","cross_cats_sorted":[],"title_canon_sha256":"e61dea9a9e5263d34afa89c184b911f73ee17f78b316cee4a5edb55acd895a2a","abstract_canon_sha256":"ab206968a6652aa83d554045b3bd9e96e1f728ad51734fe10e6f3c56eed4c1b8"},"schema_version":"1.0"},"canonical_sha256":"6a3d6050c8a463b0a7ca07180442a227aeaf3535a03a992fd96573d6955e5ed7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:17:46.949041Z","signature_b64":"EU7I9UQkZRSFJNu0sOsaT/lhvhHsDxx666VUZRFGi3FnlrCEQjtCUMeZNRLWm/hmuWU0Cx2ruK5BPAdN62lBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a3d6050c8a463b0a7ca07180442a227aeaf3535a03a992fd96573d6955e5ed7","last_reissued_at":"2026-07-02T01:17:46.948680Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:17:46.948680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.00536","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-07-02T01:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q5HfDmK0Qu3mxJXeTv+fMUVadeTK4G6yv5mOPrwMlyfUbFkq7tKFrz2FJE1dF9EMOTCnGkvV9Fttxz+6JGHYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T00:20:15.901653Z"},"content_sha256":"848c510c470f1a8517a42ef4b9127fc46487bdddb88fa02e002f66045c42fc79","schema_version":"1.0","event_id":"sha256:848c510c470f1a8517a42ef4b9127fc46487bdddb88fa02e002f66045c42fc79"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NI6WAUGIURR3BJ6KA4MAIQVCE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Matching with Size-Based and Convex Delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junhao Gan, Seeun William Umboh, Xiao Sun","submitted_at":"2026-07-01T07:25:14Z","abstract_excerpt":"We study the online min-cost perfect matching with delay (MPMD) problem where $m$ requests arrive in a metric space of $n$ points. In MPMD, an algorithm can choose to match a request or to delay, and the objective is to minimise the sum of connection and delay costs. The connection cost of a match is the distance between the locations of two matched requests in the metric, and the increase of the delay cost is a function of the set of unmatched requests at every moment. In this paper, we study two different types of delay functions, size-based (MPMD-Size) and convex delays (MPMD-Convex).\n  The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00536","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.00536/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-02T01:17:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YK2JzDCcBOfvhCMHcpQHH/ajGD1Ozum7egSnIKFndAn1n1T1Bv5LzxtkZMbNEPypi+kV0DePZGz0GWyXe8UNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T00:20:15.902039Z"},"content_sha256":"7d0b54e4b0d6a81922c0b0f821f12779fe69d31774db1546d6746789e2d217d9","schema_version":"1.0","event_id":"sha256:7d0b54e4b0d6a81922c0b0f821f12779fe69d31774db1546d6746789e2d217d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/bundle.json","state_url":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/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-07-03T00:20:15Z","links":{"resolver":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6","bundle":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/bundle.json","state":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NI6WAUGIURR3BJ6KA4MAIQVCE6","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":"ab206968a6652aa83d554045b3bd9e96e1f728ad51734fe10e6f3c56eed4c1b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T07:25:14Z","title_canon_sha256":"e61dea9a9e5263d34afa89c184b911f73ee17f78b316cee4a5edb55acd895a2a"},"schema_version":"1.0","source":{"id":"2607.00536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00536","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00536v1","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00536","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"pith_short_12","alias_value":"NI6WAUGIURR3","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"pith_short_16","alias_value":"NI6WAUGIURR3BJ6K","created_at":"2026-07-02T01:17:46Z"},{"alias_kind":"pith_short_8","alias_value":"NI6WAUGI","created_at":"2026-07-02T01:17:46Z"}],"graph_snapshots":[{"event_id":"sha256:7d0b54e4b0d6a81922c0b0f821f12779fe69d31774db1546d6746789e2d217d9","target":"graph","created_at":"2026-07-02T01:17:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00536/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the online min-cost perfect matching with delay (MPMD) problem where $m$ requests arrive in a metric space of $n$ points. In MPMD, an algorithm can choose to match a request or to delay, and the objective is to minimise the sum of connection and delay costs. The connection cost of a match is the distance between the locations of two matched requests in the metric, and the increase of the delay cost is a function of the set of unmatched requests at every moment. In this paper, we study two different types of delay functions, size-based (MPMD-Size) and convex delays (MPMD-Convex).\n  The","authors_text":"Junhao Gan, Seeun William Umboh, Xiao Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00536","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:848c510c470f1a8517a42ef4b9127fc46487bdddb88fa02e002f66045c42fc79","target":"record","created_at":"2026-07-02T01:17:46Z","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":"ab206968a6652aa83d554045b3bd9e96e1f728ad51734fe10e6f3c56eed4c1b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T07:25:14Z","title_canon_sha256":"e61dea9a9e5263d34afa89c184b911f73ee17f78b316cee4a5edb55acd895a2a"},"schema_version":"1.0","source":{"id":"2607.00536","kind":"arxiv","version":1}},"canonical_sha256":"6a3d6050c8a463b0a7ca07180442a227aeaf3535a03a992fd96573d6955e5ed7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a3d6050c8a463b0a7ca07180442a227aeaf3535a03a992fd96573d6955e5ed7","first_computed_at":"2026-07-02T01:17:46.948680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:17:46.948680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EU7I9UQkZRSFJNu0sOsaT/lhvhHsDxx666VUZRFGi3FnlrCEQjtCUMeZNRLWm/hmuWU0Cx2ruK5BPAdN62lBBQ==","signature_status":"signed_v1","signed_at":"2026-07-02T01:17:46.949041Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:848c510c470f1a8517a42ef4b9127fc46487bdddb88fa02e002f66045c42fc79","sha256:7d0b54e4b0d6a81922c0b0f821f12779fe69d31774db1546d6746789e2d217d9"],"state_sha256":"c7693438ae5f4108a433730cde7b36b559a5d3c9d17cfaf2ed32c26ca1f70c5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPZ9Aotkt6SxoFX2Cb9n20mh/SqDFeC8EoirVADYTYIMEcuD9VVlT4yeZ4kdESxpyS807Mq4Otzv064WWWW+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T00:20:15.904116Z","bundle_sha256":"d46ccca8e6719756e5eea4de3edf843e784af461b343b60adc56652d24cf8498"}}