{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:LPGG5FFSI4DPLTJT4DAD5GLGOK","short_pith_number":"pith:LPGG5FFS","schema_version":"1.0","canonical_sha256":"5bcc6e94b24706f5cd33e0c03e9966728e5f5dc2844142a238ac055b09d0a455","source":{"kind":"arxiv","id":"0911.0092","version":3},"attestation_state":"computed","paper":{"title":"Perfect Matchings as IID Factors on Non-Amenable Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.DS"],"primary_cat":"math.PR","authors_text":"Fedor Nazarov, Russell Lyons","submitted_at":"2009-10-31T16:25:51Z","abstract_excerpt":"We prove that in every bipartite Cayley graph of every non-amenable group, there is a perfect matching that is obtained as a factor of independent uniform random variables. We also discuss expansion properties of factors and improve the Hoffman spectral bound on independence number of finite graphs."},"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":"0911.0092","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2009-10-31T16:25:51Z","cross_cats_sorted":["math.CO","math.DS"],"title_canon_sha256":"fc1ca3dc2ec55bceda3e72c7e8fc2b87f67e548ebeaa28006f3e1f806e29ab0a","abstract_canon_sha256":"c2e4fd6eb50fea48bd3c783779668150348f65a893c63b6d15c00ebd9dee5510"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:55.127526Z","signature_b64":"n8zBsZOCZsAAcKtDQr77zGB+vxNd6DLLrav9hY62MFn0yArZKmorVNhOFau22kT9wUUGHz40r3W4+pZsK5ZzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bcc6e94b24706f5cd33e0c03e9966728e5f5dc2844142a238ac055b09d0a455","last_reissued_at":"2026-05-18T04:12:55.126168Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:55.126168Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Matchings as IID Factors on Non-Amenable Groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.DS"],"primary_cat":"math.PR","authors_text":"Fedor Nazarov, Russell Lyons","submitted_at":"2009-10-31T16:25:51Z","abstract_excerpt":"We prove that in every bipartite Cayley graph of every non-amenable group, there is a perfect matching that is obtained as a factor of independent uniform random variables. We also discuss expansion properties of factors and improve the Hoffman spectral bound on independence number of finite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0092","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":"0911.0092","created_at":"2026-05-18T04:12:55.126276+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.0092v3","created_at":"2026-05-18T04:12:55.126276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0092","created_at":"2026-05-18T04:12:55.126276+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPGG5FFSI4DP","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPGG5FFSI4DPLTJT","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPGG5FFS","created_at":"2026-05-18T12:26:00.592388+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/LPGG5FFSI4DPLTJT4DAD5GLGOK","json":"https://pith.science/pith/LPGG5FFSI4DPLTJT4DAD5GLGOK.json","graph_json":"https://pith.science/api/pith-number/LPGG5FFSI4DPLTJT4DAD5GLGOK/graph.json","events_json":"https://pith.science/api/pith-number/LPGG5FFSI4DPLTJT4DAD5GLGOK/events.json","paper":"https://pith.science/paper/LPGG5FFS"},"agent_actions":{"view_html":"https://pith.science/pith/LPGG5FFSI4DPLTJT4DAD5GLGOK","download_json":"https://pith.science/pith/LPGG5FFSI4DPLTJT4DAD5GLGOK.json","view_paper":"https://pith.science/paper/LPGG5FFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.0092&json=true","fetch_graph":"https://pith.science/api/pith-number/LPGG5FFSI4DPLTJT4DAD5GLGOK/graph.json","fetch_events":"https://pith.science/api/pith-number/LPGG5FFSI4DPLTJT4DAD5GLGOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPGG5FFSI4DPLTJT4DAD5GLGOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPGG5FFSI4DPLTJT4DAD5GLGOK/action/storage_attestation","attest_author":"https://pith.science/pith/LPGG5FFSI4DPLTJT4DAD5GLGOK/action/author_attestation","sign_citation":"https://pith.science/pith/LPGG5FFSI4DPLTJT4DAD5GLGOK/action/citation_signature","submit_replication":"https://pith.science/pith/LPGG5FFSI4DPLTJT4DAD5GLGOK/action/replication_record"}},"created_at":"2026-05-18T04:12:55.126276+00:00","updated_at":"2026-05-18T04:12:55.126276+00:00"}