{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AOHAQLAIX6E6X2DHSUYK5FNPCG","short_pith_number":"pith:AOHAQLAI","schema_version":"1.0","canonical_sha256":"038e082c08bf89ebe8679530ae95af11b6c9b0a019764df2480ab344ff943167","source":{"kind":"arxiv","id":"2412.20781","version":1},"attestation_state":"computed","paper":{"title":"The Planar Lattice Two-Neighbor Graph Percolates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Benedikt Jahnel (WIAS), Beno\\^it Henry (IMT Nord Europe), David Coupier (IMT Nord Europe), Jonas K\\\"oppl (WIAS)","submitted_at":"2024-12-30T07:59:18Z","abstract_excerpt":"The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the 2-neighbor graph percolates on Z 2 , i.e., that the origin is connected to infinity with positive probability. The proof rests on duality, an exploration algorithm, a comparison to i.i.d. bond percolation under constraints as well as enhancement arguments. As a byproduct, we show that i.i.d. bond percolation with forbidden local patterns has a strictly larger perco"},"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.20781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-12-30T07:59:18Z","cross_cats_sorted":[],"title_canon_sha256":"a5ef3a44a0ccdcf7af2215b9b696aa47ceb6c6789553730bfa3f1773e8114899","abstract_canon_sha256":"425fc5d5b17ff5c7c722ed7474f163b40cb9dd147bf1bd70317774bdc58c3f4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:55:22.156843Z","signature_b64":"Ny/r+L7RuO6FRfNdKIeoKuuSXf/o5JXUmJSj2g1B2bnrWQRgrPulbEJj28CsyHOJsc15acRTKf6cRPg4Uv9yCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"038e082c08bf89ebe8679530ae95af11b6c9b0a019764df2480ab344ff943167","last_reissued_at":"2026-07-05T09:55:22.156355Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:55:22.156355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Planar Lattice Two-Neighbor Graph Percolates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Benedikt Jahnel (WIAS), Beno\\^it Henry (IMT Nord Europe), David Coupier (IMT Nord Europe), Jonas K\\\"oppl (WIAS)","submitted_at":"2024-12-30T07:59:18Z","abstract_excerpt":"The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the 2-neighbor graph percolates on Z 2 , i.e., that the origin is connected to infinity with positive probability. The proof rests on duality, an exploration algorithm, a comparison to i.i.d. bond percolation under constraints as well as enhancement arguments. As a byproduct, we show that i.i.d. bond percolation with forbidden local patterns has a strictly larger perco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20781","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/2412.20781/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.20781","created_at":"2026-07-05T09:55:22.156420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.20781v1","created_at":"2026-07-05T09:55:22.156420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20781","created_at":"2026-07-05T09:55:22.156420+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOHAQLAIX6E6","created_at":"2026-07-05T09:55:22.156420+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOHAQLAIX6E6X2DH","created_at":"2026-07-05T09:55:22.156420+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOHAQLAI","created_at":"2026-07-05T09:55:22.156420+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/AOHAQLAIX6E6X2DHSUYK5FNPCG","json":"https://pith.science/pith/AOHAQLAIX6E6X2DHSUYK5FNPCG.json","graph_json":"https://pith.science/api/pith-number/AOHAQLAIX6E6X2DHSUYK5FNPCG/graph.json","events_json":"https://pith.science/api/pith-number/AOHAQLAIX6E6X2DHSUYK5FNPCG/events.json","paper":"https://pith.science/paper/AOHAQLAI"},"agent_actions":{"view_html":"https://pith.science/pith/AOHAQLAIX6E6X2DHSUYK5FNPCG","download_json":"https://pith.science/pith/AOHAQLAIX6E6X2DHSUYK5FNPCG.json","view_paper":"https://pith.science/paper/AOHAQLAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.20781&json=true","fetch_graph":"https://pith.science/api/pith-number/AOHAQLAIX6E6X2DHSUYK5FNPCG/graph.json","fetch_events":"https://pith.science/api/pith-number/AOHAQLAIX6E6X2DHSUYK5FNPCG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOHAQLAIX6E6X2DHSUYK5FNPCG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOHAQLAIX6E6X2DHSUYK5FNPCG/action/storage_attestation","attest_author":"https://pith.science/pith/AOHAQLAIX6E6X2DHSUYK5FNPCG/action/author_attestation","sign_citation":"https://pith.science/pith/AOHAQLAIX6E6X2DHSUYK5FNPCG/action/citation_signature","submit_replication":"https://pith.science/pith/AOHAQLAIX6E6X2DHSUYK5FNPCG/action/replication_record"}},"created_at":"2026-07-05T09:55:22.156420+00:00","updated_at":"2026-07-05T09:55:22.156420+00:00"}