{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:2Q5ZCMO46SL4FK3AYA3D54VOUP","short_pith_number":"pith:2Q5ZCMO4","canonical_record":{"source":{"id":"2308.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-08T18:17:49Z","cross_cats_sorted":[],"title_canon_sha256":"43c2e730119a449954d22ae8e0f42ab7fc09b36a20e8d801376a161a7f525d3d","abstract_canon_sha256":"1778db85d8853f61210667ebab78f87e03bde741bd46c1c8d1978f30459c5131"},"schema_version":"1.0"},"canonical_sha256":"d43b9131dcf497c2ab60c0363ef2aea3df827813abdb99ba5ea961d513c70718","source":{"kind":"arxiv","id":"2308.04509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.04509","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"2308.04509v1","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.04509","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"2Q5ZCMO46SL4","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"pith_short_16","alias_value":"2Q5ZCMO46SL4FK3A","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"pith_short_8","alias_value":"2Q5ZCMO4","created_at":"2026-07-05T06:39:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:2Q5ZCMO46SL4FK3AYA3D54VOUP","target":"record","payload":{"canonical_record":{"source":{"id":"2308.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-08T18:17:49Z","cross_cats_sorted":[],"title_canon_sha256":"43c2e730119a449954d22ae8e0f42ab7fc09b36a20e8d801376a161a7f525d3d","abstract_canon_sha256":"1778db85d8853f61210667ebab78f87e03bde741bd46c1c8d1978f30459c5131"},"schema_version":"1.0"},"canonical_sha256":"d43b9131dcf497c2ab60c0363ef2aea3df827813abdb99ba5ea961d513c70718","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:39:38.857755Z","signature_b64":"qkT9tQQ4xWybfBkvYA//hnvvWMV5WPkDYu/ieCw8AAplQ2pV3dNOVqjULoiL6Ow4+YzQuA/K0Yx85DgdZ8BLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d43b9131dcf497c2ab60c0363ef2aea3df827813abdb99ba5ea961d513c70718","last_reissued_at":"2026-07-05T06:39:38.857240Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:39:38.857240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.04509","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-07-05T06:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hc7U8L2xg1PTfq35rYBWnB3zK396pG+NwSJ99uBnnMSZ4efHbkLIdteTS24UCq5iLfl+nD1Ga0KTDP3+I94TBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:51:16.658560Z"},"content_sha256":"1b5854a04edfb1d75dd62f9fbb86902a1689a4d923f7d3feb778b2a56755be3a","schema_version":"1.0","event_id":"sha256:1b5854a04edfb1d75dd62f9fbb86902a1689a4d923f7d3feb778b2a56755be3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:2Q5ZCMO46SL4FK3AYA3D54VOUP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Acyclic graphs with at least $2\\ell+1$ vertices are $\\ell$-recognizable","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":"2023-08-08T18:17:49Z","abstract_excerpt":"The $(n-\\ell)$-deck of an $n$-vertex graph is the multiset of subgraphs obtained from it by deleting $\\ell$ vertices. A family of $n$-vertex graphs is $\\ell$-recognizable if every graph having the same $(n-\\ell)$-deck as a graph in the family is also in the family. We prove that the family of $n$-vertex graphs with no cycles is $\\ell$-recognizable when $n\\ge2\\ell+1$ (except for $(n,\\ell)=(5,2)$). As a consequence, the family of $n$-vertex trees is $\\ell$-recognizable when $n\\ge2\\ell+1$ and $\\ell\\ne2$. It is known that this fails when $n=2\\ell$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.04509","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.04509/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-05T06:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HN20z1ny49r8/9fFbFVSGPBjp8NvrGuoJyPxzXeyooStN/tr1t4F8ouP9iMDEzGKWjVqNBkLec60YBAUyO8pBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T03:51:16.661107Z"},"content_sha256":"f5061e2073c7d60991c65b8443a49b35992bb83a0d728231def92f15f47a288c","schema_version":"1.0","event_id":"sha256:f5061e2073c7d60991c65b8443a49b35992bb83a0d728231def92f15f47a288c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/bundle.json","state_url":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/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-08-12T03:51:16Z","links":{"resolver":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP","bundle":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/bundle.json","state":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2Q5ZCMO46SL4FK3AYA3D54VOUP","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":"1778db85d8853f61210667ebab78f87e03bde741bd46c1c8d1978f30459c5131","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-08T18:17:49Z","title_canon_sha256":"43c2e730119a449954d22ae8e0f42ab7fc09b36a20e8d801376a161a7f525d3d"},"schema_version":"1.0","source":{"id":"2308.04509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.04509","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"2308.04509v1","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.04509","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"2Q5ZCMO46SL4","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"pith_short_16","alias_value":"2Q5ZCMO46SL4FK3A","created_at":"2026-07-05T06:39:38Z"},{"alias_kind":"pith_short_8","alias_value":"2Q5ZCMO4","created_at":"2026-07-05T06:39:38Z"}],"graph_snapshots":[{"event_id":"sha256:f5061e2073c7d60991c65b8443a49b35992bb83a0d728231def92f15f47a288c","target":"graph","created_at":"2026-07-05T06:39:38Z","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/2308.04509/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 subgraphs obtained from it by deleting $\\ell$ vertices. A family of $n$-vertex graphs is $\\ell$-recognizable if every graph having the same $(n-\\ell)$-deck as a graph in the family is also in the family. We prove that the family of $n$-vertex graphs with no cycles is $\\ell$-recognizable when $n\\ge2\\ell+1$ (except for $(n,\\ell)=(5,2)$). As a consequence, the family of $n$-vertex trees is $\\ell$-recognizable when $n\\ge2\\ell+1$ and $\\ell\\ne2$. It is known that this fails when $n=2\\ell$.","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":"2023-08-08T18:17:49Z","title":"Acyclic graphs with at least $2\\ell+1$ vertices are $\\ell$-recognizable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.04509","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:1b5854a04edfb1d75dd62f9fbb86902a1689a4d923f7d3feb778b2a56755be3a","target":"record","created_at":"2026-07-05T06:39:38Z","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":"1778db85d8853f61210667ebab78f87e03bde741bd46c1c8d1978f30459c5131","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-08-08T18:17:49Z","title_canon_sha256":"43c2e730119a449954d22ae8e0f42ab7fc09b36a20e8d801376a161a7f525d3d"},"schema_version":"1.0","source":{"id":"2308.04509","kind":"arxiv","version":1}},"canonical_sha256":"d43b9131dcf497c2ab60c0363ef2aea3df827813abdb99ba5ea961d513c70718","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d43b9131dcf497c2ab60c0363ef2aea3df827813abdb99ba5ea961d513c70718","first_computed_at":"2026-07-05T06:39:38.857240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:39:38.857240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qkT9tQQ4xWybfBkvYA//hnvvWMV5WPkDYu/ieCw8AAplQ2pV3dNOVqjULoiL6Ow4+YzQuA/K0Yx85DgdZ8BLAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:39:38.857755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.04509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b5854a04edfb1d75dd62f9fbb86902a1689a4d923f7d3feb778b2a56755be3a","sha256:f5061e2073c7d60991c65b8443a49b35992bb83a0d728231def92f15f47a288c"],"state_sha256":"21ac50d70d15c4caf791af933a95c97a2da3b148c959e327c4c6c32482728622"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5hVUzll5kVRZ7AZ563VKxEi2tlMznDGFFHBOtqu+5x2l6Tf5p+0/ioEYWOjwA5DvRJ3GgsySrDZox3CwK4/MAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T03:51:16.679484Z","bundle_sha256":"fd513545ec0fc8a8c93ab2ff78e2ed319445034da188ea2c466a79ae1df5c289"}}