{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:44LPBFTXJWSZWGWN7XLURIC5LE","short_pith_number":"pith:44LPBFTX","canonical_record":{"source":{"id":"2210.00338","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-01T18:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"9e84743822f692a287eb6398357064e40503eea35a4c420b5c267f973883c957","abstract_canon_sha256":"2e91cdb949534d4c137b65b2612009ed68b1dc2ae638ed94cec86b7f57abe0ed"},"schema_version":"1.0"},"canonical_sha256":"e716f096774da59b1acdfdd748a05d592e1a7843094b8e2277f5b61316151212","source":{"kind":"arxiv","id":"2210.00338","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.00338","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"2210.00338v2","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00338","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"44LPBFTXJWSZ","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"pith_short_16","alias_value":"44LPBFTXJWSZWGWN","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"pith_short_8","alias_value":"44LPBFTX","created_at":"2026-07-05T05:03:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:44LPBFTXJWSZWGWN7XLURIC5LE","target":"record","payload":{"canonical_record":{"source":{"id":"2210.00338","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-01T18:29:27Z","cross_cats_sorted":[],"title_canon_sha256":"9e84743822f692a287eb6398357064e40503eea35a4c420b5c267f973883c957","abstract_canon_sha256":"2e91cdb949534d4c137b65b2612009ed68b1dc2ae638ed94cec86b7f57abe0ed"},"schema_version":"1.0"},"canonical_sha256":"e716f096774da59b1acdfdd748a05d592e1a7843094b8e2277f5b61316151212","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:03:07.339208Z","signature_b64":"WLSE5ArsFCcDSjvDjOsrSxW3ChNwjvmT8XLMYmwCUBVS4irA0WOr/0SoBVA6DmCZ3Zy/ysGxpKqnJAFciplsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e716f096774da59b1acdfdd748a05d592e1a7843094b8e2277f5b61316151212","last_reissued_at":"2026-07-05T05:03:07.338764Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:03:07.338764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.00338","source_version":2,"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-07-05T05:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Ru/1rMSbpz6fgAB4NQx3dtidjYBgDCrPEp7eNujyrcaVy43fF0Y6bPuYfGxIHSkT94otSuxF2I33Re75BHjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:31:02.766444Z"},"content_sha256":"9b1178d74b097c91851796204b7227f7687c64634741833e7b1c6e9f7f9b608e","schema_version":"1.0","event_id":"sha256:9b1178d74b097c91851796204b7227f7687c64634741833e7b1c6e9f7f9b608e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:44LPBFTXJWSZWGWN7XLURIC5LE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstruction and Edge Reconstruction of Triangle-free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhinav Shantanam, Alexander Clifton, Reem Mahmoud, Xiaonan Liu","submitted_at":"2022-10-01T18:29:27Z","abstract_excerpt":"The Reconstruction Conjecture due to Kelly and Ulam states that every graph with at least 3 vertices is uniquely determined by its multiset of subgraphs $\\{G-v: v\\in V(G)\\}$. Let $diam(G)$ and $\\kappa(G)$ denote the diameter and the connectivity of a graph $G$, respectively, and let $\\mathcal{G}_2:=\\{G: \\textrm{diam}(G)=2\\}$ and $\\mathcal{G}_3:=\\{G:\\textrm{diam}(G)=\\textrm{diam}(\\overline{G})=3\\}$. It is known that the Reconstruction Conjecture is true if and only if it is true for every 2-connected graph in $\\mathcal{G}_2\\cup \\mathcal{G}_3$. Balakumar and Monikandan showed that the Reconstruc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00338","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.00338/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:03:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bK33MQFzSzsUyVgk4JGu1QtCW1FzJpDhUaHa7VDJj9nuh+GM9S2q1HZ+XE42tqZEWg4KD6hBnMIY52qHGKysCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-12T08:31:02.766817Z"},"content_sha256":"de534e70d312f306a7573fdfa091e5d421c877646446eb2557853026a2a2d0dc","schema_version":"1.0","event_id":"sha256:de534e70d312f306a7573fdfa091e5d421c877646446eb2557853026a2a2d0dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44LPBFTXJWSZWGWN7XLURIC5LE/bundle.json","state_url":"https://pith.science/pith/44LPBFTXJWSZWGWN7XLURIC5LE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44LPBFTXJWSZWGWN7XLURIC5LE/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-07-12T08:31:02Z","links":{"resolver":"https://pith.science/pith/44LPBFTXJWSZWGWN7XLURIC5LE","bundle":"https://pith.science/pith/44LPBFTXJWSZWGWN7XLURIC5LE/bundle.json","state":"https://pith.science/pith/44LPBFTXJWSZWGWN7XLURIC5LE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44LPBFTXJWSZWGWN7XLURIC5LE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:44LPBFTXJWSZWGWN7XLURIC5LE","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":"2e91cdb949534d4c137b65b2612009ed68b1dc2ae638ed94cec86b7f57abe0ed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-01T18:29:27Z","title_canon_sha256":"9e84743822f692a287eb6398357064e40503eea35a4c420b5c267f973883c957"},"schema_version":"1.0","source":{"id":"2210.00338","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.00338","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"arxiv_version","alias_value":"2210.00338v2","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00338","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"pith_short_12","alias_value":"44LPBFTXJWSZ","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"pith_short_16","alias_value":"44LPBFTXJWSZWGWN","created_at":"2026-07-05T05:03:07Z"},{"alias_kind":"pith_short_8","alias_value":"44LPBFTX","created_at":"2026-07-05T05:03:07Z"}],"graph_snapshots":[{"event_id":"sha256:de534e70d312f306a7573fdfa091e5d421c877646446eb2557853026a2a2d0dc","target":"graph","created_at":"2026-07-05T05:03:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.00338/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Reconstruction Conjecture due to Kelly and Ulam states that every graph with at least 3 vertices is uniquely determined by its multiset of subgraphs $\\{G-v: v\\in V(G)\\}$. Let $diam(G)$ and $\\kappa(G)$ denote the diameter and the connectivity of a graph $G$, respectively, and let $\\mathcal{G}_2:=\\{G: \\textrm{diam}(G)=2\\}$ and $\\mathcal{G}_3:=\\{G:\\textrm{diam}(G)=\\textrm{diam}(\\overline{G})=3\\}$. It is known that the Reconstruction Conjecture is true if and only if it is true for every 2-connected graph in $\\mathcal{G}_2\\cup \\mathcal{G}_3$. Balakumar and Monikandan showed that the Reconstruc","authors_text":"Abhinav Shantanam, Alexander Clifton, Reem Mahmoud, Xiaonan Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-01T18:29:27Z","title":"Reconstruction and Edge Reconstruction of Triangle-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00338","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:9b1178d74b097c91851796204b7227f7687c64634741833e7b1c6e9f7f9b608e","target":"record","created_at":"2026-07-05T05:03:07Z","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":"2e91cdb949534d4c137b65b2612009ed68b1dc2ae638ed94cec86b7f57abe0ed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-10-01T18:29:27Z","title_canon_sha256":"9e84743822f692a287eb6398357064e40503eea35a4c420b5c267f973883c957"},"schema_version":"1.0","source":{"id":"2210.00338","kind":"arxiv","version":2}},"canonical_sha256":"e716f096774da59b1acdfdd748a05d592e1a7843094b8e2277f5b61316151212","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e716f096774da59b1acdfdd748a05d592e1a7843094b8e2277f5b61316151212","first_computed_at":"2026-07-05T05:03:07.338764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:03:07.338764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WLSE5ArsFCcDSjvDjOsrSxW3ChNwjvmT8XLMYmwCUBVS4irA0WOr/0SoBVA6DmCZ3Zy/ysGxpKqnJAFciplsAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:03:07.339208Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.00338","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b1178d74b097c91851796204b7227f7687c64634741833e7b1c6e9f7f9b608e","sha256:de534e70d312f306a7573fdfa091e5d421c877646446eb2557853026a2a2d0dc"],"state_sha256":"8c4e6cedcca0c2bb70569f8b4103df4ce9f470aa704201b361cded75831088e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tVYZay97LdnRErfRtx+jPpdlO27hLKDdmrFSJiJARE2l58u7hxqPF83ULLou7lZWphRBVZCw+9Xo8k1jTWqNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-12T08:31:02.769170Z","bundle_sha256":"8995a03c7b8fe76abbe7eae729429fa348a565b5e93b8a429b08af81e54d7c10"}}