{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZCAHB26QCHKFQDJ2K3ES3QFGEV","short_pith_number":"pith:ZCAHB26Q","schema_version":"1.0","canonical_sha256":"c88070ebd011d4580d3a56c92dc0a62557854be3f350a2c657eafb86259a9afa","source":{"kind":"arxiv","id":"1411.1044","version":3},"attestation_state":"computed","paper":{"title":"Approximate optimality with bounded regret in dynamic matching models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Ana Bu\\v{s}i\\'c, Sean Meyn","submitted_at":"2014-11-04T20:56:45Z","abstract_excerpt":"We consider a discrete-time bipartite matching model with random arrivals of units of supply and demand that can wait in queues located at the nodes in the network. A control policy determines which are matched at each time. The focus is on the infinite-horizon average-cost optimal control problem. A relaxation of the stochastic control problem is proposed, which is found to be a special case of an inventory model, as treated in the classical theory of Clark and Scarf. The optimal policy for the relaxation admits a closed-form expression. Based on the policy for this relaxation, a new matching"},"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":"1411.1044","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-11-04T20:56:45Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"87cafe933bc5c96570b33a60d1709ce5ba8421b21c346574c69c63dc6b44079f","abstract_canon_sha256":"cf64087c1832c2e2fa7a1671328b9514fbde408336e05d5be75c5adcaaf36bf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:55.315668Z","signature_b64":"Gr3HRuDlMQ19slZZQZA+E6dvF0gQ4csBHHVfptBLiEIzz75Zlncp4tjUpGj6dbtNqZDkp/n/DIT9A03ZZzyCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88070ebd011d4580d3a56c92dc0a62557854be3f350a2c657eafb86259a9afa","last_reissued_at":"2026-05-18T01:11:55.315332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:55.315332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate optimality with bounded regret in dynamic matching models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DM","authors_text":"Ana Bu\\v{s}i\\'c, Sean Meyn","submitted_at":"2014-11-04T20:56:45Z","abstract_excerpt":"We consider a discrete-time bipartite matching model with random arrivals of units of supply and demand that can wait in queues located at the nodes in the network. A control policy determines which are matched at each time. The focus is on the infinite-horizon average-cost optimal control problem. A relaxation of the stochastic control problem is proposed, which is found to be a special case of an inventory model, as treated in the classical theory of Clark and Scarf. The optimal policy for the relaxation admits a closed-form expression. Based on the policy for this relaxation, a new matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1044","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":""},"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":"1411.1044","created_at":"2026-05-18T01:11:55.315387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1044v3","created_at":"2026-05-18T01:11:55.315387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1044","created_at":"2026-05-18T01:11:55.315387+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCAHB26QCHKF","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCAHB26QCHKFQDJ2","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCAHB26Q","created_at":"2026-05-18T12:28:59.999130+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/ZCAHB26QCHKFQDJ2K3ES3QFGEV","json":"https://pith.science/pith/ZCAHB26QCHKFQDJ2K3ES3QFGEV.json","graph_json":"https://pith.science/api/pith-number/ZCAHB26QCHKFQDJ2K3ES3QFGEV/graph.json","events_json":"https://pith.science/api/pith-number/ZCAHB26QCHKFQDJ2K3ES3QFGEV/events.json","paper":"https://pith.science/paper/ZCAHB26Q"},"agent_actions":{"view_html":"https://pith.science/pith/ZCAHB26QCHKFQDJ2K3ES3QFGEV","download_json":"https://pith.science/pith/ZCAHB26QCHKFQDJ2K3ES3QFGEV.json","view_paper":"https://pith.science/paper/ZCAHB26Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1044&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCAHB26QCHKFQDJ2K3ES3QFGEV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCAHB26QCHKFQDJ2K3ES3QFGEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCAHB26QCHKFQDJ2K3ES3QFGEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCAHB26QCHKFQDJ2K3ES3QFGEV/action/storage_attestation","attest_author":"https://pith.science/pith/ZCAHB26QCHKFQDJ2K3ES3QFGEV/action/author_attestation","sign_citation":"https://pith.science/pith/ZCAHB26QCHKFQDJ2K3ES3QFGEV/action/citation_signature","submit_replication":"https://pith.science/pith/ZCAHB26QCHKFQDJ2K3ES3QFGEV/action/replication_record"}},"created_at":"2026-05-18T01:11:55.315387+00:00","updated_at":"2026-05-18T01:11:55.315387+00:00"}