{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:67EOHIUCERUO2LXRG6R5CFH7OK","short_pith_number":"pith:67EOHIUC","canonical_record":{"source":{"id":"1312.1234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-04T16:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"76204b4fe20f9dc3435d3a48894e31d86ab5dda024ba2eaf970a774f3c24629d","abstract_canon_sha256":"6d3b371054df3806c1a4ff82afd22ce9dd7b9ecb27b6d2c731bfeeb5955c7750"},"schema_version":"1.0"},"canonical_sha256":"f7c8e3a2822468ed2ef137a3d114ff728811b7c556cc9b3207d37aca4f8dda8f","source":{"kind":"arxiv","id":"1312.1234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1234","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1234v1","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1234","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"67EOHIUCERUO","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"67EOHIUCERUO2LXR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"67EOHIUC","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:67EOHIUCERUO2LXRG6R5CFH7OK","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-04T16:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"76204b4fe20f9dc3435d3a48894e31d86ab5dda024ba2eaf970a774f3c24629d","abstract_canon_sha256":"6d3b371054df3806c1a4ff82afd22ce9dd7b9ecb27b6d2c731bfeeb5955c7750"},"schema_version":"1.0"},"canonical_sha256":"f7c8e3a2822468ed2ef137a3d114ff728811b7c556cc9b3207d37aca4f8dda8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:34.584450Z","signature_b64":"T6xHDWRII+fMvqhxfHYfpwZokIhqXgFkvPZlMrW5O2EVmlouwgtvJLK9GEPEXtLITdouL8ZT0o6xI4AG9ygXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7c8e3a2822468ed2ef137a3d114ff728811b7c556cc9b3207d37aca4f8dda8f","last_reissued_at":"2026-05-18T03:05:34.583921Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:34.583921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1234","source_version":1,"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-18T03:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DsTY6YXDt0FxlTNn1A30HkewGRihWq9fR7qGMVi/Jd7JMu/z7aYQvD7Gbc2uvazhOl0Hnbmqzoj9TLkW5W1cAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:09:05.904126Z"},"content_sha256":"78f72a5fdc1c3a565578e60ed87f67198b1dd7b985ec86c261bfb5985364ad56","schema_version":"1.0","event_id":"sha256:78f72a5fdc1c3a565578e60ed87f67198b1dd7b985ec86c261bfb5985364ad56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:67EOHIUCERUO2LXRG6R5CFH7OK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the edge-reconstruction number of a tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Josef Lauri, Kevin Asciak, Virgilio Pannone, Wendy Myrvold","submitted_at":"2013-12-04T16:22:38Z","abstract_excerpt":"The edge-reconstruction number ern$(G)$ of a graph $G$ is equal to the minimum number of edge-deleted subgraphs $G-e$ of $G$ which are sufficient to determine $G$ up to isomorphsim. Building upon the work of Molina and using results from computer searches by Rivshin and more recent ones which we carried out, we show that, apart from three known exceptions, all bicentroidal trees have edge-reconstruction number equal to 2. We also exhibit the known trees having edge-reconstruction number equal to 3 and we conjecture that the three infinite families of unicentroidal trees which we have found to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1234","kind":"arxiv","version":1},"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-18T03:05:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NemDT1gIaWJ42VKJV7tyCtZPHaTHOhf0q/Kb/j8SIH6rUaxs0Wuhs5vAGj7efFxeTijA5TLfyqjbccdcxd+sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:09:05.904488Z"},"content_sha256":"e10aa93d2d668bbc2c2b89be801d79bc3795b1c5b339761db1eb626d22517bf4","schema_version":"1.0","event_id":"sha256:e10aa93d2d668bbc2c2b89be801d79bc3795b1c5b339761db1eb626d22517bf4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67EOHIUCERUO2LXRG6R5CFH7OK/bundle.json","state_url":"https://pith.science/pith/67EOHIUCERUO2LXRG6R5CFH7OK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67EOHIUCERUO2LXRG6R5CFH7OK/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-06-25T07:09:05Z","links":{"resolver":"https://pith.science/pith/67EOHIUCERUO2LXRG6R5CFH7OK","bundle":"https://pith.science/pith/67EOHIUCERUO2LXRG6R5CFH7OK/bundle.json","state":"https://pith.science/pith/67EOHIUCERUO2LXRG6R5CFH7OK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67EOHIUCERUO2LXRG6R5CFH7OK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:67EOHIUCERUO2LXRG6R5CFH7OK","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":"6d3b371054df3806c1a4ff82afd22ce9dd7b9ecb27b6d2c731bfeeb5955c7750","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-04T16:22:38Z","title_canon_sha256":"76204b4fe20f9dc3435d3a48894e31d86ab5dda024ba2eaf970a774f3c24629d"},"schema_version":"1.0","source":{"id":"1312.1234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1234","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1234v1","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1234","created_at":"2026-05-18T03:05:34Z"},{"alias_kind":"pith_short_12","alias_value":"67EOHIUCERUO","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"67EOHIUCERUO2LXR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"67EOHIUC","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:e10aa93d2d668bbc2c2b89be801d79bc3795b1c5b339761db1eb626d22517bf4","target":"graph","created_at":"2026-05-18T03:05:34Z","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":"The edge-reconstruction number ern$(G)$ of a graph $G$ is equal to the minimum number of edge-deleted subgraphs $G-e$ of $G$ which are sufficient to determine $G$ up to isomorphsim. Building upon the work of Molina and using results from computer searches by Rivshin and more recent ones which we carried out, we show that, apart from three known exceptions, all bicentroidal trees have edge-reconstruction number equal to 2. We also exhibit the known trees having edge-reconstruction number equal to 3 and we conjecture that the three infinite families of unicentroidal trees which we have found to ","authors_text":"Josef Lauri, Kevin Asciak, Virgilio Pannone, Wendy Myrvold","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-04T16:22:38Z","title":"On the edge-reconstruction number of a tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1234","kind":"arxiv","version":1},"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:78f72a5fdc1c3a565578e60ed87f67198b1dd7b985ec86c261bfb5985364ad56","target":"record","created_at":"2026-05-18T03:05:34Z","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":"6d3b371054df3806c1a4ff82afd22ce9dd7b9ecb27b6d2c731bfeeb5955c7750","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-04T16:22:38Z","title_canon_sha256":"76204b4fe20f9dc3435d3a48894e31d86ab5dda024ba2eaf970a774f3c24629d"},"schema_version":"1.0","source":{"id":"1312.1234","kind":"arxiv","version":1}},"canonical_sha256":"f7c8e3a2822468ed2ef137a3d114ff728811b7c556cc9b3207d37aca4f8dda8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7c8e3a2822468ed2ef137a3d114ff728811b7c556cc9b3207d37aca4f8dda8f","first_computed_at":"2026-05-18T03:05:34.583921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:34.583921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T6xHDWRII+fMvqhxfHYfpwZokIhqXgFkvPZlMrW5O2EVmlouwgtvJLK9GEPEXtLITdouL8ZT0o6xI4AG9ygXCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:34.584450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78f72a5fdc1c3a565578e60ed87f67198b1dd7b985ec86c261bfb5985364ad56","sha256:e10aa93d2d668bbc2c2b89be801d79bc3795b1c5b339761db1eb626d22517bf4"],"state_sha256":"828f13881073fd80cb208d0c673f983b97654eeb43ba703776028dc4e165474d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZeoKV2/X5JRslG2rWnQBpg9HXly2BxH2/I197AChXtKcCyo0b0pnb9Uz1AB54SFnScp/Nu+5+rFjtJhtXs5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:09:05.906424Z","bundle_sha256":"867c162e14a33a2911b3edeb47f9b2ad7f4a3228b01e1948ef6a94372d3e957a"}}