{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:O7GAN2NFC6B3C2JXZ2FGBPMELG","short_pith_number":"pith:O7GAN2NF","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"},"canonical_sha256":"77cc06e9a51783b16937ce8a60bd8459aedf9aaf5554a181d8dd8e65244c311a","source":{"kind":"arxiv","id":"2305.00187","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.00187","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"arxiv_version","alias_value":"2305.00187v2","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00187","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"pith_short_12","alias_value":"O7GAN2NFC6B3","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"pith_short_16","alias_value":"O7GAN2NFC6B3C2JX","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"pith_short_8","alias_value":"O7GAN2NF","created_at":"2026-07-05T06:07:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:O7GAN2NFC6B3C2JXZ2FGBPMELG","target":"record","payload":{"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"},"canonical_sha256":"77cc06e9a51783b16937ce8a60bd8459aedf9aaf5554a181d8dd8e65244c311a","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"},"source_kind":"arxiv","source_id":"2305.00187","source_version":2,"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-07-05T06:07:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZX9Jq7JcyJTTxmRUgB5qvLi9yvhrxQ8hH6OS82a92RE2XCinr0w1TCaDT0EK//pdNFGb+fomm2CIzFbWzTXfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:32:32.661979Z"},"content_sha256":"b28e5604f993200427b819e31d8f9e23758981fb8945223c3cf3376ec18281e7","schema_version":"1.0","event_id":"sha256:b28e5604f993200427b819e31d8f9e23758981fb8945223c3cf3376ec18281e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:O7GAN2NFC6B3C2JXZ2FGBPMELG","target":"graph","payload":{"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"},"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-07-05T06:07:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LFpLvlT9p02qZCbqdKQzfP1mxK64Lhn5L2UdcG+keSmeQxxBGjVhkcNeKezbDyCUuy3BI36D2zCG/eQh3QSCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:32:32.662812Z"},"content_sha256":"8064eb83c47e0cf03092eda3b306f46b98c789e2ea0cefb7c1ffe3bfef2581f0","schema_version":"1.0","event_id":"sha256:8064eb83c47e0cf03092eda3b306f46b98c789e2ea0cefb7c1ffe3bfef2581f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/bundle.json","state_url":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/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-08-13T14:32:32Z","links":{"resolver":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG","bundle":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/bundle.json","state":"https://pith.science/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7GAN2NFC6B3C2JXZ2FGBPMELG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:O7GAN2NFC6B3C2JXZ2FGBPMELG","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":"060abeee51c0638692b675d4333016c76ada6ef90586e38676dd7e409d2ad5bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-04-29T07:04:18Z","title_canon_sha256":"8d56248d668757d96b2e1c5a3fb2dcc8ad535c96d809bfbaf2374bd864bbf400"},"schema_version":"1.0","source":{"id":"2305.00187","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.00187","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"arxiv_version","alias_value":"2305.00187v2","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00187","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"pith_short_12","alias_value":"O7GAN2NFC6B3","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"pith_short_16","alias_value":"O7GAN2NFC6B3C2JX","created_at":"2026-07-05T06:07:39Z"},{"alias_kind":"pith_short_8","alias_value":"O7GAN2NF","created_at":"2026-07-05T06:07:39Z"}],"graph_snapshots":[{"event_id":"sha256:8064eb83c47e0cf03092eda3b306f46b98c789e2ea0cefb7c1ffe3bfef2581f0","target":"graph","created_at":"2026-07-05T06:07:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.00187/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Ana Busic, Jean Mairesse, Pascal Moyal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-04-29T07:04:18Z","title":"On the sub-additivity of stochastic matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.00187","kind":"arxiv","version":2},"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:b28e5604f993200427b819e31d8f9e23758981fb8945223c3cf3376ec18281e7","target":"record","created_at":"2026-07-05T06:07:39Z","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":"060abeee51c0638692b675d4333016c76ada6ef90586e38676dd7e409d2ad5bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-04-29T07:04:18Z","title_canon_sha256":"8d56248d668757d96b2e1c5a3fb2dcc8ad535c96d809bfbaf2374bd864bbf400"},"schema_version":"1.0","source":{"id":"2305.00187","kind":"arxiv","version":2}},"canonical_sha256":"77cc06e9a51783b16937ce8a60bd8459aedf9aaf5554a181d8dd8e65244c311a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77cc06e9a51783b16937ce8a60bd8459aedf9aaf5554a181d8dd8e65244c311a","first_computed_at":"2026-07-05T06:07:39.245374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:07:39.245374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K1CBmmPPnKnoq2iT9eoIC25+IIMbOQv4g+rDyofD28GUadT95+5S82RnwOMvGS59E+X4k/DUvyoSaAOpv3NbCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:07:39.245810Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.00187","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b28e5604f993200427b819e31d8f9e23758981fb8945223c3cf3376ec18281e7","sha256:8064eb83c47e0cf03092eda3b306f46b98c789e2ea0cefb7c1ffe3bfef2581f0"],"state_sha256":"3e8553da8bdef633872833495a2c7f9e8628273f6fddc4bfd29771c7b587116b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOGCrT5Jh5hwWNqy4wyYxRT+mjQSKoCw4nzMUCv5HpiHBgexOXlkJm0Gk5wZ04EEDZOZayes/0ZJDcbn8V75Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:32:32.668660Z","bundle_sha256":"e5f83a8f0a1844a76ea0d42a6fb8fd9af449efdff535cb4122173adc5c18d870"}}