{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OJBSPZKKHCD3CL3Q5YXRRUXPXB","short_pith_number":"pith:OJBSPZKK","schema_version":"1.0","canonical_sha256":"724327e54a3887b12f70ee2f18d2efb84f85c157be90e8af40b528aab09ed229","source":{"kind":"arxiv","id":"1505.04309","version":2},"attestation_state":"computed","paper":{"title":"Decompositions of highly connected graphs into paths of length five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F\\'abio Botler, Guilherme O. Mota, Marcio T. I. Oshiro, Yoshiko Wakabayashi","submitted_at":"2015-05-16T18:54:26Z","abstract_excerpt":"We study the Decomposition Conjecture posed by Bar\\'at and Thomassen (2006), which states that for every tree $T$ there exists a natural number $k_T$ such that, if $G$ is a $k_T$-edge-connected graph and $|E(T)|$ divides $|E(G)|$, then $G$ admits a decomposition into copies of $T$. In a series of papers, Thomassen verified this conjecture for stars, some bistars, paths of length $3$, and paths whose length is a power of $2$. We verify the Decomposition Conjecture for paths of length $5$."},"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":"1505.04309","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T18:54:26Z","cross_cats_sorted":[],"title_canon_sha256":"49aad316fac3b5051c3457500a695452d1497fe7e8815dedce2a7e589a82bcd6","abstract_canon_sha256":"80508ccdad1962d65d232994444a5ae49604ca372d1ef7c578f35daa7a809fc6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:09.070748Z","signature_b64":"SVDq7ZQTBUpxG/SjtyosgAtEw1DFXTzW4ab4JuW2fEJ7KtrzWaXzMuXHjd+W/oHsjeX0wx01719vsmm7X2E0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"724327e54a3887b12f70ee2f18d2efb84f85c157be90e8af40b528aab09ed229","last_reissued_at":"2026-05-18T01:36:09.070205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:09.070205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decompositions of highly connected graphs into paths of length five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F\\'abio Botler, Guilherme O. Mota, Marcio T. I. Oshiro, Yoshiko Wakabayashi","submitted_at":"2015-05-16T18:54:26Z","abstract_excerpt":"We study the Decomposition Conjecture posed by Bar\\'at and Thomassen (2006), which states that for every tree $T$ there exists a natural number $k_T$ such that, if $G$ is a $k_T$-edge-connected graph and $|E(T)|$ divides $|E(G)|$, then $G$ admits a decomposition into copies of $T$. In a series of papers, Thomassen verified this conjecture for stars, some bistars, paths of length $3$, and paths whose length is a power of $2$. We verify the Decomposition Conjecture for paths of length $5$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04309","kind":"arxiv","version":2},"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":"1505.04309","created_at":"2026-05-18T01:36:09.070264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04309v2","created_at":"2026-05-18T01:36:09.070264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04309","created_at":"2026-05-18T01:36:09.070264+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJBSPZKKHCD3","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJBSPZKKHCD3CL3Q","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJBSPZKK","created_at":"2026-05-18T12:29:34.919912+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/OJBSPZKKHCD3CL3Q5YXRRUXPXB","json":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB.json","graph_json":"https://pith.science/api/pith-number/OJBSPZKKHCD3CL3Q5YXRRUXPXB/graph.json","events_json":"https://pith.science/api/pith-number/OJBSPZKKHCD3CL3Q5YXRRUXPXB/events.json","paper":"https://pith.science/paper/OJBSPZKK"},"agent_actions":{"view_html":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB","download_json":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB.json","view_paper":"https://pith.science/paper/OJBSPZKK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04309&json=true","fetch_graph":"https://pith.science/api/pith-number/OJBSPZKKHCD3CL3Q5YXRRUXPXB/graph.json","fetch_events":"https://pith.science/api/pith-number/OJBSPZKKHCD3CL3Q5YXRRUXPXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/action/storage_attestation","attest_author":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/action/author_attestation","sign_citation":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/action/citation_signature","submit_replication":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/action/replication_record"}},"created_at":"2026-05-18T01:36:09.070264+00:00","updated_at":"2026-05-18T01:36:09.070264+00:00"}