{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WKPMMTJGIDYPPUEUWVRIENZEQK","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":"2274b7e064581b6fe793687d8a11da5edd8c74d1adb170dbeb4aeedc3869d115","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-03-22T20:05:02Z","title_canon_sha256":"43c2e730119a449954d22ae8e0f42ab7fc09b36a20e8d801376a161a7f525d3d"},"schema_version":"1.0","source":{"id":"2103.12153","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.12153","created_at":"2026-07-05T02:25:43Z"},{"alias_kind":"arxiv_version","alias_value":"2103.12153v1","created_at":"2026-07-05T02:25:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.12153","created_at":"2026-07-05T02:25:43Z"},{"alias_kind":"pith_short_12","alias_value":"WKPMMTJGIDYP","created_at":"2026-07-05T02:25:43Z"},{"alias_kind":"pith_short_16","alias_value":"WKPMMTJGIDYPPUEU","created_at":"2026-07-05T02:25:43Z"},{"alias_kind":"pith_short_8","alias_value":"WKPMMTJG","created_at":"2026-07-05T02:25:43Z"}],"graph_snapshots":[{"event_id":"sha256:ebcf87b5877393bfd59ee9bc4824936b144a10104949ced9ef41c5e894d54ca0","target":"graph","created_at":"2026-07-05T02:25:43Z","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/2103.12153/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 having no cycles is $\\ell$-recognizable when $n\\ge2\\ell+1$ (except for $(n,\\ell)=(5,2)$). 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://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-03-22T20:05:02Z","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":"2103.12153","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:b3eea674123bc9c6eabe5994a43e7082c890591dcd6190137fda28a4f8c2eb39","target":"record","created_at":"2026-07-05T02:25:43Z","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":"2274b7e064581b6fe793687d8a11da5edd8c74d1adb170dbeb4aeedc3869d115","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-03-22T20:05:02Z","title_canon_sha256":"43c2e730119a449954d22ae8e0f42ab7fc09b36a20e8d801376a161a7f525d3d"},"schema_version":"1.0","source":{"id":"2103.12153","kind":"arxiv","version":1}},"canonical_sha256":"b29ec64d2640f0f7d094b56282372482bcee969e7d5b080b98419104824c0b13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b29ec64d2640f0f7d094b56282372482bcee969e7d5b080b98419104824c0b13","first_computed_at":"2026-07-05T02:25:43.064792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:25:43.064792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nA2c22vvywncr+NQ1glUMgQOxJI8KnoRGUKFENTdeR8kBsJ8oMnYwKwGHBdT/eYKl/jzAdk8GTFGxMznVv+YAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:25:43.065189Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.12153","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3eea674123bc9c6eabe5994a43e7082c890591dcd6190137fda28a4f8c2eb39","sha256:ebcf87b5877393bfd59ee9bc4824936b144a10104949ced9ef41c5e894d54ca0"],"state_sha256":"a5e3dd6b5231b3be664a81dc219acce6c604acd70267b94c7747fdfb389a04c9"}