{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:O7GAN2NFC6B3C2JXZ2FGBPMELG","short_pith_number":"pith:O7GAN2NF","schema_version":"1.0","canonical_sha256":"77cc06e9a51783b16937ce8a60bd8459aedf9aaf5554a181d8dd8e65244c311a","source":{"kind":"arxiv","id":"2305.00187","version":2},"attestation_state":"computed","paper":{"title":"On the sub-additivity of stochastic matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ana Busic, Jean Mairesse, Pascal Moyal","submitted_at":"2023-04-29T07:04:18Z","abstract_excerpt":"We consider a stochastic matching model with a general compatibility graph, as introduced in \\cite{MaiMoy16}. We prove that most common matching policies (including FCFM, priorities and random) satisfy a particular sub-additive property, which we exploit to show in many cases, the coupling-from-the-past to the steady state, using a backwards scheme {\\em \\`a la} Loynes. We then use these results to explicitly construct perfect bi-infinite matchings, and to build a perfect simulation algorithm in the case where the buffer of the system is finite."},"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":"2305.00187","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-04-29T07:04:18Z","cross_cats_sorted":[],"title_canon_sha256":"8d56248d668757d96b2e1c5a3fb2dcc8ad535c96d809bfbaf2374bd864bbf400","abstract_canon_sha256":"060abeee51c0638692b675d4333016c76ada6ef90586e38676dd7e409d2ad5bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:07:39.245810Z","signature_b64":"K1CBmmPPnKnoq2iT9eoIC25+IIMbOQv4g+rDyofD28GUadT95+5S82RnwOMvGS59E+X4k/DUvyoSaAOpv3NbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77cc06e9a51783b16937ce8a60bd8459aedf9aaf5554a181d8dd8e65244c311a","last_reissued_at":"2026-07-05T06:07:39.245374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:07:39.245374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the sub-additivity of stochastic matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Ana Busic, Jean Mairesse, Pascal Moyal","submitted_at":"2023-04-29T07:04:18Z","abstract_excerpt":"We consider a stochastic matching model with a general compatibility graph, as introduced in \\cite{MaiMoy16}. We prove that most common matching policies (including FCFM, priorities and random) satisfy a particular sub-additive property, which we exploit to show in many cases, the coupling-from-the-past to the steady state, using a backwards scheme {\\em \\`a la} Loynes. We then use these results to explicitly construct perfect bi-infinite matchings, and to build a perfect simulation algorithm in the case where the buffer of the system is finite."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.00187","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/2305.00187/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":"2305.00187","created_at":"2026-07-05T06:07:39.245432+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.00187v2","created_at":"2026-07-05T06:07:39.245432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00187","created_at":"2026-07-05T06:07:39.245432+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7GAN2NFC6B3","created_at":"2026-07-05T06:07:39.245432+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7GAN2NFC6B3C2JX","created_at":"2026-07-05T06:07:39.245432+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7GAN2NF","created_at":"2026-07-05T06:07:39.245432+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.08775","citing_title":"Adaptive Approximation Schemes for Matching Queues","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG","json":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG.json","graph_json":"https://pith.science/api/pith-number/O7GAN2NFC6B3C2JXZ2FGBPMELG/graph.json","events_json":"https://pith.science/api/pith-number/O7GAN2NFC6B3C2JXZ2FGBPMELG/events.json","paper":"https://pith.science/paper/O7GAN2NF"},"agent_actions":{"view_html":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG","download_json":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG.json","view_paper":"https://pith.science/paper/O7GAN2NF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.00187&json=true","fetch_graph":"https://pith.science/api/pith-number/O7GAN2NFC6B3C2JXZ2FGBPMELG/graph.json","fetch_events":"https://pith.science/api/pith-number/O7GAN2NFC6B3C2JXZ2FGBPMELG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/action/storage_attestation","attest_author":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/action/author_attestation","sign_citation":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/action/citation_signature","submit_replication":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/action/replication_record"}},"created_at":"2026-07-05T06:07:39.245432+00:00","updated_at":"2026-07-05T06:07:39.245432+00:00"}