{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GW2TIVEATXDSXLNPD65VGDHG5N","short_pith_number":"pith:GW2TIVEA","schema_version":"1.0","canonical_sha256":"35b53454809dc72badaf1fbb530ce6eb7bb448d26f52b1dcd7e00bbd2bd66ffa","source":{"kind":"arxiv","id":"1607.01456","version":1},"attestation_state":"computed","paper":{"title":"Decomposing 8-regular graphs into paths of length 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexandre Talon, F\\'abio Botler","submitted_at":"2016-07-06T01:57:08Z","abstract_excerpt":"A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and H\\\"aggkvist (1989) conjectured that any $2\\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with $\\ell$ edges. Kouider and Lonc (1999) conjectured that, in the special case where $T$ is the path with $\\ell$ edges, $G$ admits a $T$-decomposition $\\mathcal{D}$ where every vertex of $G$ is the end-vertex of exactly two paths of $\\mathcal{D}$, and proved that this statement holds when $G$ has girth at least $(\\ell+3)/2$. In this paper we verify Kouider and "},"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":"1607.01456","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-06T01:57:08Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6a89ea81f86b29932d3b08ce97aceffcfea7accae3d4ea39334313eb5cdb178d","abstract_canon_sha256":"a3977acbcb31bfb9d9de4e68012e94552c33d66b4e1aa22ea3b0f5c8d639a0ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:26.382917Z","signature_b64":"CV03iaOZnIDpv9AFSJqbaW1UlGsjTuk2F2QP8SbWtkNQNKGBoHKqumJDOB0/0Yk6Ww6NztTXvjLDc5L2iuEyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35b53454809dc72badaf1fbb530ce6eb7bb448d26f52b1dcd7e00bbd2bd66ffa","last_reissued_at":"2026-05-18T01:11:26.382517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:26.382517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing 8-regular graphs into paths of length 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexandre Talon, F\\'abio Botler","submitted_at":"2016-07-06T01:57:08Z","abstract_excerpt":"A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and H\\\"aggkvist (1989) conjectured that any $2\\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with $\\ell$ edges. Kouider and Lonc (1999) conjectured that, in the special case where $T$ is the path with $\\ell$ edges, $G$ admits a $T$-decomposition $\\mathcal{D}$ where every vertex of $G$ is the end-vertex of exactly two paths of $\\mathcal{D}$, and proved that this statement holds when $G$ has girth at least $(\\ell+3)/2$. In this paper we verify Kouider and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01456","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":"1607.01456","created_at":"2026-05-18T01:11:26.382579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01456v1","created_at":"2026-05-18T01:11:26.382579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01456","created_at":"2026-05-18T01:11:26.382579+00:00"},{"alias_kind":"pith_short_12","alias_value":"GW2TIVEATXDS","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GW2TIVEATXDSXLNP","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GW2TIVEA","created_at":"2026-05-18T12:30:19.053100+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/GW2TIVEATXDSXLNPD65VGDHG5N","json":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N.json","graph_json":"https://pith.science/api/pith-number/GW2TIVEATXDSXLNPD65VGDHG5N/graph.json","events_json":"https://pith.science/api/pith-number/GW2TIVEATXDSXLNPD65VGDHG5N/events.json","paper":"https://pith.science/paper/GW2TIVEA"},"agent_actions":{"view_html":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N","download_json":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N.json","view_paper":"https://pith.science/paper/GW2TIVEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01456&json=true","fetch_graph":"https://pith.science/api/pith-number/GW2TIVEATXDSXLNPD65VGDHG5N/graph.json","fetch_events":"https://pith.science/api/pith-number/GW2TIVEATXDSXLNPD65VGDHG5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N/action/storage_attestation","attest_author":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N/action/author_attestation","sign_citation":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N/action/citation_signature","submit_replication":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N/action/replication_record"}},"created_at":"2026-05-18T01:11:26.382579+00:00","updated_at":"2026-05-18T01:11:26.382579+00:00"}