{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GW2TIVEATXDSXLNPD65VGDHG5N","short_pith_number":"pith:GW2TIVEA","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"},"canonical_sha256":"35b53454809dc72badaf1fbb530ce6eb7bb448d26f52b1dcd7e00bbd2bd66ffa","source":{"kind":"arxiv","id":"1607.01456","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01456","created_at":"2026-05-18T01:11:26Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01456v1","created_at":"2026-05-18T01:11:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01456","created_at":"2026-05-18T01:11:26Z"},{"alias_kind":"pith_short_12","alias_value":"GW2TIVEATXDS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GW2TIVEATXDSXLNP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GW2TIVEA","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GW2TIVEATXDSXLNPD65VGDHG5N","target":"record","payload":{"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"},"canonical_sha256":"35b53454809dc72badaf1fbb530ce6eb7bb448d26f52b1dcd7e00bbd2bd66ffa","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"},"source_kind":"arxiv","source_id":"1607.01456","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-18T01:11:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VR9Q3rL5PBECPNkTS7a/AgoU4usEh5kRjEj1KZbAuOYtH8LzmPWCLpAL0sLl3wIyhjz50rqBv8KVMoJtygkNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:42:15.806675Z"},"content_sha256":"b3b508370a02bd283979fb2a16371bf82e106dd33cf3841d26e53804ef0c930c","schema_version":"1.0","event_id":"sha256:b3b508370a02bd283979fb2a16371bf82e106dd33cf3841d26e53804ef0c930c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GW2TIVEATXDSXLNPD65VGDHG5N","target":"graph","payload":{"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"},"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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XNakWJAn01v3LJgg+irqco7v5VUdWiGWw7ZLPMIAjRaAlCK/17bTtLpWcJVEnhog8Pz7TGEpfhYxU7r0wgRxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:42:15.807325Z"},"content_sha256":"76e3552c9e8411ba9fce8e10a64e8a75b32f0a4919290a7504a729e84e4e2539","schema_version":"1.0","event_id":"sha256:76e3552c9e8411ba9fce8e10a64e8a75b32f0a4919290a7504a729e84e4e2539"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N/bundle.json","state_url":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GW2TIVEATXDSXLNPD65VGDHG5N/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-06-26T12:42:15Z","links":{"resolver":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N","bundle":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N/bundle.json","state":"https://pith.science/pith/GW2TIVEATXDSXLNPD65VGDHG5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GW2TIVEATXDSXLNPD65VGDHG5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GW2TIVEATXDSXLNPD65VGDHG5N","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":"a3977acbcb31bfb9d9de4e68012e94552c33d66b4e1aa22ea3b0f5c8d639a0ce","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-06T01:57:08Z","title_canon_sha256":"6a89ea81f86b29932d3b08ce97aceffcfea7accae3d4ea39334313eb5cdb178d"},"schema_version":"1.0","source":{"id":"1607.01456","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.01456","created_at":"2026-05-18T01:11:26Z"},{"alias_kind":"arxiv_version","alias_value":"1607.01456v1","created_at":"2026-05-18T01:11:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01456","created_at":"2026-05-18T01:11:26Z"},{"alias_kind":"pith_short_12","alias_value":"GW2TIVEATXDS","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GW2TIVEATXDSXLNP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GW2TIVEA","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:76e3552c9e8411ba9fce8e10a64e8a75b32f0a4919290a7504a729e84e4e2539","target":"graph","created_at":"2026-05-18T01:11:26Z","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":"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 ","authors_text":"Alexandre Talon, F\\'abio Botler","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-06T01:57:08Z","title":"Decomposing 8-regular graphs into paths of length 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01456","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:b3b508370a02bd283979fb2a16371bf82e106dd33cf3841d26e53804ef0c930c","target":"record","created_at":"2026-05-18T01:11:26Z","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":"a3977acbcb31bfb9d9de4e68012e94552c33d66b4e1aa22ea3b0f5c8d639a0ce","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-06T01:57:08Z","title_canon_sha256":"6a89ea81f86b29932d3b08ce97aceffcfea7accae3d4ea39334313eb5cdb178d"},"schema_version":"1.0","source":{"id":"1607.01456","kind":"arxiv","version":1}},"canonical_sha256":"35b53454809dc72badaf1fbb530ce6eb7bb448d26f52b1dcd7e00bbd2bd66ffa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35b53454809dc72badaf1fbb530ce6eb7bb448d26f52b1dcd7e00bbd2bd66ffa","first_computed_at":"2026-05-18T01:11:26.382517Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:26.382517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CV03iaOZnIDpv9AFSJqbaW1UlGsjTuk2F2QP8SbWtkNQNKGBoHKqumJDOB0/0Yk6Ww6NztTXvjLDc5L2iuEyBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:26.382917Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.01456","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3b508370a02bd283979fb2a16371bf82e106dd33cf3841d26e53804ef0c930c","sha256:76e3552c9e8411ba9fce8e10a64e8a75b32f0a4919290a7504a729e84e4e2539"],"state_sha256":"c353ad3db1b24b343cc554cd81c6e116867a8a64983fde3e1066e12231366519"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9oe/l1aF/OoV4y/v6R5gyzxhJ45ko85/y38/XepIAlGI5LOFUTASRtcjAc6pu4VmMDLuFGKZbV9tejnypFZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:42:15.809494Z","bundle_sha256":"f8af7c38b177c7747a63bc3f02f2a4b13530f0d7b725d356b200d77727b28e3e"}}