{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WA6L3ICAMJWE44EE33R7KZFETO","short_pith_number":"pith:WA6L3ICA","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"},"canonical_sha256":"b03cbda040626c4e7084dee3f564a49b8d1cc528a219df1d86b1cc4404a11b93","source":{"kind":"arxiv","id":"1608.01646","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01646","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01646v4","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01646","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"WA6L3ICAMJWE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WA6L3ICAMJWE44EE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WA6L3ICA","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WA6L3ICAMJWE44EE33R7KZFETO","target":"record","payload":{"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"},"canonical_sha256":"b03cbda040626c4e7084dee3f564a49b8d1cc528a219df1d86b1cc4404a11b93","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"},"source_kind":"arxiv","source_id":"1608.01646","source_version":4,"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-05-18T00:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wuUcRHpu+1Xi399xDBzEkMOa07q5pesYz2lAWfgJaik2RQsFk7HPpXD1snlKGgYvAcvr1AuS6/2KCz2RBJECBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:31:10.823458Z"},"content_sha256":"2b88b2e0506665f4e2b809292ab30c0cf78b355e28de6e06a087152b8cf1d9bb","schema_version":"1.0","event_id":"sha256:2b88b2e0506665f4e2b809292ab30c0cf78b355e28de6e06a087152b8cf1d9bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WA6L3ICAMJWE44EE33R7KZFETO","target":"graph","payload":{"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"},"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-05-18T00:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkTVfQqhlZQ1gmxEwMtRbKu3W2b6sE8sFB/nvS48ijpVEggPHaO3XiLkDhEwW0NBMS9qdub51qjBzAnjhxESCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:31:10.823810Z"},"content_sha256":"4b5c80e35a9409a123041c735e65ccdd7d3e1ee415bfd4185f7204f712a0325b","schema_version":"1.0","event_id":"sha256:4b5c80e35a9409a123041c735e65ccdd7d3e1ee415bfd4185f7204f712a0325b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO/bundle.json","state_url":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WA6L3ICAMJWE44EE33R7KZFETO/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-06-11T14:31:10Z","links":{"resolver":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO","bundle":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO/bundle.json","state":"https://pith.science/pith/WA6L3ICAMJWE44EE33R7KZFETO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WA6L3ICAMJWE44EE33R7KZFETO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WA6L3ICAMJWE44EE33R7KZFETO","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":"ae8f738fed5321fa0b678471915d36de06ebe8cfe5932cbc60b7f9d47f3c2a76","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-04T19:06:39Z","title_canon_sha256":"7ba6682d532aaee5d576ab7beb5ae91e54d6746bc82a818f670a70bf6636fd01"},"schema_version":"1.0","source":{"id":"1608.01646","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01646","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01646v4","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01646","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"WA6L3ICAMJWE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WA6L3ICAMJWE44EE","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WA6L3ICA","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:4b5c80e35a9409a123041c735e65ccdd7d3e1ee415bfd4185f7204f712a0325b","target":"graph","created_at":"2026-05-18T00:17:55Z","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"},"paper":{"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","authors_text":"Alexander L. Stolyar, Mohammadreza Nazari","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-04T19:06:39Z","title":"Reward Maximization in General Dynamic Matching Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01646","kind":"arxiv","version":4},"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:2b88b2e0506665f4e2b809292ab30c0cf78b355e28de6e06a087152b8cf1d9bb","target":"record","created_at":"2026-05-18T00:17:55Z","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":"ae8f738fed5321fa0b678471915d36de06ebe8cfe5932cbc60b7f9d47f3c2a76","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-08-04T19:06:39Z","title_canon_sha256":"7ba6682d532aaee5d576ab7beb5ae91e54d6746bc82a818f670a70bf6636fd01"},"schema_version":"1.0","source":{"id":"1608.01646","kind":"arxiv","version":4}},"canonical_sha256":"b03cbda040626c4e7084dee3f564a49b8d1cc528a219df1d86b1cc4404a11b93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b03cbda040626c4e7084dee3f564a49b8d1cc528a219df1d86b1cc4404a11b93","first_computed_at":"2026-05-18T00:17:55.254121Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:55.254121Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OTQ3TpvDnYQbGpzMjAs4vr4UFxPTFwJye/H+yYWTJ7Po7cCbf5f9GQBWV8DBeiL67Iy9lKSFmquyczSxLdsbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:55.254738Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01646","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b88b2e0506665f4e2b809292ab30c0cf78b355e28de6e06a087152b8cf1d9bb","sha256:4b5c80e35a9409a123041c735e65ccdd7d3e1ee415bfd4185f7204f712a0325b"],"state_sha256":"d97c497e862cbd20f83a82da2ba32a3cbf0638cbfd6a7d327b5066f70b20849d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D31nHLFNBttq/p4Z2F5f8etOr+x0+jyVzBi63YFpZlBqYH9BFOFp95rjAc/x6Axx+ocgvwUrHw0+t7kS1jfKDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:31:10.825820Z","bundle_sha256":"90aba7f09c423efcdbb6983218751b225798080b2fca2dbc7585c034749b4dcd"}}