{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F3VI5KUT7UNEGZMTWCG72H3NFH","short_pith_number":"pith:F3VI5KUT","schema_version":"1.0","canonical_sha256":"2eea8eaa93fd1a436593b08dfd1f6d29c9eab68d9a8723ff9e9d19afddba757a","source":{"kind":"arxiv","id":"1603.00197","version":2},"attestation_state":"computed","paper":{"title":"A Proof of the Bar\\'at-Thomassen Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ararat Harutyunyan, Julien Bensmail, Martin Merker, St\\'ephan Thomass\\'e, Tien-Nam Le","submitted_at":"2016-03-01T09:29:37Z","abstract_excerpt":"The Bar\\'at-Thomassen conjecture asserts that for every tree $T$ on $m$ edges, there exists a constant $k_T$ such that every $k_T$-edge-connected graph with size divisible by $m$ can be edge-decomposed into copies of $T$. So far this conjecture has only been verified when $T$ is a path or when $T$ has diameter at most 4. Here we prove the full statement of the conjecture."},"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":"1603.00197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-01T09:29:37Z","cross_cats_sorted":[],"title_canon_sha256":"b42a851cd19ad3a8dc61e2da06788c049993bd36013d122b07f80b43e8183cb6","abstract_canon_sha256":"a43f70f57da897681a925448535b725b2e005bdaafc65c132935b2613764abc7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:58.718234Z","signature_b64":"JCbblzC/e3N8+T9zKUJuRs7RikgKFB4u2tc33arRBF7E6gkt/5P4PCwGQO485xzupdPJQK0JM5ogIleay6m0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2eea8eaa93fd1a436593b08dfd1f6d29c9eab68d9a8723ff9e9d19afddba757a","last_reissued_at":"2026-05-18T00:59:58.717685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:58.717685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proof of the Bar\\'at-Thomassen Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ararat Harutyunyan, Julien Bensmail, Martin Merker, St\\'ephan Thomass\\'e, Tien-Nam Le","submitted_at":"2016-03-01T09:29:37Z","abstract_excerpt":"The Bar\\'at-Thomassen conjecture asserts that for every tree $T$ on $m$ edges, there exists a constant $k_T$ such that every $k_T$-edge-connected graph with size divisible by $m$ can be edge-decomposed into copies of $T$. So far this conjecture has only been verified when $T$ is a path or when $T$ has diameter at most 4. Here we prove the full statement of the conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00197","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":"1603.00197","created_at":"2026-05-18T00:59:58.717757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00197v2","created_at":"2026-05-18T00:59:58.717757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00197","created_at":"2026-05-18T00:59:58.717757+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3VI5KUT7UNE","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3VI5KUT7UNEGZMT","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3VI5KUT","created_at":"2026-05-18T12:30:15.759754+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/F3VI5KUT7UNEGZMTWCG72H3NFH","json":"https://pith.science/pith/F3VI5KUT7UNEGZMTWCG72H3NFH.json","graph_json":"https://pith.science/api/pith-number/F3VI5KUT7UNEGZMTWCG72H3NFH/graph.json","events_json":"https://pith.science/api/pith-number/F3VI5KUT7UNEGZMTWCG72H3NFH/events.json","paper":"https://pith.science/paper/F3VI5KUT"},"agent_actions":{"view_html":"https://pith.science/pith/F3VI5KUT7UNEGZMTWCG72H3NFH","download_json":"https://pith.science/pith/F3VI5KUT7UNEGZMTWCG72H3NFH.json","view_paper":"https://pith.science/paper/F3VI5KUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00197&json=true","fetch_graph":"https://pith.science/api/pith-number/F3VI5KUT7UNEGZMTWCG72H3NFH/graph.json","fetch_events":"https://pith.science/api/pith-number/F3VI5KUT7UNEGZMTWCG72H3NFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3VI5KUT7UNEGZMTWCG72H3NFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3VI5KUT7UNEGZMTWCG72H3NFH/action/storage_attestation","attest_author":"https://pith.science/pith/F3VI5KUT7UNEGZMTWCG72H3NFH/action/author_attestation","sign_citation":"https://pith.science/pith/F3VI5KUT7UNEGZMTWCG72H3NFH/action/citation_signature","submit_replication":"https://pith.science/pith/F3VI5KUT7UNEGZMTWCG72H3NFH/action/replication_record"}},"created_at":"2026-05-18T00:59:58.717757+00:00","updated_at":"2026-05-18T00:59:58.717757+00:00"}