{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I5KPS3P4SEBYZL7LSPAWOPHMQC","short_pith_number":"pith:I5KPS3P4","schema_version":"1.0","canonical_sha256":"4754f96dfc91038cafeb93c1673cec80849ef03f860e4faaf19f4e1ca111a52d","source":{"kind":"arxiv","id":"1309.1279","version":1},"attestation_state":"computed","paper":{"title":"The $k$-in-a-tree problem for graphs of girth at least~$k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Nicolas Trotignon, Wei Liu","submitted_at":"2013-09-05T08:52:16Z","abstract_excerpt":"For all integers $k\\geq 3$, we give an $O(n^4)$ time algorithm for the problem whose instance is a graph $G$ of girth at least $k$ together with $k$ vertices and whose question is \"Does $G$ contains an induced subgraph containing the $k$ vertices and isomorphic to a tree?\". This directly follows for $k=3$ from the three-in-a-tree algorithm of Chudnovsky and Seymour and for $k=4$ from a result of Derhy, Picouleau and Trotignon. Here we solve the problem for $k\\geq 5$. Our algorithm relies on a structural description of graphs of girth at least $k$ that do not contain an induced tree covering $k"},"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":"1309.1279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-05T08:52:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6cfb600fee040b0073b1dab8117d23db3a32553eaf1a2f0f8d3778decadd8736","abstract_canon_sha256":"f56c52637b88047320f51202f1a8ce0f01905ebd71c742dbdc46e4e80895f655"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:07.721461Z","signature_b64":"A6Hscis9/+Z5S13R+278IlTXvqModpFwVmGAJOB2tZWAggKZHOMFyNMNTEkfhBaBAx2m+psylzvfWFW5/cgSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4754f96dfc91038cafeb93c1673cec80849ef03f860e4faaf19f4e1ca111a52d","last_reissued_at":"2026-05-18T03:14:07.721051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:07.721051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $k$-in-a-tree problem for graphs of girth at least~$k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Nicolas Trotignon, Wei Liu","submitted_at":"2013-09-05T08:52:16Z","abstract_excerpt":"For all integers $k\\geq 3$, we give an $O(n^4)$ time algorithm for the problem whose instance is a graph $G$ of girth at least $k$ together with $k$ vertices and whose question is \"Does $G$ contains an induced subgraph containing the $k$ vertices and isomorphic to a tree?\". This directly follows for $k=3$ from the three-in-a-tree algorithm of Chudnovsky and Seymour and for $k=4$ from a result of Derhy, Picouleau and Trotignon. Here we solve the problem for $k\\geq 5$. Our algorithm relies on a structural description of graphs of girth at least $k$ that do not contain an induced tree covering $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1279","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":""},"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":"1309.1279","created_at":"2026-05-18T03:14:07.721111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1279v1","created_at":"2026-05-18T03:14:07.721111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1279","created_at":"2026-05-18T03:14:07.721111+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5KPS3P4SEBY","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5KPS3P4SEBYZL7L","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5KPS3P4","created_at":"2026-05-18T12:27:46.883200+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/I5KPS3P4SEBYZL7LSPAWOPHMQC","json":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC.json","graph_json":"https://pith.science/api/pith-number/I5KPS3P4SEBYZL7LSPAWOPHMQC/graph.json","events_json":"https://pith.science/api/pith-number/I5KPS3P4SEBYZL7LSPAWOPHMQC/events.json","paper":"https://pith.science/paper/I5KPS3P4"},"agent_actions":{"view_html":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC","download_json":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC.json","view_paper":"https://pith.science/paper/I5KPS3P4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1279&json=true","fetch_graph":"https://pith.science/api/pith-number/I5KPS3P4SEBYZL7LSPAWOPHMQC/graph.json","fetch_events":"https://pith.science/api/pith-number/I5KPS3P4SEBYZL7LSPAWOPHMQC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/action/storage_attestation","attest_author":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/action/author_attestation","sign_citation":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/action/citation_signature","submit_replication":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/action/replication_record"}},"created_at":"2026-05-18T03:14:07.721111+00:00","updated_at":"2026-05-18T03:14:07.721111+00:00"}