{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NI6WAUGIURR3BJ6KA4MAIQVCE6","short_pith_number":"pith:NI6WAUGI","schema_version":"1.0","canonical_sha256":"6a3d6050c8a463b0a7ca07180442a227aeaf3535a03a992fd96573d6955e5ed7","source":{"kind":"arxiv","id":"2607.00536","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.00536","created_at":"2026-07-02T01:17:46.948730+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00536v1","created_at":"2026-07-02T01:17:46.948730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00536","created_at":"2026-07-02T01:17:46.948730+00:00"},{"alias_kind":"pith_short_12","alias_value":"NI6WAUGIURR3","created_at":"2026-07-02T01:17:46.948730+00:00"},{"alias_kind":"pith_short_16","alias_value":"NI6WAUGIURR3BJ6K","created_at":"2026-07-02T01:17:46.948730+00:00"},{"alias_kind":"pith_short_8","alias_value":"NI6WAUGI","created_at":"2026-07-02T01:17:46.948730+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/NI6WAUGIURR3BJ6KA4MAIQVCE6","json":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6.json","graph_json":"https://pith.science/api/pith-number/NI6WAUGIURR3BJ6KA4MAIQVCE6/graph.json","events_json":"https://pith.science/api/pith-number/NI6WAUGIURR3BJ6KA4MAIQVCE6/events.json","paper":"https://pith.science/paper/NI6WAUGI"},"agent_actions":{"view_html":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6","download_json":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6.json","view_paper":"https://pith.science/paper/NI6WAUGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00536&json=true","fetch_graph":"https://pith.science/api/pith-number/NI6WAUGIURR3BJ6KA4MAIQVCE6/graph.json","fetch_events":"https://pith.science/api/pith-number/NI6WAUGIURR3BJ6KA4MAIQVCE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/action/storage_attestation","attest_author":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/action/author_attestation","sign_citation":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/action/citation_signature","submit_replication":"https://pith.science/pith/NI6WAUGIURR3BJ6KA4MAIQVCE6/action/replication_record"}},"created_at":"2026-07-02T01:17:46.948730+00:00","updated_at":"2026-07-02T01:17:46.948730+00:00"}