{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2Q5ZCMO46SL4FK3AYA3D54VOUP","short_pith_number":"pith:2Q5ZCMO4","schema_version":"1.0","canonical_sha256":"d43b9131dcf497c2ab60c0363ef2aea3df827813abdb99ba5ea961d513c70718","source":{"kind":"arxiv","id":"2308.04509","version":1},"attestation_state":"computed","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$."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2308.04509","created_at":"2026-07-05T06:39:38.857302+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.04509v1","created_at":"2026-07-05T06:39:38.857302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.04509","created_at":"2026-07-05T06:39:38.857302+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Q5ZCMO46SL4","created_at":"2026-07-05T06:39:38.857302+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Q5ZCMO46SL4FK3A","created_at":"2026-07-05T06:39:38.857302+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Q5ZCMO4","created_at":"2026-07-05T06:39:38.857302+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP","json":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP.json","graph_json":"https://pith.science/api/pith-number/2Q5ZCMO46SL4FK3AYA3D54VOUP/graph.json","events_json":"https://pith.science/api/pith-number/2Q5ZCMO46SL4FK3AYA3D54VOUP/events.json","paper":"https://pith.science/paper/2Q5ZCMO4"},"agent_actions":{"view_html":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP","download_json":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP.json","view_paper":"https://pith.science/paper/2Q5ZCMO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.04509&json=true","fetch_graph":"https://pith.science/api/pith-number/2Q5ZCMO46SL4FK3AYA3D54VOUP/graph.json","fetch_events":"https://pith.science/api/pith-number/2Q5ZCMO46SL4FK3AYA3D54VOUP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/action/storage_attestation","attest_author":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/action/author_attestation","sign_citation":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/action/citation_signature","submit_replication":"https://pith.science/pith/2Q5ZCMO46SL4FK3AYA3D54VOUP/action/replication_record"}},"created_at":"2026-07-05T06:39:38.857302+00:00","updated_at":"2026-07-05T06:39:38.857302+00:00"}