{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QDUJ3XABCHHXBLWCUINL2R3L5O","short_pith_number":"pith:QDUJ3XAB","schema_version":"1.0","canonical_sha256":"80e89ddc0111cf70aec2a21abd476beba38ad035b0f6b066db31e6ae2f7814cd","source":{"kind":"arxiv","id":"2412.05709","version":2},"attestation_state":"computed","paper":{"title":"Incipient infinite clusters and volume growth for Gaussian free fields and loop soups on metric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jian Ding, Zhenhao Cai","submitted_at":"2024-12-07T17:48:37Z","abstract_excerpt":"In this paper, we establish the existence and equivalence of four types of incipient infinite clusters (IICs) for the critical Gaussian free field (GFF) level-set and the critical loop soup on the metric graph $\\widetilde{\\mathbb{Z}}^d$ for all $d\\ge 3$ except the critical dimension $d=6$. These IICs are defined as four limiting conditional probabilities, involving different conditionings and various ways of taking limits:\n  (1) conditioned on $\\{0 \\leftrightarrow{} \\partial B(N)\\}$ at criticality (where $0$ is the origin of $\\mathbb{Z}^d$, and $\\partial B(N)$ is the boundary of the box $B(N)$"},"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":"2412.05709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-12-07T17:48:37Z","cross_cats_sorted":[],"title_canon_sha256":"ebdb87858dbb483b67cf278985166715c1a4124bbb549c44c2720d1e683ac6e9","abstract_canon_sha256":"3ce53480226ebe344266c48e1dbc870175471c85d483615ea08ecd17461667e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:47.086598Z","signature_b64":"fnec6ZuAvx2JIDjU/qEh+aPXFJTW8EUOi8H3HeoF+W4f8Cv26EMgBuot4S+MzcJT0EwgYkvw5g6Isrn5oNK+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80e89ddc0111cf70aec2a21abd476beba38ad035b0f6b066db31e6ae2f7814cd","last_reissued_at":"2026-07-05T10:05:47.085945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:47.085945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incipient infinite clusters and volume growth for Gaussian free fields and loop soups on metric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Jian Ding, Zhenhao Cai","submitted_at":"2024-12-07T17:48:37Z","abstract_excerpt":"In this paper, we establish the existence and equivalence of four types of incipient infinite clusters (IICs) for the critical Gaussian free field (GFF) level-set and the critical loop soup on the metric graph $\\widetilde{\\mathbb{Z}}^d$ for all $d\\ge 3$ except the critical dimension $d=6$. These IICs are defined as four limiting conditional probabilities, involving different conditionings and various ways of taking limits:\n  (1) conditioned on $\\{0 \\leftrightarrow{} \\partial B(N)\\}$ at criticality (where $0$ is the origin of $\\mathbb{Z}^d$, and $\\partial B(N)$ is the boundary of the box $B(N)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.05709","kind":"arxiv","version":2},"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/2412.05709/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":"2412.05709","created_at":"2026-07-05T10:05:47.086035+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.05709v2","created_at":"2026-07-05T10:05:47.086035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.05709","created_at":"2026-07-05T10:05:47.086035+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDUJ3XABCHHX","created_at":"2026-07-05T10:05:47.086035+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDUJ3XABCHHXBLWC","created_at":"2026-07-05T10:05:47.086035+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDUJ3XAB","created_at":"2026-07-05T10:05:47.086035+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.06754","citing_title":"A switching identity for cable-graph loop soups and Gaussian free fields","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QDUJ3XABCHHXBLWCUINL2R3L5O","json":"https://pith.science/pith/QDUJ3XABCHHXBLWCUINL2R3L5O.json","graph_json":"https://pith.science/api/pith-number/QDUJ3XABCHHXBLWCUINL2R3L5O/graph.json","events_json":"https://pith.science/api/pith-number/QDUJ3XABCHHXBLWCUINL2R3L5O/events.json","paper":"https://pith.science/paper/QDUJ3XAB"},"agent_actions":{"view_html":"https://pith.science/pith/QDUJ3XABCHHXBLWCUINL2R3L5O","download_json":"https://pith.science/pith/QDUJ3XABCHHXBLWCUINL2R3L5O.json","view_paper":"https://pith.science/paper/QDUJ3XAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.05709&json=true","fetch_graph":"https://pith.science/api/pith-number/QDUJ3XABCHHXBLWCUINL2R3L5O/graph.json","fetch_events":"https://pith.science/api/pith-number/QDUJ3XABCHHXBLWCUINL2R3L5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDUJ3XABCHHXBLWCUINL2R3L5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDUJ3XABCHHXBLWCUINL2R3L5O/action/storage_attestation","attest_author":"https://pith.science/pith/QDUJ3XABCHHXBLWCUINL2R3L5O/action/author_attestation","sign_citation":"https://pith.science/pith/QDUJ3XABCHHXBLWCUINL2R3L5O/action/citation_signature","submit_replication":"https://pith.science/pith/QDUJ3XABCHHXBLWCUINL2R3L5O/action/replication_record"}},"created_at":"2026-07-05T10:05:47.086035+00:00","updated_at":"2026-07-05T10:05:47.086035+00:00"}