{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ORT2UIQ3V75F2JYES5EJSW236Q","short_pith_number":"pith:ORT2UIQ3","schema_version":"1.0","canonical_sha256":"7467aa221baffa5d27049748995b5bf43ed097ced8dfd279a2e2e9bc81aa5cff","source":{"kind":"arxiv","id":"1611.04370","version":3},"attestation_state":"computed","paper":{"title":"Non-reconstructible locally finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Lehner, Joshua Erde, Max Pitz, Nathan Bowler, Peter Heinig","submitted_at":"2016-11-14T12:59:35Z","abstract_excerpt":"Two graphs $G$ and $H$ are \\emph{hypomorphic} if there exists a bijection $\\varphi \\colon V(G) \\rightarrow V(H)$ such that $G - v \\cong H - \\varphi(v)$ for each $v \\in V(G)$. A graph $G$ is \\emph{reconstructible} if $H \\cong G$ for all $H$ hypomorphic to $G$.\n  Nash-Williams proved that all locally finite graphs with a finite number $\\geq 2$ of ends are reconstructible, and asked whether locally finite graphs with one end or countably many ends are also reconstructible.\n  In this paper we construct non-reconstructible graphs of bounded maximum degree with one and countably many ends respective"},"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":"1611.04370","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T12:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"8147f4032781026e3a158ab651d1bfb8bd290231cd453cf9cdba8dc5f4b2428d","abstract_canon_sha256":"624472724cb6c3f202c75f6e9f40b967b4c64a6dc02439c7671edb871bdc63e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:27.104717Z","signature_b64":"yR7UaUAWoatpBsPC0wOGA0xj8uBXbIeE/jN2RAYEYBCcBLMNnFaUOFHtdoW2jL026G06rWQZT/BZsgw8BYVIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7467aa221baffa5d27049748995b5bf43ed097ced8dfd279a2e2e9bc81aa5cff","last_reissued_at":"2026-05-18T00:25:27.103996Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:27.103996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-reconstructible locally finite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Lehner, Joshua Erde, Max Pitz, Nathan Bowler, Peter Heinig","submitted_at":"2016-11-14T12:59:35Z","abstract_excerpt":"Two graphs $G$ and $H$ are \\emph{hypomorphic} if there exists a bijection $\\varphi \\colon V(G) \\rightarrow V(H)$ such that $G - v \\cong H - \\varphi(v)$ for each $v \\in V(G)$. A graph $G$ is \\emph{reconstructible} if $H \\cong G$ for all $H$ hypomorphic to $G$.\n  Nash-Williams proved that all locally finite graphs with a finite number $\\geq 2$ of ends are reconstructible, and asked whether locally finite graphs with one end or countably many ends are also reconstructible.\n  In this paper we construct non-reconstructible graphs of bounded maximum degree with one and countably many ends respective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04370","kind":"arxiv","version":3},"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":"1611.04370","created_at":"2026-05-18T00:25:27.104110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.04370v3","created_at":"2026-05-18T00:25:27.104110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04370","created_at":"2026-05-18T00:25:27.104110+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORT2UIQ3V75F","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORT2UIQ3V75F2JYE","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORT2UIQ3","created_at":"2026-05-18T12:30:36.002864+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/ORT2UIQ3V75F2JYES5EJSW236Q","json":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q.json","graph_json":"https://pith.science/api/pith-number/ORT2UIQ3V75F2JYES5EJSW236Q/graph.json","events_json":"https://pith.science/api/pith-number/ORT2UIQ3V75F2JYES5EJSW236Q/events.json","paper":"https://pith.science/paper/ORT2UIQ3"},"agent_actions":{"view_html":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q","download_json":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q.json","view_paper":"https://pith.science/paper/ORT2UIQ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.04370&json=true","fetch_graph":"https://pith.science/api/pith-number/ORT2UIQ3V75F2JYES5EJSW236Q/graph.json","fetch_events":"https://pith.science/api/pith-number/ORT2UIQ3V75F2JYES5EJSW236Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q/action/storage_attestation","attest_author":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q/action/author_attestation","sign_citation":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q/action/citation_signature","submit_replication":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q/action/replication_record"}},"created_at":"2026-05-18T00:25:27.104110+00:00","updated_at":"2026-05-18T00:25:27.104110+00:00"}