{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PL4NUTGGUA4L5HG2LKY5YHZOVW","short_pith_number":"pith:PL4NUTGG","canonical_record":{"source":{"id":"1211.2374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T06:59:49Z","cross_cats_sorted":["math.DS","math.PR"],"title_canon_sha256":"d53901b6aead29ce781c695efb84383ddd6c548ddf59061fb8ad9960ba313a10","abstract_canon_sha256":"8824a446806e575c45f855eb81fcea768bcccca9969b5e4e097c38e8a08da202"},"schema_version":"1.0"},"canonical_sha256":"7af8da4cc6a038be9cda5ab1dc1f2ead877fa2df2560f4d0eff9c5625dc19cd1","source":{"kind":"arxiv","id":"1211.2374","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2374","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2374v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2374","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"PL4NUTGGUA4L","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PL4NUTGGUA4L5HG2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PL4NUTGG","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PL4NUTGGUA4L5HG2LKY5YHZOVW","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T06:59:49Z","cross_cats_sorted":["math.DS","math.PR"],"title_canon_sha256":"d53901b6aead29ce781c695efb84383ddd6c548ddf59061fb8ad9960ba313a10","abstract_canon_sha256":"8824a446806e575c45f855eb81fcea768bcccca9969b5e4e097c38e8a08da202"},"schema_version":"1.0"},"canonical_sha256":"7af8da4cc6a038be9cda5ab1dc1f2ead877fa2df2560f4d0eff9c5625dc19cd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:03.585933Z","signature_b64":"gFZJLvBDP8mkch0+yNdYFArWwKvdR076EIinzJbf7cqUpijMFUkV8YdvGPbv/Ry1ni6DBI2Z1ryAFQeor5psDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7af8da4cc6a038be9cda5ab1dc1f2ead877fa2df2560f4d0eff9c5625dc19cd1","last_reissued_at":"2026-05-18T03:41:03.585426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:03.585426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2374","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-05-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MKBJGBPzvpZeEDagmj0hl2t7pX3RgKp4QZgDL26L5xhYiIqdouvJ0kE6IWHWJm7Aivg4/whq4rYQBwdLNuMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T19:56:05.068187Z"},"content_sha256":"89201bbdecabf12bc1acd8e290f6dcebcf8e94085fa82d89b5ca73f768b0503f","schema_version":"1.0","event_id":"sha256:89201bbdecabf12bc1acd8e290f6dcebcf8e94085fa82d89b5ca73f768b0503f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PL4NUTGGUA4L5HG2LKY5YHZOVW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Invariant random matchings in Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.PR"],"primary_cat":"math.CO","authors_text":"Endre Csoka, Gabor Lippner","submitted_at":"2012-11-11T06:59:49Z","abstract_excerpt":"We prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph admits an invariant random perfect matching. A key step in the proof is a result on graphings that also applies to finite graphs. The finite version says that for any partial matching of a finite regular graph that is a good expander, one can always find an augmenting path whose length is poly-logarithmic in one over the ratio of unmatched vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2374","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":""},"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-18T03:41:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DdxG9+xRDp4B0F3wY95xiiXf9JqYVtZ/24jEpoaQWHNV9wsHuzAMg5DUkeJnOaOFSS5BJwslf2bnv3SM5lUmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T19:56:05.068553Z"},"content_sha256":"143699ed611f46a52d1b5f1ee4da0e1c83353e434296c2541cd39f7d8c5b32b7","schema_version":"1.0","event_id":"sha256:143699ed611f46a52d1b5f1ee4da0e1c83353e434296c2541cd39f7d8c5b32b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PL4NUTGGUA4L5HG2LKY5YHZOVW/bundle.json","state_url":"https://pith.science/pith/PL4NUTGGUA4L5HG2LKY5YHZOVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PL4NUTGGUA4L5HG2LKY5YHZOVW/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-01T19:56:05Z","links":{"resolver":"https://pith.science/pith/PL4NUTGGUA4L5HG2LKY5YHZOVW","bundle":"https://pith.science/pith/PL4NUTGGUA4L5HG2LKY5YHZOVW/bundle.json","state":"https://pith.science/pith/PL4NUTGGUA4L5HG2LKY5YHZOVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PL4NUTGGUA4L5HG2LKY5YHZOVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PL4NUTGGUA4L5HG2LKY5YHZOVW","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":"8824a446806e575c45f855eb81fcea768bcccca9969b5e4e097c38e8a08da202","cross_cats_sorted":["math.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T06:59:49Z","title_canon_sha256":"d53901b6aead29ce781c695efb84383ddd6c548ddf59061fb8ad9960ba313a10"},"schema_version":"1.0","source":{"id":"1211.2374","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2374","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2374v1","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2374","created_at":"2026-05-18T03:41:03Z"},{"alias_kind":"pith_short_12","alias_value":"PL4NUTGGUA4L","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PL4NUTGGUA4L5HG2","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PL4NUTGG","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:143699ed611f46a52d1b5f1ee4da0e1c83353e434296c2541cd39f7d8c5b32b7","target":"graph","created_at":"2026-05-18T03:41:03Z","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 prove that any non-amenable Cayley graph admits a factor of IID perfect matching. We also show that any connected d-regular vertex tran- sitive graph admits a perfect matching. The two results together imply that every Cayley graph admits an invariant random perfect matching. A key step in the proof is a result on graphings that also applies to finite graphs. The finite version says that for any partial matching of a finite regular graph that is a good expander, one can always find an augmenting path whose length is poly-logarithmic in one over the ratio of unmatched vertices.","authors_text":"Endre Csoka, Gabor Lippner","cross_cats":["math.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T06:59:49Z","title":"Invariant random matchings in Cayley graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2374","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:89201bbdecabf12bc1acd8e290f6dcebcf8e94085fa82d89b5ca73f768b0503f","target":"record","created_at":"2026-05-18T03:41:03Z","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":"8824a446806e575c45f855eb81fcea768bcccca9969b5e4e097c38e8a08da202","cross_cats_sorted":["math.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-11T06:59:49Z","title_canon_sha256":"d53901b6aead29ce781c695efb84383ddd6c548ddf59061fb8ad9960ba313a10"},"schema_version":"1.0","source":{"id":"1211.2374","kind":"arxiv","version":1}},"canonical_sha256":"7af8da4cc6a038be9cda5ab1dc1f2ead877fa2df2560f4d0eff9c5625dc19cd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7af8da4cc6a038be9cda5ab1dc1f2ead877fa2df2560f4d0eff9c5625dc19cd1","first_computed_at":"2026-05-18T03:41:03.585426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:03.585426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gFZJLvBDP8mkch0+yNdYFArWwKvdR076EIinzJbf7cqUpijMFUkV8YdvGPbv/Ry1ni6DBI2Z1ryAFQeor5psDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:03.585933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2374","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89201bbdecabf12bc1acd8e290f6dcebcf8e94085fa82d89b5ca73f768b0503f","sha256:143699ed611f46a52d1b5f1ee4da0e1c83353e434296c2541cd39f7d8c5b32b7"],"state_sha256":"4c40c143ffac93f14b1b7c52548cabedf397c89635ecc6480891e2524595765b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5vZPeojd61Wk/MR7KHjltFBqYbAE8ON41yDHkOMTx2owMu+9QaDA2iBvL3lPMYrWHFT1xDAFykXUme9ZLFeDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T19:56:05.070483Z","bundle_sha256":"602065ebeaa3cbabc669155b4a8e8e1bec30a5b79d7318e337d8491251af225e"}}