{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2VJPD2U2DZYZ5XERRZU2GOGFPW","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":"5ffdb689cee82f910b3ae0cb1f737a043a493f03b9070916c02c3fd9aaca37ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T12:08:15Z","title_canon_sha256":"bf89607f5f98eb034de902f33148bf916f20b976f216fcca069fc8a1c301b768"},"schema_version":"1.0","source":{"id":"1606.02926","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02926","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02926v2","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02926","created_at":"2026-05-18T00:25:39Z"},{"alias_kind":"pith_short_12","alias_value":"2VJPD2U2DZYZ","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2VJPD2U2DZYZ5XER","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2VJPD2U2","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:9eaf52b2155430fdba8a6cd9ae5c9016c4b9076494eadd647d13cfd225d78193","target":"graph","created_at":"2026-05-18T00:25:39Z","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 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 reconstructible if $H \\cong G$ for all $H$ hypomorphic to $G$.\n  It is well known that not all infinite graphs are reconstructible. However, the Harary-Schwenk-Scott Conjecture from 1972 suggests that all locally finite trees are reconstructible.\n  In this paper, we construct a counterexample to the Harary-Schwenk-Scott Conjecture. Our example also answers four other questions of Nash-Williams, Halin and Andreae o","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-06-09T12:08:15Z","title":"A counterexample to the reconstruction conjecture for locally finite trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02926","kind":"arxiv","version":2},"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:175879a744757960a56e1de9b1bcca98cf64f55cc1637c19ea22513ac2f59585","target":"record","created_at":"2026-05-18T00:25:39Z","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":"5ffdb689cee82f910b3ae0cb1f737a043a493f03b9070916c02c3fd9aaca37ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-09T12:08:15Z","title_canon_sha256":"bf89607f5f98eb034de902f33148bf916f20b976f216fcca069fc8a1c301b768"},"schema_version":"1.0","source":{"id":"1606.02926","kind":"arxiv","version":2}},"canonical_sha256":"d552f1ea9a1e719edc918e69a338c57db13f1d54d72564bde2c2d64f8917b6d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d552f1ea9a1e719edc918e69a338c57db13f1d54d72564bde2c2d64f8917b6d8","first_computed_at":"2026-05-18T00:25:39.814896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:39.814896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V7Xx+jrLvfjdhFZ9qZlWpn0jF69zORle4Im2PrtO4L0dHEVssmWZmzDHIUQiiNILU7uyDKiyufB0W/wdM75dAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:39.815478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02926","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:175879a744757960a56e1de9b1bcca98cf64f55cc1637c19ea22513ac2f59585","sha256:9eaf52b2155430fdba8a6cd9ae5c9016c4b9076494eadd647d13cfd225d78193"],"state_sha256":"15125e1c9f73caca31dfb3630a814ea75c614af723d6b48697f77eaf059ded9d"}