{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3SBUICMOATMTA7NSY45LO2IKEY","short_pith_number":"pith:3SBUICMO","canonical_record":{"source":{"id":"1510.02526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-08T23:10:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8b5e6165c5d2b577af353c20c86aec2f462d150066d7eded29fd1f1aecdf58cc","abstract_canon_sha256":"ef20a2d0fd9916dbfff67f15acb2ef331df038a3a9c730fd93d6976fca3d307e"},"schema_version":"1.0"},"canonical_sha256":"dc8344098e04d9307db2c73ab7690a261c4abf157a8492048760163d8400f9e7","source":{"kind":"arxiv","id":"1510.02526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02526","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02526v1","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02526","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"3SBUICMOATMT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3SBUICMOATMTA7NS","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3SBUICMO","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3SBUICMOATMTA7NSY45LO2IKEY","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-08T23:10:00Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8b5e6165c5d2b577af353c20c86aec2f462d150066d7eded29fd1f1aecdf58cc","abstract_canon_sha256":"ef20a2d0fd9916dbfff67f15acb2ef331df038a3a9c730fd93d6976fca3d307e"},"schema_version":"1.0"},"canonical_sha256":"dc8344098e04d9307db2c73ab7690a261c4abf157a8492048760163d8400f9e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:42.191968Z","signature_b64":"GKh2KdR3krgrK88ZVZVcEFgitJO3yz/QBpsj6M4xvab4tBnaSA7qmt/kIiJZ2MG1QHgwmdzHEWEQCBCblW4EBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc8344098e04d9307db2c73ab7690a261c4abf157a8492048760163d8400f9e7","last_reissued_at":"2026-05-18T01:30:42.191327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:42.191327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02526","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:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1847VYKtDttaEZj5AAnwUSyxccqrc3p7YDsjE8x2F7ZxCJlDiKpzgMGUxSVJOKpwujrD2a5fGCUN3JyZe97SBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:12:53.375268Z"},"content_sha256":"6695f47c81bdb5ade886ea3582ac9020ee19c4a1352332dd420cb09bb60ddc29","schema_version":"1.0","event_id":"sha256:6695f47c81bdb5ade886ea3582ac9020ee19c4a1352332dd420cb09bb60ddc29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3SBUICMOATMTA7NSY45LO2IKEY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On path decompositions of 2k-regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andrea Jim\\'enez, F\\'abio Botler","submitted_at":"2015-10-08T23:10:00Z","abstract_excerpt":"Tibor Gallai conjectured that the edge set of every connected graph $G$ on $n$ vertices can be partitioned into $\\lceil n/2\\rceil$ paths. Let $\\mathcal{G}_{k}$ be the class of all $2k$-regular graphs of girth at least $2k-2$ that admit a pair of disjoint perfect matchings. In this work, we show that Gallai's conjecture holds in $\\mathcal{G}_{k}$, for every $k \\geq 3$. Further, we prove that for every graph $G$ in $\\mathcal{G}_{k}$ on $n$ vertices, there exists a partition of its edge set into $n/2$ paths of lengths in $\\{2k-1,2k,2k+1\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02526","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:30:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NiwLyDTKDjLDluh4k9d9IPCvdCjqcXdswb+hBPwmu5F/4U/oQUYBZPaW8yBBNVqx4sTmMrIGE0y3sQ/3ev/XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:12:53.375634Z"},"content_sha256":"cbfa026fd68231d80e9b539934ed19937773d2cd227ad841050e18a395e550a3","schema_version":"1.0","event_id":"sha256:cbfa026fd68231d80e9b539934ed19937773d2cd227ad841050e18a395e550a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3SBUICMOATMTA7NSY45LO2IKEY/bundle.json","state_url":"https://pith.science/pith/3SBUICMOATMTA7NSY45LO2IKEY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3SBUICMOATMTA7NSY45LO2IKEY/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-30T13:12:53Z","links":{"resolver":"https://pith.science/pith/3SBUICMOATMTA7NSY45LO2IKEY","bundle":"https://pith.science/pith/3SBUICMOATMTA7NSY45LO2IKEY/bundle.json","state":"https://pith.science/pith/3SBUICMOATMTA7NSY45LO2IKEY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3SBUICMOATMTA7NSY45LO2IKEY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3SBUICMOATMTA7NSY45LO2IKEY","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":"ef20a2d0fd9916dbfff67f15acb2ef331df038a3a9c730fd93d6976fca3d307e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-08T23:10:00Z","title_canon_sha256":"8b5e6165c5d2b577af353c20c86aec2f462d150066d7eded29fd1f1aecdf58cc"},"schema_version":"1.0","source":{"id":"1510.02526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02526","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02526v1","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02526","created_at":"2026-05-18T01:30:42Z"},{"alias_kind":"pith_short_12","alias_value":"3SBUICMOATMT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3SBUICMOATMTA7NS","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3SBUICMO","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:cbfa026fd68231d80e9b539934ed19937773d2cd227ad841050e18a395e550a3","target":"graph","created_at":"2026-05-18T01:30:42Z","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":"Tibor Gallai conjectured that the edge set of every connected graph $G$ on $n$ vertices can be partitioned into $\\lceil n/2\\rceil$ paths. Let $\\mathcal{G}_{k}$ be the class of all $2k$-regular graphs of girth at least $2k-2$ that admit a pair of disjoint perfect matchings. In this work, we show that Gallai's conjecture holds in $\\mathcal{G}_{k}$, for every $k \\geq 3$. Further, we prove that for every graph $G$ in $\\mathcal{G}_{k}$ on $n$ vertices, there exists a partition of its edge set into $n/2$ paths of lengths in $\\{2k-1,2k,2k+1\\}$.","authors_text":"Andrea Jim\\'enez, F\\'abio Botler","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-08T23:10:00Z","title":"On path decompositions of 2k-regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02526","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:6695f47c81bdb5ade886ea3582ac9020ee19c4a1352332dd420cb09bb60ddc29","target":"record","created_at":"2026-05-18T01:30:42Z","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":"ef20a2d0fd9916dbfff67f15acb2ef331df038a3a9c730fd93d6976fca3d307e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-08T23:10:00Z","title_canon_sha256":"8b5e6165c5d2b577af353c20c86aec2f462d150066d7eded29fd1f1aecdf58cc"},"schema_version":"1.0","source":{"id":"1510.02526","kind":"arxiv","version":1}},"canonical_sha256":"dc8344098e04d9307db2c73ab7690a261c4abf157a8492048760163d8400f9e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dc8344098e04d9307db2c73ab7690a261c4abf157a8492048760163d8400f9e7","first_computed_at":"2026-05-18T01:30:42.191327Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:42.191327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GKh2KdR3krgrK88ZVZVcEFgitJO3yz/QBpsj6M4xvab4tBnaSA7qmt/kIiJZ2MG1QHgwmdzHEWEQCBCblW4EBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:42.191968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6695f47c81bdb5ade886ea3582ac9020ee19c4a1352332dd420cb09bb60ddc29","sha256:cbfa026fd68231d80e9b539934ed19937773d2cd227ad841050e18a395e550a3"],"state_sha256":"34a7a55d07c5ffaa82669ac67b6a8752f57b92685f6bf8b5f1c5a82c19fe6407"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqszMbF2V/bqBbBwWmTwj/9ai8BmzzW+HIbN5ilMW8LPoiCiE62RgvSzuWOYXKKDlqSe62iZEzmXyBD9uesKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:12:53.377865Z","bundle_sha256":"e7d96eaef4fe80b7959e9d3fddbcc51a22a77f62b03e2ac74c03f1252b4c74e6"}}