{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OKAVVDM5PYW3EKFLBUFDJ56GOW","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":"5fd9583c9f51c2411124033241cee55ea791820afdf0c13fff19e1e111408b5e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-19T15:18:49Z","title_canon_sha256":"71a5ed920a5b6ea0819f6433225f7ffd410b0ec4f9cce97a664b5fe510cae9ac"},"schema_version":"1.0","source":{"id":"2307.10035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.10035","created_at":"2026-07-05T06:32:49Z"},{"alias_kind":"arxiv_version","alias_value":"2307.10035v1","created_at":"2026-07-05T06:32:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.10035","created_at":"2026-07-05T06:32:49Z"},{"alias_kind":"pith_short_12","alias_value":"OKAVVDM5PYW3","created_at":"2026-07-05T06:32:49Z"},{"alias_kind":"pith_short_16","alias_value":"OKAVVDM5PYW3EKFL","created_at":"2026-07-05T06:32:49Z"},{"alias_kind":"pith_short_8","alias_value":"OKAVVDM5","created_at":"2026-07-05T06:32:49Z"}],"graph_snapshots":[{"event_id":"sha256:d6f95e647b0c17564bca29b851b8a2dc99843f9aed80065fd35dc79078a81cdc","target":"graph","created_at":"2026-07-05T06:32:49Z","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/2307.10035/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $(n-\\ell)$-deck of an $n$-vertex graph is the multiset of (unlabeled) subgraphs obtained from it by deleting $\\ell$ vertices. An $n$-vertex graph is $\\ell$-reconstructible if it is determined by its $(n-\\ell)$-deck, meaning that no other graph has the same deck. We prove that every tree with at least $6\\ell+11$ vertices is $\\ell$-reconstructible.","authors_text":"Alexandr V. Kostochka, Dara Zirlin, Douglas B. West, Mina Nahvi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-19T15:18:49Z","title":"Trees with at least $6\\ell+11$ vertices are $\\ell$-reconstructible"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.10035","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:b5cbd9a48e75657e6512bd31617d1f4b45d8c9b1903ad2bf1446bea510a3a94e","target":"record","created_at":"2026-07-05T06:32:49Z","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":"5fd9583c9f51c2411124033241cee55ea791820afdf0c13fff19e1e111408b5e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-19T15:18:49Z","title_canon_sha256":"71a5ed920a5b6ea0819f6433225f7ffd410b0ec4f9cce97a664b5fe510cae9ac"},"schema_version":"1.0","source":{"id":"2307.10035","kind":"arxiv","version":1}},"canonical_sha256":"72815a8d9d7e2db228ab0d0a34f7c675a8f5f5511aec6f9a265cf08ff778466e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72815a8d9d7e2db228ab0d0a34f7c675a8f5f5511aec6f9a265cf08ff778466e","first_computed_at":"2026-07-05T06:32:49.688794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:32:49.688794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6cZJFtTEbFjMq1OBdyyWkdZ46YoRp8YUJKezAxu5eFogtXr2cAB5pZHx+xE9Oa3l330evc9Jm9SKKGhTzBOTBg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:32:49.689281Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.10035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5cbd9a48e75657e6512bd31617d1f4b45d8c9b1903ad2bf1446bea510a3a94e","sha256:d6f95e647b0c17564bca29b851b8a2dc99843f9aed80065fd35dc79078a81cdc"],"state_sha256":"b047dc51636f58152b5e31c4bfe76a9a84b7fd4b912b2159f1454d48aa4f9d37"}