{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IRRL7FDC34NKV4P6UTUPJXNKKO","short_pith_number":"pith:IRRL7FDC","schema_version":"1.0","canonical_sha256":"4462bf9462df1aaaf1fea4e8f4ddaa53aead5078440f7eb7e35c02818eb7802f","source":{"kind":"arxiv","id":"2304.13784","version":1},"attestation_state":"computed","paper":{"title":"Characterizations of amenability through stochastic domination and finitary codings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Gourab Ray, Yinon Spinka","submitted_at":"2023-04-26T19:04:47Z","abstract_excerpt":"We establish new characterizations of amenability of graphs through two probabilistic notions: stochastic domination and finitary codings (also called finitary factors).\n  On the stochastic domination side, we show that the plus state of the Ising model at very low temperature stochastically dominates a high density Bernoulli percolation if and only if the underlying graph is nonamenable. This answers a question of Liggett and Steif. We prove a similar result for the ``infinite cluster process'' of Bernoulli percolation, which is of particular interest as this process is not monotone and does "},"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":"2304.13784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2023-04-26T19:04:47Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"4241f23af26a4e6c4e8eb17df302135c9f8ab0ee95275e75c1df67b9453ca477","abstract_canon_sha256":"9359141a1f1e07eed30599e14a490b2aec5065174f35204872b334dacc785c14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:04:57.188943Z","signature_b64":"CaLkrt2Hx8Q3gpL3xHT26z9VGf12cXn4QbGxXJpSttJDRV2vcnnbl4MrsK5gZ2yKurUDmGd0hlk91VKLDQINCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4462bf9462df1aaaf1fea4e8f4ddaa53aead5078440f7eb7e35c02818eb7802f","last_reissued_at":"2026-07-05T06:04:57.188543Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:04:57.188543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizations of amenability through stochastic domination and finitary codings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Gourab Ray, Yinon Spinka","submitted_at":"2023-04-26T19:04:47Z","abstract_excerpt":"We establish new characterizations of amenability of graphs through two probabilistic notions: stochastic domination and finitary codings (also called finitary factors).\n  On the stochastic domination side, we show that the plus state of the Ising model at very low temperature stochastically dominates a high density Bernoulli percolation if and only if the underlying graph is nonamenable. This answers a question of Liggett and Steif. We prove a similar result for the ``infinite cluster process'' of Bernoulli percolation, which is of particular interest as this process is not monotone and does "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.13784","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/2304.13784/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":"2304.13784","created_at":"2026-07-05T06:04:57.188605+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.13784v1","created_at":"2026-07-05T06:04:57.188605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.13784","created_at":"2026-07-05T06:04:57.188605+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRRL7FDC34NK","created_at":"2026-07-05T06:04:57.188605+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRRL7FDC34NKV4P6","created_at":"2026-07-05T06:04:57.188605+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRRL7FDC","created_at":"2026-07-05T06:04:57.188605+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04797","citing_title":"Finitary codings and stochastic domination for Poisson representable processes","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IRRL7FDC34NKV4P6UTUPJXNKKO","json":"https://pith.science/pith/IRRL7FDC34NKV4P6UTUPJXNKKO.json","graph_json":"https://pith.science/api/pith-number/IRRL7FDC34NKV4P6UTUPJXNKKO/graph.json","events_json":"https://pith.science/api/pith-number/IRRL7FDC34NKV4P6UTUPJXNKKO/events.json","paper":"https://pith.science/paper/IRRL7FDC"},"agent_actions":{"view_html":"https://pith.science/pith/IRRL7FDC34NKV4P6UTUPJXNKKO","download_json":"https://pith.science/pith/IRRL7FDC34NKV4P6UTUPJXNKKO.json","view_paper":"https://pith.science/paper/IRRL7FDC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.13784&json=true","fetch_graph":"https://pith.science/api/pith-number/IRRL7FDC34NKV4P6UTUPJXNKKO/graph.json","fetch_events":"https://pith.science/api/pith-number/IRRL7FDC34NKV4P6UTUPJXNKKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRRL7FDC34NKV4P6UTUPJXNKKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRRL7FDC34NKV4P6UTUPJXNKKO/action/storage_attestation","attest_author":"https://pith.science/pith/IRRL7FDC34NKV4P6UTUPJXNKKO/action/author_attestation","sign_citation":"https://pith.science/pith/IRRL7FDC34NKV4P6UTUPJXNKKO/action/citation_signature","submit_replication":"https://pith.science/pith/IRRL7FDC34NKV4P6UTUPJXNKKO/action/replication_record"}},"created_at":"2026-07-05T06:04:57.188605+00:00","updated_at":"2026-07-05T06:04:57.188605+00:00"}