{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ORT2UIQ3V75F2JYES5EJSW236Q","short_pith_number":"pith:ORT2UIQ3","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"},"canonical_sha256":"7467aa221baffa5d27049748995b5bf43ed097ced8dfd279a2e2e9bc81aa5cff","source":{"kind":"arxiv","id":"1611.04370","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ORT2UIQ3V75F2JYES5EJSW236Q","target":"record","payload":{"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"},"canonical_sha256":"7467aa221baffa5d27049748995b5bf43ed097ced8dfd279a2e2e9bc81aa5cff","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"},"source_kind":"arxiv","source_id":"1611.04370","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HNj0W28T6CE6EtatZsl3W3kr9VvDSYnFDI7ATSEoD/HTcz06ozGDZR56gh6aq3inB7efjK8fr3HRYEsZGFT3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:01:16.138202Z"},"content_sha256":"5c078a58f2f1fecebe2b7449746feee687b2d782c5b7de2e5dd82017a1bf62f9","schema_version":"1.0","event_id":"sha256:5c078a58f2f1fecebe2b7449746feee687b2d782c5b7de2e5dd82017a1bf62f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ORT2UIQ3V75F2JYES5EJSW236Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvYuFJEtDFb1/1C4+CqgxNy2S0WoyQPkCBddsbirbWbct/Xdz40pHrpiFgOvb2zY9bkWPFpcnWMoFVB5/rFGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:01:16.138886Z"},"content_sha256":"fcadd26182fb98e0a85bf23ceac37c643183942aad5e4255d2c155a55781d73f","schema_version":"1.0","event_id":"sha256:fcadd26182fb98e0a85bf23ceac37c643183942aad5e4255d2c155a55781d73f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q/bundle.json","state_url":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORT2UIQ3V75F2JYES5EJSW236Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T23:01:16Z","links":{"resolver":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q","bundle":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q/bundle.json","state":"https://pith.science/pith/ORT2UIQ3V75F2JYES5EJSW236Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORT2UIQ3V75F2JYES5EJSW236Q/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EwMV5fbxIkjkW8qav3QmmEQsSAskZzHshd4JEkkkaJr36DwtVTdX+DhzD3f3jD30JBcAFP1F6MnLRXjwpnXECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:01:16.142245Z","bundle_sha256":"af684e99116a032210a4188f4300ffece6942f45641bef84bc1445bbec535956"}}