{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PBWY6AARU5KHPMBI34BCDFNI7Q","short_pith_number":"pith:PBWY6AAR","schema_version":"1.0","canonical_sha256":"786d8f0011a75477b028df022195a8fc28d5e1524d0bdd39803c245156dc46ae","source":{"kind":"arxiv","id":"2310.09678","version":1},"attestation_state":"computed","paper":{"title":"Tree Containment Above Minimum Degree is FPT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2023-10-14T22:40:50Z","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."},"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":"2310.09678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-10-14T22:40:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"650f7569bdc51c3392906df1e46c1821a4f8d483e9177677ef6f2046aadb3d2a","abstract_canon_sha256":"d462421cee9f94818f4435212492c7029bc9517f831af036bb1809a5320f5d5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:01:09.581462Z","signature_b64":"8ojea4yPSE91FooWB1KG+Z6WlJYvVQl19ar+NLPEQViMKxGujcFpVoBHA7tk7SOEbcWCsEbQY7ZQzUh+cynLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"786d8f0011a75477b028df022195a8fc28d5e1524d0bdd39803c245156dc46ae","last_reissued_at":"2026-07-05T07:01:09.580976Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:01:09.580976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree Containment Above Minimum Degree is FPT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Fedor V. Fomin, Kirill Simonov, Petr A. Golovach","submitted_at":"2023-10-14T22:40:50Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.09678","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/2310.09678/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":"2310.09678","created_at":"2026-07-05T07:01:09.581032+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.09678v1","created_at":"2026-07-05T07:01:09.581032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.09678","created_at":"2026-07-05T07:01:09.581032+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBWY6AARU5KH","created_at":"2026-07-05T07:01:09.581032+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBWY6AARU5KHPMBI","created_at":"2026-07-05T07:01:09.581032+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBWY6AAR","created_at":"2026-07-05T07:01:09.581032+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/PBWY6AARU5KHPMBI34BCDFNI7Q","json":"https://pith.science/pith/PBWY6AARU5KHPMBI34BCDFNI7Q.json","graph_json":"https://pith.science/api/pith-number/PBWY6AARU5KHPMBI34BCDFNI7Q/graph.json","events_json":"https://pith.science/api/pith-number/PBWY6AARU5KHPMBI34BCDFNI7Q/events.json","paper":"https://pith.science/paper/PBWY6AAR"},"agent_actions":{"view_html":"https://pith.science/pith/PBWY6AARU5KHPMBI34BCDFNI7Q","download_json":"https://pith.science/pith/PBWY6AARU5KHPMBI34BCDFNI7Q.json","view_paper":"https://pith.science/paper/PBWY6AAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.09678&json=true","fetch_graph":"https://pith.science/api/pith-number/PBWY6AARU5KHPMBI34BCDFNI7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/PBWY6AARU5KHPMBI34BCDFNI7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBWY6AARU5KHPMBI34BCDFNI7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBWY6AARU5KHPMBI34BCDFNI7Q/action/storage_attestation","attest_author":"https://pith.science/pith/PBWY6AARU5KHPMBI34BCDFNI7Q/action/author_attestation","sign_citation":"https://pith.science/pith/PBWY6AARU5KHPMBI34BCDFNI7Q/action/citation_signature","submit_replication":"https://pith.science/pith/PBWY6AARU5KHPMBI34BCDFNI7Q/action/replication_record"}},"created_at":"2026-07-05T07:01:09.581032+00:00","updated_at":"2026-07-05T07:01:09.581032+00:00"}