{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PBWY6AARU5KHPMBI34BCDFNI7Q","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":"d462421cee9f94818f4435212492c7029bc9517f831af036bb1809a5320f5d5a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-14T22:40:50Z","title_canon_sha256":"650f7569bdc51c3392906df1e46c1821a4f8d483e9177677ef6f2046aadb3d2a"},"schema_version":"1.0","source":{"id":"2310.09678","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.09678","created_at":"2026-07-05T07:01:09Z"},{"alias_kind":"arxiv_version","alias_value":"2310.09678v1","created_at":"2026-07-05T07:01:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.09678","created_at":"2026-07-05T07:01:09Z"},{"alias_kind":"pith_short_12","alias_value":"PBWY6AARU5KH","created_at":"2026-07-05T07:01:09Z"},{"alias_kind":"pith_short_16","alias_value":"PBWY6AARU5KHPMBI","created_at":"2026-07-05T07:01:09Z"},{"alias_kind":"pith_short_8","alias_value":"PBWY6AAR","created_at":"2026-07-05T07:01:09Z"}],"graph_snapshots":[{"event_id":"sha256:b200cdcf6e18e29c69ccdfdc280e5163b202d5093fa2182ff7265b412b819eda","target":"graph","created_at":"2026-07-05T07:01:09Z","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/2310.09678/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"According to the classic Chv{\\'{a}}tal's Lemma from 1977, a graph of minimum degree $\\delta(G)$ contains every tree on $\\delta(G)+1$ vertices.\n  Our main result is the following algorithmic \"extension\" of Chv\\'{a}tal's Lemma: For any $n$-vertex graph $G$, integer $k$, and a tree $T$ on at most $\\delta(G)+k$ vertices, deciding whether $G$ contains a subgraph isomorphic to $T$, can be done in time $f(k)\\cdot n^{\\mathcal{O}(1)}$ for some function $f$ of $k$ only.\n  The proof of our main result is based on an interplay between extremal graph theory and parameterized algorithms.","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-14T22:40:50Z","title":"Tree Containment Above Minimum Degree is FPT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.09678","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:4d97a110f3e335d403fa1236043853bf9d7ec6cd17928aac8a9bcc32a29c48a4","target":"record","created_at":"2026-07-05T07:01:09Z","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":"d462421cee9f94818f4435212492c7029bc9517f831af036bb1809a5320f5d5a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-14T22:40:50Z","title_canon_sha256":"650f7569bdc51c3392906df1e46c1821a4f8d483e9177677ef6f2046aadb3d2a"},"schema_version":"1.0","source":{"id":"2310.09678","kind":"arxiv","version":1}},"canonical_sha256":"786d8f0011a75477b028df022195a8fc28d5e1524d0bdd39803c245156dc46ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"786d8f0011a75477b028df022195a8fc28d5e1524d0bdd39803c245156dc46ae","first_computed_at":"2026-07-05T07:01:09.580976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:01:09.580976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8ojea4yPSE91FooWB1KG+Z6WlJYvVQl19ar+NLPEQViMKxGujcFpVoBHA7tk7SOEbcWCsEbQY7ZQzUh+cynLCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:01:09.581462Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.09678","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d97a110f3e335d403fa1236043853bf9d7ec6cd17928aac8a9bcc32a29c48a4","sha256:b200cdcf6e18e29c69ccdfdc280e5163b202d5093fa2182ff7265b412b819eda"],"state_sha256":"07f57bbb03dad747175ab3ec526eab57dd0dd9c8e87ac142000e5760972bb291"}