{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4KMLWSKJYRMWFH3M5ZYIOHJ6BY","short_pith_number":"pith:4KMLWSKJ","schema_version":"1.0","canonical_sha256":"e298bb4949c459629f6cee70871d3e0e2b0f67307c373f2c62539a0626238258","source":{"kind":"arxiv","id":"2501.08775","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Approximation Schemes for Matching Queues","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Aouad, Alireza Amanihamedani, Amin Saberi","submitted_at":"2025-01-15T12:56:38Z","abstract_excerpt":"We study a continuous-time, infinite-horizon dynamic bipartite matching problem. Suppliers arrive according to a Poisson process; while waiting, they may abandon the queue at a uniform rate. Customers on the other hand must be matched upon arrival. The objective is to minimize the expected long-term average cost subject to a throughput constraint on the total match rate.\n  Previous literature on dynamic matching focuses on \"static\" policies, where the matching decisions do not depend explicitly on the state of the supplier queues, achieving constant-factor approximations. By contrast, we desig"},"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":"2501.08775","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-15T12:56:38Z","cross_cats_sorted":[],"title_canon_sha256":"44ee0aa0e9128e431ec934a0f27548e13713d99e244f9b9e717f3e16fb46f47d","abstract_canon_sha256":"439e9ed03d5ab235f31ed5bcabd9a98965e4ea81117ea35d915091bd9a754099"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:02.213744Z","signature_b64":"HGtRFxgIl/MFWBxm+D8oDJLfK8vwcFJFCZnJqbr+2cKjF7gtkHuo3S9gkPH/0ikJQqhAi14wa616Bymambv6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e298bb4949c459629f6cee70871d3e0e2b0f67307c373f2c62539a0626238258","last_reissued_at":"2026-07-05T11:14:02.213227Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:02.213227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Approximation Schemes for Matching Queues","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Aouad, Alireza Amanihamedani, Amin Saberi","submitted_at":"2025-01-15T12:56:38Z","abstract_excerpt":"We study a continuous-time, infinite-horizon dynamic bipartite matching problem. Suppliers arrive according to a Poisson process; while waiting, they may abandon the queue at a uniform rate. Customers on the other hand must be matched upon arrival. The objective is to minimize the expected long-term average cost subject to a throughput constraint on the total match rate.\n  Previous literature on dynamic matching focuses on \"static\" policies, where the matching decisions do not depend explicitly on the state of the supplier queues, achieving constant-factor approximations. By contrast, we desig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.08775","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.08775/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":"2501.08775","created_at":"2026-07-05T11:14:02.213288+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.08775v2","created_at":"2026-07-05T11:14:02.213288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.08775","created_at":"2026-07-05T11:14:02.213288+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KMLWSKJYRMW","created_at":"2026-07-05T11:14:02.213288+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KMLWSKJYRMWFH3M","created_at":"2026-07-05T11:14:02.213288+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KMLWSKJ","created_at":"2026-07-05T11:14:02.213288+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/4KMLWSKJYRMWFH3M5ZYIOHJ6BY","json":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY.json","graph_json":"https://pith.science/api/pith-number/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/graph.json","events_json":"https://pith.science/api/pith-number/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/events.json","paper":"https://pith.science/paper/4KMLWSKJ"},"agent_actions":{"view_html":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY","download_json":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY.json","view_paper":"https://pith.science/paper/4KMLWSKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.08775&json=true","fetch_graph":"https://pith.science/api/pith-number/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/graph.json","fetch_events":"https://pith.science/api/pith-number/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/action/storage_attestation","attest_author":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/action/author_attestation","sign_citation":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/action/citation_signature","submit_replication":"https://pith.science/pith/4KMLWSKJYRMWFH3M5ZYIOHJ6BY/action/replication_record"}},"created_at":"2026-07-05T11:14:02.213288+00:00","updated_at":"2026-07-05T11:14:02.213288+00:00"}