{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OJBSPZKKHCD3CL3Q5YXRRUXPXB","short_pith_number":"pith:OJBSPZKK","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"},"canonical_sha256":"724327e54a3887b12f70ee2f18d2efb84f85c157be90e8af40b528aab09ed229","source":{"kind":"arxiv","id":"1505.04309","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04309","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04309v2","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04309","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"OJBSPZKKHCD3","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJBSPZKKHCD3CL3Q","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJBSPZKK","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OJBSPZKKHCD3CL3Q5YXRRUXPXB","target":"record","payload":{"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"},"canonical_sha256":"724327e54a3887b12f70ee2f18d2efb84f85c157be90e8af40b528aab09ed229","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"},"source_kind":"arxiv","source_id":"1505.04309","source_version":2,"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:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMuiFYJUGxHi4mF5a0VHu1FJscxtqwG00DYNWhQ/NthQi+YZmSD49nCSmrWaVnN3w5k6jW7HUnfqCDBbwiX/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:02:44.173692Z"},"content_sha256":"2cb8176513dec75605e33e307052920138f73843da3730d5df93eabee38d0b6e","schema_version":"1.0","event_id":"sha256:2cb8176513dec75605e33e307052920138f73843da3730d5df93eabee38d0b6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OJBSPZKKHCD3CL3Q5YXRRUXPXB","target":"graph","payload":{"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"},"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:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxgQ+X+giTQ6sp7+s917X7oiAQXyzcZYI60sIauMCj5mDytYJ7lwGAyi/y9JNHTq9CW3TJWL5uMNIz/KQdQLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T04:02:44.174344Z"},"content_sha256":"cc899c9c01e808f0cc91daf9c37cb9bfa6d98c756540b42c63299789006b4244","schema_version":"1.0","event_id":"sha256:cc899c9c01e808f0cc91daf9c37cb9bfa6d98c756540b42c63299789006b4244"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/bundle.json","state_url":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/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-22T04:02:44Z","links":{"resolver":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB","bundle":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/bundle.json","state":"https://pith.science/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJBSPZKKHCD3CL3Q5YXRRUXPXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OJBSPZKKHCD3CL3Q5YXRRUXPXB","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":"80508ccdad1962d65d232994444a5ae49604ca372d1ef7c578f35daa7a809fc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T18:54:26Z","title_canon_sha256":"49aad316fac3b5051c3457500a695452d1497fe7e8815dedce2a7e589a82bcd6"},"schema_version":"1.0","source":{"id":"1505.04309","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04309","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04309v2","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04309","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"OJBSPZKKHCD3","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJBSPZKKHCD3CL3Q","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJBSPZKK","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:cc899c9c01e808f0cc91daf9c37cb9bfa6d98c756540b42c63299789006b4244","target":"graph","created_at":"2026-05-18T01:36:09Z","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":"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$.","authors_text":"F\\'abio Botler, Guilherme O. Mota, Marcio T. I. Oshiro, Yoshiko Wakabayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T18:54:26Z","title":"Decompositions of highly connected graphs into paths of length five"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04309","kind":"arxiv","version":2},"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:2cb8176513dec75605e33e307052920138f73843da3730d5df93eabee38d0b6e","target":"record","created_at":"2026-05-18T01:36:09Z","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":"80508ccdad1962d65d232994444a5ae49604ca372d1ef7c578f35daa7a809fc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T18:54:26Z","title_canon_sha256":"49aad316fac3b5051c3457500a695452d1497fe7e8815dedce2a7e589a82bcd6"},"schema_version":"1.0","source":{"id":"1505.04309","kind":"arxiv","version":2}},"canonical_sha256":"724327e54a3887b12f70ee2f18d2efb84f85c157be90e8af40b528aab09ed229","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"724327e54a3887b12f70ee2f18d2efb84f85c157be90e8af40b528aab09ed229","first_computed_at":"2026-05-18T01:36:09.070205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:09.070205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SVDq7ZQTBUpxG/SjtyosgAtEw1DFXTzW4ab4JuW2fEJ7KtrzWaXzMuXHjd+W/oHsjeX0wx01719vsmm7X2E0CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:09.070748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04309","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cb8176513dec75605e33e307052920138f73843da3730d5df93eabee38d0b6e","sha256:cc899c9c01e808f0cc91daf9c37cb9bfa6d98c756540b42c63299789006b4244"],"state_sha256":"323abe21b769360342d542f12683eede2d6a7dc018448f4cd1710e345924b65f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PJnw7YdlkH4PiZnzOz14xVFgCHDlV/W7eWpiiV43joVRdguRa6H4OdcD0L4uy57fyVIGRo3lLvqAh+f/xrmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T04:02:44.177734Z","bundle_sha256":"62b10e59d62a2a329d29f948bfda5291987a43be2098e0ea511cd317209e1aa0"}}