{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:ZXUJE56GSVJL3AON532LN7LQET","short_pith_number":"pith:ZXUJE56G","canonical_record":{"source":{"id":"2106.06706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2021-06-12T07:38:28Z","cross_cats_sorted":[],"title_canon_sha256":"67d8d678e98b2e8f5a40318e216ac2677bf116c2afe24d9ddcabe95b5d963bd7","abstract_canon_sha256":"c0c873aa0cc1df748c1c73ae06c129b67c16c7d3c55def8ffad59fbce9e26a91"},"schema_version":"1.0"},"canonical_sha256":"cde89277c69552bd81cdeef4b6fd7024c88b941cbf3f73658036cd2a4a356036","source":{"kind":"arxiv","id":"2106.06706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06706","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06706v1","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06706","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZXUJE56GSVJL","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"pith_short_16","alias_value":"ZXUJE56GSVJL3AON","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"pith_short_8","alias_value":"ZXUJE56G","created_at":"2026-07-05T02:48:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:ZXUJE56GSVJL3AON532LN7LQET","target":"record","payload":{"canonical_record":{"source":{"id":"2106.06706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2021-06-12T07:38:28Z","cross_cats_sorted":[],"title_canon_sha256":"67d8d678e98b2e8f5a40318e216ac2677bf116c2afe24d9ddcabe95b5d963bd7","abstract_canon_sha256":"c0c873aa0cc1df748c1c73ae06c129b67c16c7d3c55def8ffad59fbce9e26a91"},"schema_version":"1.0"},"canonical_sha256":"cde89277c69552bd81cdeef4b6fd7024c88b941cbf3f73658036cd2a4a356036","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:48:40.479380Z","signature_b64":"zSPDUPJas16iK1cc/U5lBjVaFKkTIj5HZX6uWXLk0UYLW7GErwS8QDdY2CdcK+yynbHPYzR2yOuXhZpGiY4EBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cde89277c69552bd81cdeef4b6fd7024c88b941cbf3f73658036cd2a4a356036","last_reissued_at":"2026-07-05T02:48:40.478968Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:48:40.478968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.06706","source_version":1,"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-05T02:48:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUlxK7seD/ZmdVyb4zZCLT8nPZKFx7NAVLi0g3cGb+sBJb8JHLtRxhd0zB8WqA68Uf0m2GzAaMjAFCjtj6OKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:10:07.621643Z"},"content_sha256":"fc6b58f38e11e0cb83aeaebb639b6899a68a6b60243f58a5bfc2011dd71f0b45","schema_version":"1.0","event_id":"sha256:fc6b58f38e11e0cb83aeaebb639b6899a68a6b60243f58a5bfc2011dd71f0b45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:ZXUJE56GSVJL3AON532LN7LQET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Matching in a Probabilistic Environment","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Amin Saberi, Irene Lo, Mobin Y. Jeloudar, Tristan Pollner","submitted_at":"2021-06-12T07:38:28Z","abstract_excerpt":"We consider a model for repeated stochastic matching where compatibility is probabilistic, is realized the first time agents are matched, and persists in the future. Such a model has applications in the gig economy, kidney exchange, and mentorship matching.\n  We ask whether a $decentralized$ matching process can approximate the optimal online algorithm. In particular, we consider a decentralized $stable$ $matching$ process where agents match with the most compatible partner who does not prefer matching with someone else, and known compatible pairs continue matching in all future rounds. We dem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06706","kind":"arxiv","version":1},"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/2106.06706/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-05T02:48:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sKQfUlgxXSGQgxqAwMVvzrdbbHcg69+DfCxHyI1KBrzBDAs4hqkCcQnVpOq+K/3WxWSI7jJ402MssEh8gpkHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T15:10:07.621923Z"},"content_sha256":"cc6c3eeb0b147e09a722a25e2cceb75d409f71ca9fd82938c85f18f27cee4233","schema_version":"1.0","event_id":"sha256:cc6c3eeb0b147e09a722a25e2cceb75d409f71ca9fd82938c85f18f27cee4233"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXUJE56GSVJL3AON532LN7LQET/bundle.json","state_url":"https://pith.science/pith/ZXUJE56GSVJL3AON532LN7LQET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXUJE56GSVJL3AON532LN7LQET/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-07-31T15:10:07Z","links":{"resolver":"https://pith.science/pith/ZXUJE56GSVJL3AON532LN7LQET","bundle":"https://pith.science/pith/ZXUJE56GSVJL3AON532LN7LQET/bundle.json","state":"https://pith.science/pith/ZXUJE56GSVJL3AON532LN7LQET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXUJE56GSVJL3AON532LN7LQET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:ZXUJE56GSVJL3AON532LN7LQET","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":"c0c873aa0cc1df748c1c73ae06c129b67c16c7d3c55def8ffad59fbce9e26a91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2021-06-12T07:38:28Z","title_canon_sha256":"67d8d678e98b2e8f5a40318e216ac2677bf116c2afe24d9ddcabe95b5d963bd7"},"schema_version":"1.0","source":{"id":"2106.06706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.06706","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"arxiv_version","alias_value":"2106.06706v1","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06706","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZXUJE56GSVJL","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"pith_short_16","alias_value":"ZXUJE56GSVJL3AON","created_at":"2026-07-05T02:48:40Z"},{"alias_kind":"pith_short_8","alias_value":"ZXUJE56G","created_at":"2026-07-05T02:48:40Z"}],"graph_snapshots":[{"event_id":"sha256:cc6c3eeb0b147e09a722a25e2cceb75d409f71ca9fd82938c85f18f27cee4233","target":"graph","created_at":"2026-07-05T02:48:40Z","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/2106.06706/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a model for repeated stochastic matching where compatibility is probabilistic, is realized the first time agents are matched, and persists in the future. Such a model has applications in the gig economy, kidney exchange, and mentorship matching.\n  We ask whether a $decentralized$ matching process can approximate the optimal online algorithm. In particular, we consider a decentralized $stable$ $matching$ process where agents match with the most compatible partner who does not prefer matching with someone else, and known compatible pairs continue matching in all future rounds. We dem","authors_text":"Amin Saberi, Irene Lo, Mobin Y. Jeloudar, Tristan Pollner","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2021-06-12T07:38:28Z","title":"Decentralized Matching in a Probabilistic Environment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06706","kind":"arxiv","version":1},"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:fc6b58f38e11e0cb83aeaebb639b6899a68a6b60243f58a5bfc2011dd71f0b45","target":"record","created_at":"2026-07-05T02:48:40Z","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":"c0c873aa0cc1df748c1c73ae06c129b67c16c7d3c55def8ffad59fbce9e26a91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.GT","submitted_at":"2021-06-12T07:38:28Z","title_canon_sha256":"67d8d678e98b2e8f5a40318e216ac2677bf116c2afe24d9ddcabe95b5d963bd7"},"schema_version":"1.0","source":{"id":"2106.06706","kind":"arxiv","version":1}},"canonical_sha256":"cde89277c69552bd81cdeef4b6fd7024c88b941cbf3f73658036cd2a4a356036","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cde89277c69552bd81cdeef4b6fd7024c88b941cbf3f73658036cd2a4a356036","first_computed_at":"2026-07-05T02:48:40.478968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:48:40.478968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zSPDUPJas16iK1cc/U5lBjVaFKkTIj5HZX6uWXLk0UYLW7GErwS8QDdY2CdcK+yynbHPYzR2yOuXhZpGiY4EBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:48:40.479380Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.06706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc6b58f38e11e0cb83aeaebb639b6899a68a6b60243f58a5bfc2011dd71f0b45","sha256:cc6c3eeb0b147e09a722a25e2cceb75d409f71ca9fd82938c85f18f27cee4233"],"state_sha256":"40d76b7e86b4b5072050066f3b602f37b90a0740472c7fca0aa2fef5c0e5ac69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkYFSP/Pg8s2sRlA0h5ipSAAfCYL537NslymXUCUNWqKUZQLoUL5eKNqYMVBBTCt9D/ZjeMc0b2cb6Tfn8VeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T15:10:07.624677Z","bundle_sha256":"a30650b3167bf424b5d7e2aa91fd5f4e421c01c448b2584271a1fccfaa8ed2ab"}}