{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZI4GVGLP3DAPAQFYU3AZBI7NXC","short_pith_number":"pith:ZI4GVGLP","schema_version":"1.0","canonical_sha256":"ca386a996fd8c0f040b8a6c190a3edb8be494262a78a51a422750574df87d740","source":{"kind":"arxiv","id":"1702.05380","version":2},"attestation_state":"computed","paper":{"title":"Nonbacktracking expansion of finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"G\\'abor Tim\\'ar, Jos\\'e F. F. Mendes, Rui A. da Costa, Sergey N. Dorogovtsev","submitted_at":"2017-02-02T22:40:56Z","abstract_excerpt":"Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirected graph we construct an infinite tree having the same local structural properties as this finite graph, when observed by a nonbacktracking walker. Formally excluding the boundary, this infinite tree is a generalization of the Bethe lattice. We indicate an infinite, locally treelike, random network whose local structure is exactly given by this infinite tree. Message passing equations for various cooperative models on"},"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":"1702.05380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2017-02-02T22:40:56Z","cross_cats_sorted":[],"title_canon_sha256":"5ed767bf4dea7328719a130d8a58449ed45dbac7df2a67b983c0d20ce74e672f","abstract_canon_sha256":"8cca8526401dd12efce82ca80d107c17ea6a9c54959809e580ded88750ec0d82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:11.669539Z","signature_b64":"YALdjJ7dJdm/7sleE4X+wMyZYCacjV0JbQwIoTZBi5vTTlvdNESUcYovJ8I/WB+/tLsHYS8O/T4vFYCEyZVmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca386a996fd8c0f040b8a6c190a3edb8be494262a78a51a422750574df87d740","last_reissued_at":"2026-05-18T00:45:11.668956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:11.668956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonbacktracking expansion of finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.dis-nn","authors_text":"G\\'abor Tim\\'ar, Jos\\'e F. F. Mendes, Rui A. da Costa, Sergey N. Dorogovtsev","submitted_at":"2017-02-02T22:40:56Z","abstract_excerpt":"Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirected graph we construct an infinite tree having the same local structural properties as this finite graph, when observed by a nonbacktracking walker. Formally excluding the boundary, this infinite tree is a generalization of the Bethe lattice. We indicate an infinite, locally treelike, random network whose local structure is exactly given by this infinite tree. Message passing equations for various cooperative models on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05380","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":""},"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":"1702.05380","created_at":"2026-05-18T00:45:11.669068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05380v2","created_at":"2026-05-18T00:45:11.669068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05380","created_at":"2026-05-18T00:45:11.669068+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZI4GVGLP3DAP","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZI4GVGLP3DAPAQFY","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZI4GVGLP","created_at":"2026-05-18T12:31:59.375834+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/ZI4GVGLP3DAPAQFYU3AZBI7NXC","json":"https://pith.science/pith/ZI4GVGLP3DAPAQFYU3AZBI7NXC.json","graph_json":"https://pith.science/api/pith-number/ZI4GVGLP3DAPAQFYU3AZBI7NXC/graph.json","events_json":"https://pith.science/api/pith-number/ZI4GVGLP3DAPAQFYU3AZBI7NXC/events.json","paper":"https://pith.science/paper/ZI4GVGLP"},"agent_actions":{"view_html":"https://pith.science/pith/ZI4GVGLP3DAPAQFYU3AZBI7NXC","download_json":"https://pith.science/pith/ZI4GVGLP3DAPAQFYU3AZBI7NXC.json","view_paper":"https://pith.science/paper/ZI4GVGLP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05380&json=true","fetch_graph":"https://pith.science/api/pith-number/ZI4GVGLP3DAPAQFYU3AZBI7NXC/graph.json","fetch_events":"https://pith.science/api/pith-number/ZI4GVGLP3DAPAQFYU3AZBI7NXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZI4GVGLP3DAPAQFYU3AZBI7NXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZI4GVGLP3DAPAQFYU3AZBI7NXC/action/storage_attestation","attest_author":"https://pith.science/pith/ZI4GVGLP3DAPAQFYU3AZBI7NXC/action/author_attestation","sign_citation":"https://pith.science/pith/ZI4GVGLP3DAPAQFYU3AZBI7NXC/action/citation_signature","submit_replication":"https://pith.science/pith/ZI4GVGLP3DAPAQFYU3AZBI7NXC/action/replication_record"}},"created_at":"2026-05-18T00:45:11.669068+00:00","updated_at":"2026-05-18T00:45:11.669068+00:00"}