{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BWHKOBFHUVZ2CJRBTOVCO3E5SL","short_pith_number":"pith:BWHKOBFH","canonical_record":{"source":{"id":"1507.08208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-29T16:28:52Z","cross_cats_sorted":[],"title_canon_sha256":"9e2589bc9c063aebab1bf5945ba2751965db34fb12cb98624bbfeaf8d272ce9f","abstract_canon_sha256":"2eb35c304eee6e2bc1e327f01533317038192fc51809aa5a1a17263c309cd77a"},"schema_version":"1.0"},"canonical_sha256":"0d8ea704a7a573a126219baa276c9d92dd059a0e641dcd48b2d078981d713862","source":{"kind":"arxiv","id":"1507.08208","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08208","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08208v3","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08208","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"BWHKOBFHUVZ2","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BWHKOBFHUVZ2CJRB","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BWHKOBFH","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BWHKOBFHUVZ2CJRBTOVCO3E5SL","target":"record","payload":{"canonical_record":{"source":{"id":"1507.08208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-29T16:28:52Z","cross_cats_sorted":[],"title_canon_sha256":"9e2589bc9c063aebab1bf5945ba2751965db34fb12cb98624bbfeaf8d272ce9f","abstract_canon_sha256":"2eb35c304eee6e2bc1e327f01533317038192fc51809aa5a1a17263c309cd77a"},"schema_version":"1.0"},"canonical_sha256":"0d8ea704a7a573a126219baa276c9d92dd059a0e641dcd48b2d078981d713862","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:41.362370Z","signature_b64":"FzvcgNwKPe9QLFdd2LYKfTeWGhVFhwXMRt1QfYFFwRzJkMVHGH0Y67gO2SOls92v2JA5RUmkqUNRG4p4seAgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d8ea704a7a573a126219baa276c9d92dd059a0e641dcd48b2d078981d713862","last_reissued_at":"2026-05-18T01:11:41.361994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:41.361994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.08208","source_version":3,"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-18T01:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9IOO1i1lvVIFCgh0dCT8R77cgIbNE9amv4JMF0l3URVRIRwgJdkTabrdMYQ3xBd7VNE4F9YNa6O1Vwf1dzFgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:56:57.046066Z"},"content_sha256":"8d203dd248ac59a58c8ccb7ac2a2c78b0d45767b2728f48ad625f8bf8d32fbcc","schema_version":"1.0","event_id":"sha256:8d203dd248ac59a58c8ccb7ac2a2c78b0d45767b2728f48ad625f8bf8d32fbcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BWHKOBFHUVZ2CJRBTOVCO3E5SL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge-partitioning a graph into paths: beyond 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, St\\'ephan Thomass\\'e, Tien-Nam Le","submitted_at":"2015-07-29T16:28:52Z","abstract_excerpt":"The Bar\\'at-Thomassen conjecture asserts that there is a function $f$ such that for every fixed tree $T$ with $t$ edges, every graph which is $f(t)$-edge-connected with its number of edges divisible by $t$ has a partition of its edges into copies of $T$. This has been proved in the case of paths of length $2^k$ by Thomassen, and recently shown to be true for all paths by Botler, Mota, Oshiro and Wakabayashi. Our goal in this paper is to propose an alternative proof of the path case with a weaker hypothesis: Namely, we prove that there is a function $f$ such that every $24$-edge-connected graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08208","kind":"arxiv","version":3},"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-18T01:11:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V7NwmSYWnFZsp/VWX2/rVVRHHocr9bhJpwUYkic+7765erVMeysip8HEvmLcx8qZt78uOEhO1ijLgZHAZwXhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:56:57.046729Z"},"content_sha256":"371cd4873a4870a0cc87cc8dff1d57a93f39953310e92d5f5139809c41c01b1c","schema_version":"1.0","event_id":"sha256:371cd4873a4870a0cc87cc8dff1d57a93f39953310e92d5f5139809c41c01b1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWHKOBFHUVZ2CJRBTOVCO3E5SL/bundle.json","state_url":"https://pith.science/pith/BWHKOBFHUVZ2CJRBTOVCO3E5SL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWHKOBFHUVZ2CJRBTOVCO3E5SL/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-05-27T12:56:57Z","links":{"resolver":"https://pith.science/pith/BWHKOBFHUVZ2CJRBTOVCO3E5SL","bundle":"https://pith.science/pith/BWHKOBFHUVZ2CJRBTOVCO3E5SL/bundle.json","state":"https://pith.science/pith/BWHKOBFHUVZ2CJRBTOVCO3E5SL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWHKOBFHUVZ2CJRBTOVCO3E5SL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BWHKOBFHUVZ2CJRBTOVCO3E5SL","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":"2eb35c304eee6e2bc1e327f01533317038192fc51809aa5a1a17263c309cd77a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-29T16:28:52Z","title_canon_sha256":"9e2589bc9c063aebab1bf5945ba2751965db34fb12cb98624bbfeaf8d272ce9f"},"schema_version":"1.0","source":{"id":"1507.08208","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08208","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08208v3","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08208","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"BWHKOBFHUVZ2","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BWHKOBFHUVZ2CJRB","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BWHKOBFH","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:371cd4873a4870a0cc87cc8dff1d57a93f39953310e92d5f5139809c41c01b1c","target":"graph","created_at":"2026-05-18T01:11:41Z","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":"The Bar\\'at-Thomassen conjecture asserts that there is a function $f$ such that for every fixed tree $T$ with $t$ edges, every graph which is $f(t)$-edge-connected with its number of edges divisible by $t$ has a partition of its edges into copies of $T$. This has been proved in the case of paths of length $2^k$ by Thomassen, and recently shown to be true for all paths by Botler, Mota, Oshiro and Wakabayashi. Our goal in this paper is to propose an alternative proof of the path case with a weaker hypothesis: Namely, we prove that there is a function $f$ such that every $24$-edge-connected graph","authors_text":"Ararat Harutyunyan, Julien Bensmail, St\\'ephan Thomass\\'e, Tien-Nam Le","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-29T16:28:52Z","title":"Edge-partitioning a graph into paths: beyond the Bar\\'at-Thomassen conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08208","kind":"arxiv","version":3},"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:8d203dd248ac59a58c8ccb7ac2a2c78b0d45767b2728f48ad625f8bf8d32fbcc","target":"record","created_at":"2026-05-18T01:11:41Z","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":"2eb35c304eee6e2bc1e327f01533317038192fc51809aa5a1a17263c309cd77a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-29T16:28:52Z","title_canon_sha256":"9e2589bc9c063aebab1bf5945ba2751965db34fb12cb98624bbfeaf8d272ce9f"},"schema_version":"1.0","source":{"id":"1507.08208","kind":"arxiv","version":3}},"canonical_sha256":"0d8ea704a7a573a126219baa276c9d92dd059a0e641dcd48b2d078981d713862","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d8ea704a7a573a126219baa276c9d92dd059a0e641dcd48b2d078981d713862","first_computed_at":"2026-05-18T01:11:41.361994Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:41.361994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FzvcgNwKPe9QLFdd2LYKfTeWGhVFhwXMRt1QfYFFwRzJkMVHGH0Y67gO2SOls92v2JA5RUmkqUNRG4p4seAgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:41.362370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08208","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d203dd248ac59a58c8ccb7ac2a2c78b0d45767b2728f48ad625f8bf8d32fbcc","sha256:371cd4873a4870a0cc87cc8dff1d57a93f39953310e92d5f5139809c41c01b1c"],"state_sha256":"25119c459181d49b60e454fa89570f7216ad9772f7dcdca31f442890e467f131"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZ9zU+jh/r0kuwKF2qJnPtff2XYPlkb9BBbbuy1sjAXefTE/8+bOFMcZPqLW4yoAWfeWrxTOvcIyjzzArY6qCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:56:57.049908Z","bundle_sha256":"21743be4f00bbea60fd55b94768f1d9f9e3977b92d097a4272ed7cfd27001e98"}}