{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WFVGY2OMZFDP3A7C7RQ26TLNAE","short_pith_number":"pith:WFVGY2OM","schema_version":"1.0","canonical_sha256":"b16a6c69ccc946fd83e2fc61af4d6d0102ff89006a1f330d0cbc1bba0720b1fd","source":{"kind":"arxiv","id":"2306.14888","version":2},"attestation_state":"computed","paper":{"title":"Percolation in lattice $k$-neighbor graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andr\\'as T\\'obi\\'as, Bas Lodewijks, Benedikt Jahnel, Jonas K\\\"oppl","submitted_at":"2023-06-26T17:55:17Z","abstract_excerpt":"We define a random graph obtained via connecting each point of $\\mathbb{Z}^d$ independently to a fixed number $1 \\leq k \\leq 2d$ of its nearest neighbors via a directed edge. We call this graph the directed $k$-neighbor graph. Two natural associated undirected graphs are the undirected and the bidirectional $k$-neighbor graph, where we connect two vertices by an undirected edge whenever there is a directed edge in the directed $k$-neighbor graph between them in at least one, respectively precisely two, directions. In these graphs we study the question of percolation, i.e., the existence of an "},"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":"2306.14888","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.PR","submitted_at":"2023-06-26T17:55:17Z","cross_cats_sorted":[],"title_canon_sha256":"c118685d5d200136d201f7f6fda6dd24e9483bf054be60a6f20e225637b2c229","abstract_canon_sha256":"7cb38a51b5094fa6684bd9336b6040ba113425820e8fa1fa2dff6d700001a005"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:28.109226Z","signature_b64":"NECPn6VRZYzC3O9/dOqjGSOhIupOR++SBLwukNYz29TD4bs5DaxFuMQVoveSbchjAtHKOmbXhK1SM49te4SPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b16a6c69ccc946fd83e2fc61af4d6d0102ff89006a1f330d0cbc1bba0720b1fd","last_reissued_at":"2026-07-05T08:07:28.108726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:28.108726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Percolation in lattice $k$-neighbor graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Andr\\'as T\\'obi\\'as, Bas Lodewijks, Benedikt Jahnel, Jonas K\\\"oppl","submitted_at":"2023-06-26T17:55:17Z","abstract_excerpt":"We define a random graph obtained via connecting each point of $\\mathbb{Z}^d$ independently to a fixed number $1 \\leq k \\leq 2d$ of its nearest neighbors via a directed edge. We call this graph the directed $k$-neighbor graph. Two natural associated undirected graphs are the undirected and the bidirectional $k$-neighbor graph, where we connect two vertices by an undirected edge whenever there is a directed edge in the directed $k$-neighbor graph between them in at least one, respectively precisely two, directions. In these graphs we study the question of percolation, i.e., the existence of an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.14888","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/2306.14888/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":"2306.14888","created_at":"2026-07-05T08:07:28.108797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.14888v2","created_at":"2026-07-05T08:07:28.108797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.14888","created_at":"2026-07-05T08:07:28.108797+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFVGY2OMZFDP","created_at":"2026-07-05T08:07:28.108797+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFVGY2OMZFDP3A7C","created_at":"2026-07-05T08:07:28.108797+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFVGY2OM","created_at":"2026-07-05T08:07:28.108797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.20781","citing_title":"The Planar Lattice Two-Neighbor Graph Percolates","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WFVGY2OMZFDP3A7C7RQ26TLNAE","json":"https://pith.science/pith/WFVGY2OMZFDP3A7C7RQ26TLNAE.json","graph_json":"https://pith.science/api/pith-number/WFVGY2OMZFDP3A7C7RQ26TLNAE/graph.json","events_json":"https://pith.science/api/pith-number/WFVGY2OMZFDP3A7C7RQ26TLNAE/events.json","paper":"https://pith.science/paper/WFVGY2OM"},"agent_actions":{"view_html":"https://pith.science/pith/WFVGY2OMZFDP3A7C7RQ26TLNAE","download_json":"https://pith.science/pith/WFVGY2OMZFDP3A7C7RQ26TLNAE.json","view_paper":"https://pith.science/paper/WFVGY2OM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.14888&json=true","fetch_graph":"https://pith.science/api/pith-number/WFVGY2OMZFDP3A7C7RQ26TLNAE/graph.json","fetch_events":"https://pith.science/api/pith-number/WFVGY2OMZFDP3A7C7RQ26TLNAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFVGY2OMZFDP3A7C7RQ26TLNAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFVGY2OMZFDP3A7C7RQ26TLNAE/action/storage_attestation","attest_author":"https://pith.science/pith/WFVGY2OMZFDP3A7C7RQ26TLNAE/action/author_attestation","sign_citation":"https://pith.science/pith/WFVGY2OMZFDP3A7C7RQ26TLNAE/action/citation_signature","submit_replication":"https://pith.science/pith/WFVGY2OMZFDP3A7C7RQ26TLNAE/action/replication_record"}},"created_at":"2026-07-05T08:07:28.108797+00:00","updated_at":"2026-07-05T08:07:28.108797+00:00"}