{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:J6TANJCUY2CRVSUNS4COIOLEA7","short_pith_number":"pith:J6TANJCU","schema_version":"1.0","canonical_sha256":"4fa606a454c6851aca8d9704e4396407c18f15461ed41a961ce12c15a5a56ee1","source":{"kind":"arxiv","id":"1103.2002","version":1},"attestation_state":"computed","paper":{"title":"A local limit theorem for triple connections in subcritical Bernoulli percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Massimo Campanino, Michele Gianfelice","submitted_at":"2011-03-10T11:55:42Z","abstract_excerpt":"We prove a local limit theorem for the probability of a site to be connected by disjoint paths to three points in subcritical Bernoulli percolation on $\\mathbb{Z}^{d},\\,d\\geq2$ in the limit where their distances tend to infinity."},"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":"1103.2002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-03-10T11:55:42Z","cross_cats_sorted":["cond-mat.stat-mech","math-ph","math.MP"],"title_canon_sha256":"71c7c1bb3cf07404fed2a6d639d101e826d4a3c4e5d30619ed7ba75e5edd3e57","abstract_canon_sha256":"d06dbef06a78c1bc894adc18dacf62b9a8b1059cf29bdb448b06e8b8770f12ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:03.191243Z","signature_b64":"gYLfqT4XNAIBU9cjoiKNNIsDAMlVpegNQ4atWzqnfFnZhwtQJRuZIVjQ5h33OvygiVYazRLOshMLfEYFyCAKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fa606a454c6851aca8d9704e4396407c18f15461ed41a961ce12c15a5a56ee1","last_reissued_at":"2026-05-18T04:27:03.190577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:03.190577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A local limit theorem for triple connections in subcritical Bernoulli percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math-ph","math.MP"],"primary_cat":"math.PR","authors_text":"Massimo Campanino, Michele Gianfelice","submitted_at":"2011-03-10T11:55:42Z","abstract_excerpt":"We prove a local limit theorem for the probability of a site to be connected by disjoint paths to three points in subcritical Bernoulli percolation on $\\mathbb{Z}^{d},\\,d\\geq2$ in the limit where their distances tend to infinity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2002","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":"1103.2002","created_at":"2026-05-18T04:27:03.190680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2002v1","created_at":"2026-05-18T04:27:03.190680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2002","created_at":"2026-05-18T04:27:03.190680+00:00"},{"alias_kind":"pith_short_12","alias_value":"J6TANJCUY2CR","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"J6TANJCUY2CRVSUN","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"J6TANJCU","created_at":"2026-05-18T12:26:32.869790+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/J6TANJCUY2CRVSUNS4COIOLEA7","json":"https://pith.science/pith/J6TANJCUY2CRVSUNS4COIOLEA7.json","graph_json":"https://pith.science/api/pith-number/J6TANJCUY2CRVSUNS4COIOLEA7/graph.json","events_json":"https://pith.science/api/pith-number/J6TANJCUY2CRVSUNS4COIOLEA7/events.json","paper":"https://pith.science/paper/J6TANJCU"},"agent_actions":{"view_html":"https://pith.science/pith/J6TANJCUY2CRVSUNS4COIOLEA7","download_json":"https://pith.science/pith/J6TANJCUY2CRVSUNS4COIOLEA7.json","view_paper":"https://pith.science/paper/J6TANJCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2002&json=true","fetch_graph":"https://pith.science/api/pith-number/J6TANJCUY2CRVSUNS4COIOLEA7/graph.json","fetch_events":"https://pith.science/api/pith-number/J6TANJCUY2CRVSUNS4COIOLEA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J6TANJCUY2CRVSUNS4COIOLEA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J6TANJCUY2CRVSUNS4COIOLEA7/action/storage_attestation","attest_author":"https://pith.science/pith/J6TANJCUY2CRVSUNS4COIOLEA7/action/author_attestation","sign_citation":"https://pith.science/pith/J6TANJCUY2CRVSUNS4COIOLEA7/action/citation_signature","submit_replication":"https://pith.science/pith/J6TANJCUY2CRVSUNS4COIOLEA7/action/replication_record"}},"created_at":"2026-05-18T04:27:03.190680+00:00","updated_at":"2026-05-18T04:27:03.190680+00:00"}