{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UPVJIWTF2SEAJ3BLKNLF65WFZJ","short_pith_number":"pith:UPVJIWTF","schema_version":"1.0","canonical_sha256":"a3ea945a65d48804ec2b53565f76c5ca6567bedee15c282ea007956bdf28d4cc","source":{"kind":"arxiv","id":"1211.0948","version":1},"attestation_state":"computed","paper":{"title":"Percolation on infinite graphs and isoperimetric inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Aldo Procacci, Remy Sanchis, Rog\\'erio G. Alves","submitted_at":"2012-11-05T17:51:24Z","abstract_excerpt":"We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric inequality if the graph has a bi-infinite geodesic, or two isoperimetric inequalities if the graph has not a bi-infinite geodesic. This new criterion extends previous criteria and brings together a large class of amenable graphs (such as regular lattices) and non-amenable graphs (such trees). We also study the finite connectivity in graphs satisfying the new gene"},"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":"1211.0948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2012-11-05T17:51:24Z","cross_cats_sorted":["math.MP"],"title_canon_sha256":"f29d2d7409f9a27d1739a34a2f384494deb2014e839661a676b49c328f161440","abstract_canon_sha256":"d8b1f11bbce769ebc18c78790a2841b390ef74d9b88b01723ec06ed7373099e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:25.706564Z","signature_b64":"37HWrPj/ktxkeHWmcTA1C+ZiyxteJho+DcaGMBaOwk1FjLyXZ5aownlSLnsEKGplRdfQa9ZYhM5WjW/GeI8GAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3ea945a65d48804ec2b53565f76c5ca6567bedee15c282ea007956bdf28d4cc","last_reissued_at":"2026-05-18T01:53:25.706081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:25.706081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Percolation on infinite graphs and isoperimetric inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MP"],"primary_cat":"math-ph","authors_text":"Aldo Procacci, Remy Sanchis, Rog\\'erio G. Alves","submitted_at":"2012-11-05T17:51:24Z","abstract_excerpt":"We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric inequality if the graph has a bi-infinite geodesic, or two isoperimetric inequalities if the graph has not a bi-infinite geodesic. This new criterion extends previous criteria and brings together a large class of amenable graphs (such as regular lattices) and non-amenable graphs (such trees). We also study the finite connectivity in graphs satisfying the new gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0948","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.0948","created_at":"2026-05-18T01:53:25.706151+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0948v1","created_at":"2026-05-18T01:53:25.706151+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0948","created_at":"2026-05-18T01:53:25.706151+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPVJIWTF2SEA","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPVJIWTF2SEAJ3BL","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPVJIWTF","created_at":"2026-05-18T12:27:23.164592+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/UPVJIWTF2SEAJ3BLKNLF65WFZJ","json":"https://pith.science/pith/UPVJIWTF2SEAJ3BLKNLF65WFZJ.json","graph_json":"https://pith.science/api/pith-number/UPVJIWTF2SEAJ3BLKNLF65WFZJ/graph.json","events_json":"https://pith.science/api/pith-number/UPVJIWTF2SEAJ3BLKNLF65WFZJ/events.json","paper":"https://pith.science/paper/UPVJIWTF"},"agent_actions":{"view_html":"https://pith.science/pith/UPVJIWTF2SEAJ3BLKNLF65WFZJ","download_json":"https://pith.science/pith/UPVJIWTF2SEAJ3BLKNLF65WFZJ.json","view_paper":"https://pith.science/paper/UPVJIWTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0948&json=true","fetch_graph":"https://pith.science/api/pith-number/UPVJIWTF2SEAJ3BLKNLF65WFZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/UPVJIWTF2SEAJ3BLKNLF65WFZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPVJIWTF2SEAJ3BLKNLF65WFZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPVJIWTF2SEAJ3BLKNLF65WFZJ/action/storage_attestation","attest_author":"https://pith.science/pith/UPVJIWTF2SEAJ3BLKNLF65WFZJ/action/author_attestation","sign_citation":"https://pith.science/pith/UPVJIWTF2SEAJ3BLKNLF65WFZJ/action/citation_signature","submit_replication":"https://pith.science/pith/UPVJIWTF2SEAJ3BLKNLF65WFZJ/action/replication_record"}},"created_at":"2026-05-18T01:53:25.706151+00:00","updated_at":"2026-05-18T01:53:25.706151+00:00"}