{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WA6L3ICAMJWE44EE33R7KZFETO","short_pith_number":"pith:WA6L3ICA","schema_version":"1.0","canonical_sha256":"b03cbda040626c4e7084dee3f564a49b8d1cc528a219df1d86b1cc4404a11b93","source":{"kind":"arxiv","id":"1608.01646","version":4},"attestation_state":"computed","paper":{"title":"Reward Maximization in General Dynamic Matching Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Alexander L. Stolyar, Mohammadreza Nazari","submitted_at":"2016-08-04T19:06:39Z","abstract_excerpt":"We consider a matching system with random arrivals of items of different types. The items wait in queues -- one per each item type -- until they are \"matched.\" Each matching requires certain quantities of items of different types; after a matching is activated, the associated items leave the system. There exists a finite set of possible matchings, each producing a certain amount of \"reward\". This model has a broad range of important applications, including assemble-to-order systems, Internet advertising, matching web portals, etc.\n  We propose an optimal matching scheme in the sense that it as"},"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":"1608.01646","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-04T19:06:39Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"7ba6682d532aaee5d576ab7beb5ae91e54d6746bc82a818f670a70bf6636fd01","abstract_canon_sha256":"ae8f738fed5321fa0b678471915d36de06ebe8cfe5932cbc60b7f9d47f3c2a76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:55.254738Z","signature_b64":"OTQ3TpvDnYQbGpzMjAs4vr4UFxPTFwJye/H+yYWTJ7Po7cCbf5f9GQBWV8DBeiL67Iy9lKSFmquyczSxLdsbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b03cbda040626c4e7084dee3f564a49b8d1cc528a219df1d86b1cc4404a11b93","last_reissued_at":"2026-05-18T00:17:55.254121Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:55.254121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reward Maximization in General Dynamic Matching Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.PR","authors_text":"Alexander L. Stolyar, Mohammadreza Nazari","submitted_at":"2016-08-04T19:06:39Z","abstract_excerpt":"We consider a matching system with random arrivals of items of different types. The items wait in queues -- one per each item type -- until they are \"matched.\" Each matching requires certain quantities of items of different types; after a matching is activated, the associated items leave the system. There exists a finite set of possible matchings, each producing a certain amount of \"reward\". This model has a broad range of important applications, including assemble-to-order systems, Internet advertising, matching web portals, etc.\n  We propose an optimal matching scheme in the sense that it as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01646","kind":"arxiv","version":4},"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":"1608.01646","created_at":"2026-05-18T00:17:55.254196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01646v4","created_at":"2026-05-18T00:17:55.254196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01646","created_at":"2026-05-18T00:17:55.254196+00:00"},{"alias_kind":"pith_short_12","alias_value":"WA6L3ICAMJWE","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WA6L3ICAMJWE44EE","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WA6L3ICA","created_at":"2026-05-18T12:30:48.956258+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/WA6L3ICAMJWE44EE33R7KZFETO","json":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO.json","graph_json":"https://pith.science/api/pith-number/WA6L3ICAMJWE44EE33R7KZFETO/graph.json","events_json":"https://pith.science/api/pith-number/WA6L3ICAMJWE44EE33R7KZFETO/events.json","paper":"https://pith.science/paper/WA6L3ICA"},"agent_actions":{"view_html":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO","download_json":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO.json","view_paper":"https://pith.science/paper/WA6L3ICA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01646&json=true","fetch_graph":"https://pith.science/api/pith-number/WA6L3ICAMJWE44EE33R7KZFETO/graph.json","fetch_events":"https://pith.science/api/pith-number/WA6L3ICAMJWE44EE33R7KZFETO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO/action/storage_attestation","attest_author":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO/action/author_attestation","sign_citation":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO/action/citation_signature","submit_replication":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO/action/replication_record"}},"created_at":"2026-05-18T00:17:55.254196+00:00","updated_at":"2026-05-18T00:17:55.254196+00:00"}