{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UMZE4UP3A5XOOXKC7SPIJV3WRQ","short_pith_number":"pith:UMZE4UP3","schema_version":"1.0","canonical_sha256":"a3324e51fb076ee75d42fc9e84d7768c1167d4b999263f3b823c175eb245b0e3","source":{"kind":"arxiv","id":"1404.6677","version":3},"attestation_state":"computed","paper":{"title":"Stability of the stochastic matching model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jean Mairesse, Pascal Moyal","submitted_at":"2014-04-26T19:44:51Z","abstract_excerpt":"We introduce and study a new model that we call the {\\em matching model}. Items arrive one by one in a buffer and depart from it as soon as possible but by pairs. The items of a departing pair are said to be {\\em matched}. There is a finite set of classes $\\maV$ for the items, and the allowed matchings depend on the classes, according to a {\\em matching graph} on $\\maV$. Upon arrival, an item may find several possible matches in the buffer. This indeterminacy is resolved by a {\\em matching policy}. When the sequence of classes of the arriving items is i.i.d., the sequence of buffer-contents is"},"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":"1404.6677","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2014-04-26T19:44:51Z","cross_cats_sorted":[],"title_canon_sha256":"fda353e0bdaf03e34e15b3ffb04110f7a4fa882d8c79b10ac3beda3a648abf77","abstract_canon_sha256":"d4adbfa6fcac70d09fd476b1862d0459914a03fa6e6749019ba123de60052ad6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.219134Z","signature_b64":"y6LflP0p9nDLAEVPeLrcYf5Vfl82hyx4dLmZVsrxO5DvdB0JQTRNojNB6s4IgWyHNPc3ipIim5mXPzOTZEukAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3324e51fb076ee75d42fc9e84d7768c1167d4b999263f3b823c175eb245b0e3","last_reissued_at":"2026-05-18T01:13:05.218780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.218780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability of the stochastic matching model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jean Mairesse, Pascal Moyal","submitted_at":"2014-04-26T19:44:51Z","abstract_excerpt":"We introduce and study a new model that we call the {\\em matching model}. Items arrive one by one in a buffer and depart from it as soon as possible but by pairs. The items of a departing pair are said to be {\\em matched}. There is a finite set of classes $\\maV$ for the items, and the allowed matchings depend on the classes, according to a {\\em matching graph} on $\\maV$. Upon arrival, an item may find several possible matches in the buffer. This indeterminacy is resolved by a {\\em matching policy}. When the sequence of classes of the arriving items is i.i.d., the sequence of buffer-contents is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6677","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":"1404.6677","created_at":"2026-05-18T01:13:05.218836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6677v3","created_at":"2026-05-18T01:13:05.218836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6677","created_at":"2026-05-18T01:13:05.218836+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMZE4UP3A5XO","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMZE4UP3A5XOOXKC","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMZE4UP3","created_at":"2026-05-18T12:28:52.271510+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/UMZE4UP3A5XOOXKC7SPIJV3WRQ","json":"https://pith.science/pith/UMZE4UP3A5XOOXKC7SPIJV3WRQ.json","graph_json":"https://pith.science/api/pith-number/UMZE4UP3A5XOOXKC7SPIJV3WRQ/graph.json","events_json":"https://pith.science/api/pith-number/UMZE4UP3A5XOOXKC7SPIJV3WRQ/events.json","paper":"https://pith.science/paper/UMZE4UP3"},"agent_actions":{"view_html":"https://pith.science/pith/UMZE4UP3A5XOOXKC7SPIJV3WRQ","download_json":"https://pith.science/pith/UMZE4UP3A5XOOXKC7SPIJV3WRQ.json","view_paper":"https://pith.science/paper/UMZE4UP3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6677&json=true","fetch_graph":"https://pith.science/api/pith-number/UMZE4UP3A5XOOXKC7SPIJV3WRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UMZE4UP3A5XOOXKC7SPIJV3WRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMZE4UP3A5XOOXKC7SPIJV3WRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMZE4UP3A5XOOXKC7SPIJV3WRQ/action/storage_attestation","attest_author":"https://pith.science/pith/UMZE4UP3A5XOOXKC7SPIJV3WRQ/action/author_attestation","sign_citation":"https://pith.science/pith/UMZE4UP3A5XOOXKC7SPIJV3WRQ/action/citation_signature","submit_replication":"https://pith.science/pith/UMZE4UP3A5XOOXKC7SPIJV3WRQ/action/replication_record"}},"created_at":"2026-05-18T01:13:05.218836+00:00","updated_at":"2026-05-18T01:13:05.218836+00:00"}