{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I5KPS3P4SEBYZL7LSPAWOPHMQC","short_pith_number":"pith:I5KPS3P4","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"},"canonical_sha256":"4754f96dfc91038cafeb93c1673cec80849ef03f860e4faaf19f4e1ca111a52d","source":{"kind":"arxiv","id":"1309.1279","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1279","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1279v1","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1279","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"I5KPS3P4SEBY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I5KPS3P4SEBYZL7L","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I5KPS3P4","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I5KPS3P4SEBYZL7LSPAWOPHMQC","target":"record","payload":{"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"},"canonical_sha256":"4754f96dfc91038cafeb93c1673cec80849ef03f860e4faaf19f4e1ca111a52d","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"},"source_kind":"arxiv","source_id":"1309.1279","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ge0thle2sdG7GjdjDhkn+yXN7t1rbrJ0OkyY78XNnTRXxlrmXbzvtMtbKMldNWqFJOLFThv+BuOm9JcF02z3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:11:46.304888Z"},"content_sha256":"3451499011515c693b82dc3286cbf68cb17d249f83f94aaf96703770a37be5a0","schema_version":"1.0","event_id":"sha256:3451499011515c693b82dc3286cbf68cb17d249f83f94aaf96703770a37be5a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I5KPS3P4SEBYZL7LSPAWOPHMQC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:14:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xyKQzMRVRrUvLr9BzGF/8S24LjAy1OAg3SjPfp3x7cJNBHGDeRcHRA9xJdM9QWdQxj1faj/lMmfz/U8R5h1mAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:11:46.305250Z"},"content_sha256":"2894440f3bac872a6a438b9562c0d6129e06abe477142aa078dba452bf762776","schema_version":"1.0","event_id":"sha256:2894440f3bac872a6a438b9562c0d6129e06abe477142aa078dba452bf762776"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/bundle.json","state_url":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T23:11:46Z","links":{"resolver":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC","bundle":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/bundle.json","state":"https://pith.science/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5KPS3P4SEBYZL7LSPAWOPHMQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I5KPS3P4SEBYZL7LSPAWOPHMQC","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":"f56c52637b88047320f51202f1a8ce0f01905ebd71c742dbdc46e4e80895f655","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-05T08:52:16Z","title_canon_sha256":"6cfb600fee040b0073b1dab8117d23db3a32553eaf1a2f0f8d3778decadd8736"},"schema_version":"1.0","source":{"id":"1309.1279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1279","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1279v1","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1279","created_at":"2026-05-18T03:14:07Z"},{"alias_kind":"pith_short_12","alias_value":"I5KPS3P4SEBY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I5KPS3P4SEBYZL7L","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I5KPS3P4","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:2894440f3bac872a6a438b9562c0d6129e06abe477142aa078dba452bf762776","target":"graph","created_at":"2026-05-18T03:14:07Z","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"},"paper":{"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","authors_text":"Nicolas Trotignon, Wei Liu","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-05T08:52:16Z","title":"The $k$-in-a-tree problem for graphs of girth at least~$k$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1279","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:3451499011515c693b82dc3286cbf68cb17d249f83f94aaf96703770a37be5a0","target":"record","created_at":"2026-05-18T03:14:07Z","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":"f56c52637b88047320f51202f1a8ce0f01905ebd71c742dbdc46e4e80895f655","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-05T08:52:16Z","title_canon_sha256":"6cfb600fee040b0073b1dab8117d23db3a32553eaf1a2f0f8d3778decadd8736"},"schema_version":"1.0","source":{"id":"1309.1279","kind":"arxiv","version":1}},"canonical_sha256":"4754f96dfc91038cafeb93c1673cec80849ef03f860e4faaf19f4e1ca111a52d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4754f96dfc91038cafeb93c1673cec80849ef03f860e4faaf19f4e1ca111a52d","first_computed_at":"2026-05-18T03:14:07.721051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:07.721051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A6Hscis9/+Z5S13R+278IlTXvqModpFwVmGAJOB2tZWAggKZHOMFyNMNTEkfhBaBAx2m+psylzvfWFW5/cgSAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:07.721461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3451499011515c693b82dc3286cbf68cb17d249f83f94aaf96703770a37be5a0","sha256:2894440f3bac872a6a438b9562c0d6129e06abe477142aa078dba452bf762776"],"state_sha256":"a2d67c6212cb802741e931345244dba6d42a38548c497fbd435fc8c093078d6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FU6QwGa4sM2TRt2mDxGmZqHypGjtC0ULJi8UBm3suYn1wNPbK7Svpkq8E167xLop/JIjEUXL8rWf0sLnR/D2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T23:11:46.307242Z","bundle_sha256":"28426d95a93c9ff8fd059424d28ea3b68016d6b4b62c95be91ca648fd73bbc19"}}