{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ORT2UIQ3V75F2JYES5EJSW236Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"624472724cb6c3f202c75f6e9f40b967b4c64a6dc02439c7671edb871bdc63e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T12:59:35Z","title_canon_sha256":"8147f4032781026e3a158ab651d1bfb8bd290231cd453cf9cdba8dc5f4b2428d"},"schema_version":"1.0","source":{"id":"1611.04370","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04370","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04370v3","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04370","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"ORT2UIQ3V75F","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ORT2UIQ3V75F2JYE","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ORT2UIQ3","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:fcadd26182fb98e0a85bf23ceac37c643183942aad5e4255d2c155a55781d73f","target":"graph","created_at":"2026-05-18T00:25:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Florian Lehner, Joshua Erde, Max Pitz, Nathan Bowler, Peter Heinig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T12:59:35Z","title":"Non-reconstructible locally finite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04370","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5c078a58f2f1fecebe2b7449746feee687b2d782c5b7de2e5dd82017a1bf62f9","target":"record","created_at":"2026-05-18T00:25:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"624472724cb6c3f202c75f6e9f40b967b4c64a6dc02439c7671edb871bdc63e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-14T12:59:35Z","title_canon_sha256":"8147f4032781026e3a158ab651d1bfb8bd290231cd453cf9cdba8dc5f4b2428d"},"schema_version":"1.0","source":{"id":"1611.04370","kind":"arxiv","version":3}},"canonical_sha256":"7467aa221baffa5d27049748995b5bf43ed097ced8dfd279a2e2e9bc81aa5cff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7467aa221baffa5d27049748995b5bf43ed097ced8dfd279a2e2e9bc81aa5cff","first_computed_at":"2026-05-18T00:25:27.103996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:27.103996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yR7UaUAWoatpBsPC0wOGA0xj8uBXbIeE/jN2RAYEYBCcBLMNnFaUOFHtdoW2jL026G06rWQZT/BZsgw8BYVIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:27.104717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04370","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c078a58f2f1fecebe2b7449746feee687b2d782c5b7de2e5dd82017a1bf62f9","sha256:fcadd26182fb98e0a85bf23ceac37c643183942aad5e4255d2c155a55781d73f"],"state_sha256":"bd9a931eadc9ee5127e3d632254e68dc3cc0b46794e882a07c056fd9aed28569"}