{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FUKCPENCWPUZFVXMICPPPFERIX","short_pith_number":"pith:FUKCPENC","canonical_record":{"source":{"id":"1904.11901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-26T15:39:54Z","cross_cats_sorted":[],"title_canon_sha256":"4e6bfcff0a1184de7d2b1dbed8d2864bd4c2cb9b4e171bff4cb1a564ad629d61","abstract_canon_sha256":"f604cadb75f74aec6c0aab0afcea1cfd76db5fa1bcff0d24970cac77113cb690"},"schema_version":"1.0"},"canonical_sha256":"2d142791a2b3e992d6ec409ef7949145c5fd4b1b683a003c86576a8d745db0dd","source":{"kind":"arxiv","id":"1904.11901","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11901","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11901v1","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11901","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"FUKCPENCWPUZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FUKCPENCWPUZFVXM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FUKCPENC","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FUKCPENCWPUZFVXMICPPPFERIX","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11901","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-26T15:39:54Z","cross_cats_sorted":[],"title_canon_sha256":"4e6bfcff0a1184de7d2b1dbed8d2864bd4c2cb9b4e171bff4cb1a564ad629d61","abstract_canon_sha256":"f604cadb75f74aec6c0aab0afcea1cfd76db5fa1bcff0d24970cac77113cb690"},"schema_version":"1.0"},"canonical_sha256":"2d142791a2b3e992d6ec409ef7949145c5fd4b1b683a003c86576a8d745db0dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:40.671496Z","signature_b64":"yYIMrrUnQ9f2jjxWi/xTou6Tw+/xLeBV2sly6DgQnUbShK/Rt6hoxGL/9njvpBYdRvZrqO0aIZIh7UTqp7VrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d142791a2b3e992d6ec409ef7949145c5fd4b1b683a003c86576a8d745db0dd","last_reissued_at":"2026-05-17T23:47:40.671013Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:40.671013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11901","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-17T23:47:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fIa7wwQflRCVb6Lj3HkOtlaIM9rZZDFuBqQCxaTRtiFv1OYPE5ZNQoRFvgc7eL7Ar4Btvc5wnBE0qcnFH6vCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:38:27.062666Z"},"content_sha256":"d9d383a9132eedaa372df42c2905f9ecad6efd8bbd4144b369106409d71a3122","schema_version":"1.0","event_id":"sha256:d9d383a9132eedaa372df42c2905f9ecad6efd8bbd4144b369106409d71a3122"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FUKCPENCWPUZFVXMICPPPFERIX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree lists and connectedness are $3$-reconstructible for graphs with at least seven vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr V. Kostochka, Dara Zirlin, Douglas B. West, Mina Nahvi","submitted_at":"2019-04-26T15:39:54Z","abstract_excerpt":"The $k$-deck of a graph is the multiset of its subgraphs induced by $k$ vertices. A graph or graph property is $l$-reconstructible if it is determined by the deck of subgraphs obtained by deleting $l$ vertices. We show that the degree list of an $n$-vertex graph is $3$-reconstructible when $n\\ge7$, and the threshold on $n$ is sharp. Using this result, we show that when $n\\ge7$ the $(n-3)$-deck also determines whether an $n$-vertex graph is connected; this is also sharp. These results extend the results of Chernyak and Manvel, respectively, that the degree list and connectedness are $2$-reconst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11901","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-17T23:47:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GE3ueyy6XnRRJzJU/ajrNJUD1Fl0XVjeMxTPz7A3E8ysAuAhnGJ+PNfnUoFSqAZIW1aANX33Bl+hbL99JlMECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:38:27.063393Z"},"content_sha256":"248f4d7344a441ac70483b52814203c06d8d2b969f89cc493f8591ef661dc908","schema_version":"1.0","event_id":"sha256:248f4d7344a441ac70483b52814203c06d8d2b969f89cc493f8591ef661dc908"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUKCPENCWPUZFVXMICPPPFERIX/bundle.json","state_url":"https://pith.science/pith/FUKCPENCWPUZFVXMICPPPFERIX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUKCPENCWPUZFVXMICPPPFERIX/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-25T12:38:27Z","links":{"resolver":"https://pith.science/pith/FUKCPENCWPUZFVXMICPPPFERIX","bundle":"https://pith.science/pith/FUKCPENCWPUZFVXMICPPPFERIX/bundle.json","state":"https://pith.science/pith/FUKCPENCWPUZFVXMICPPPFERIX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUKCPENCWPUZFVXMICPPPFERIX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FUKCPENCWPUZFVXMICPPPFERIX","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":"f604cadb75f74aec6c0aab0afcea1cfd76db5fa1bcff0d24970cac77113cb690","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-26T15:39:54Z","title_canon_sha256":"4e6bfcff0a1184de7d2b1dbed8d2864bd4c2cb9b4e171bff4cb1a564ad629d61"},"schema_version":"1.0","source":{"id":"1904.11901","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11901","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11901v1","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11901","created_at":"2026-05-17T23:47:40Z"},{"alias_kind":"pith_short_12","alias_value":"FUKCPENCWPUZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FUKCPENCWPUZFVXM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FUKCPENC","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:248f4d7344a441ac70483b52814203c06d8d2b969f89cc493f8591ef661dc908","target":"graph","created_at":"2026-05-17T23:47:40Z","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 $k$-deck of a graph is the multiset of its subgraphs induced by $k$ vertices. A graph or graph property is $l$-reconstructible if it is determined by the deck of subgraphs obtained by deleting $l$ vertices. We show that the degree list of an $n$-vertex graph is $3$-reconstructible when $n\\ge7$, and the threshold on $n$ is sharp. Using this result, we show that when $n\\ge7$ the $(n-3)$-deck also determines whether an $n$-vertex graph is connected; this is also sharp. These results extend the results of Chernyak and Manvel, respectively, that the degree list and connectedness are $2$-reconst","authors_text":"Alexandr V. Kostochka, Dara Zirlin, Douglas B. West, Mina Nahvi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-26T15:39:54Z","title":"Degree lists and connectedness are $3$-reconstructible for graphs with at least seven vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11901","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:d9d383a9132eedaa372df42c2905f9ecad6efd8bbd4144b369106409d71a3122","target":"record","created_at":"2026-05-17T23:47:40Z","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":"f604cadb75f74aec6c0aab0afcea1cfd76db5fa1bcff0d24970cac77113cb690","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-26T15:39:54Z","title_canon_sha256":"4e6bfcff0a1184de7d2b1dbed8d2864bd4c2cb9b4e171bff4cb1a564ad629d61"},"schema_version":"1.0","source":{"id":"1904.11901","kind":"arxiv","version":1}},"canonical_sha256":"2d142791a2b3e992d6ec409ef7949145c5fd4b1b683a003c86576a8d745db0dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d142791a2b3e992d6ec409ef7949145c5fd4b1b683a003c86576a8d745db0dd","first_computed_at":"2026-05-17T23:47:40.671013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:40.671013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yYIMrrUnQ9f2jjxWi/xTou6Tw+/xLeBV2sly6DgQnUbShK/Rt6hoxGL/9njvpBYdRvZrqO0aIZIh7UTqp7VrDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:40.671496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11901","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9d383a9132eedaa372df42c2905f9ecad6efd8bbd4144b369106409d71a3122","sha256:248f4d7344a441ac70483b52814203c06d8d2b969f89cc493f8591ef661dc908"],"state_sha256":"e3a151e5ba90efaa4f6ca67f200c9ff03514868ef4b3491c8cd229f4387d65cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54ONsUDfiSWPRbmJysmDhDic8EmFfYTuDoWqDl4RcEvsl8CoWHIVpYhjjLKAgokSVwtJaYO599+bN+ij8LPgAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:38:27.067040Z","bundle_sha256":"f9be6564818133cc00f18872f6a7c2a5e62073d97d0ed589ab509982f620f35c"}}