{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JTETUX2P7YJOLIP4BWJECXLSGI","short_pith_number":"pith:JTETUX2P","canonical_record":{"source":{"id":"1705.07066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-19T16:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"f8d0887c966e839dcb15ca71855f955bad15c712f48a43dca3d4320462b734dc","abstract_canon_sha256":"99e463a9c38db3df1f087aa6bc513d437acaaef08066ee586aaafee92b9948bf"},"schema_version":"1.0"},"canonical_sha256":"4cc93a5f4ffe12e5a1fc0d92415d72322f109eb4a3b5ab72d2defdcd90a192d0","source":{"kind":"arxiv","id":"1705.07066","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07066","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07066v2","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07066","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"JTETUX2P7YJO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JTETUX2P7YJOLIP4","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JTETUX2P","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JTETUX2P7YJOLIP4BWJECXLSGI","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07066","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-19T16:05:42Z","cross_cats_sorted":[],"title_canon_sha256":"f8d0887c966e839dcb15ca71855f955bad15c712f48a43dca3d4320462b734dc","abstract_canon_sha256":"99e463a9c38db3df1f087aa6bc513d437acaaef08066ee586aaafee92b9948bf"},"schema_version":"1.0"},"canonical_sha256":"4cc93a5f4ffe12e5a1fc0d92415d72322f109eb4a3b5ab72d2defdcd90a192d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:17.949862Z","signature_b64":"wJpmfczdP+8+db+Zlq0GTCQAvTCUraoGkQrpFfy94bAuGMGXyBtMspseNIaUkJJDVaomPj6H+wJR/JzIdkGhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cc93a5f4ffe12e5a1fc0d92415d72322f109eb4a3b5ab72d2defdcd90a192d0","last_reissued_at":"2026-05-18T00:38:17.948885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:17.948885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07066","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-18T00:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/tP4U3l/RXygJfwiYYXGkcvglzpI8OH5WpM7YrXGd/BVmAPvHQMj/0IgDN4r90FVZvQi4OdkMzxe/IdavQUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:27:14.848888Z"},"content_sha256":"605ce061629a6639ea86be0c8c938c0e311def3858218c15ac13c86ecaa78174","schema_version":"1.0","event_id":"sha256:605ce061629a6639ea86be0c8c938c0e311def3858218c15ac13c86ecaa78174"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JTETUX2P7YJOLIP4BWJECXLSGI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle decompositions of pathwidth-6 graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elke Fuchs, Irene Heinrich, Laura Gellert","submitted_at":"2017-05-19T16:05:42Z","abstract_excerpt":"Haj\\'os conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most (n - 1)/2 cycles. The conjecture is only proved for graph classes in which every element contains vertices of degree 2 or 4. We develop new techniques to construct cycle decompositions. They work on the common neighbourhood of two degree-6 vertices. With these techniques we find structures that cannot occur in a minimal counterexample to Haj\\'os conjecture and verify the conjecture for Eulerian graphs of pathwidth at most 6. This implies that these graphs satisfy the small cycle double cover co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07066","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-18T00:38:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o0v6ije0wEc3OYZxqGRAlU5QHvR3VIcgBfo46qrziVHa03GlUmJShhbDh7+Dg3q8scxc42DuVYCu3xHyBuoWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:27:14.849401Z"},"content_sha256":"e08f735aacf3a10e399740175fd62ce91fd94693bd732c41a1fd605086cf1726","schema_version":"1.0","event_id":"sha256:e08f735aacf3a10e399740175fd62ce91fd94693bd732c41a1fd605086cf1726"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTETUX2P7YJOLIP4BWJECXLSGI/bundle.json","state_url":"https://pith.science/pith/JTETUX2P7YJOLIP4BWJECXLSGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTETUX2P7YJOLIP4BWJECXLSGI/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-25T21:27:14Z","links":{"resolver":"https://pith.science/pith/JTETUX2P7YJOLIP4BWJECXLSGI","bundle":"https://pith.science/pith/JTETUX2P7YJOLIP4BWJECXLSGI/bundle.json","state":"https://pith.science/pith/JTETUX2P7YJOLIP4BWJECXLSGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTETUX2P7YJOLIP4BWJECXLSGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JTETUX2P7YJOLIP4BWJECXLSGI","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":"99e463a9c38db3df1f087aa6bc513d437acaaef08066ee586aaafee92b9948bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-19T16:05:42Z","title_canon_sha256":"f8d0887c966e839dcb15ca71855f955bad15c712f48a43dca3d4320462b734dc"},"schema_version":"1.0","source":{"id":"1705.07066","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07066","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07066v2","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07066","created_at":"2026-05-18T00:38:17Z"},{"alias_kind":"pith_short_12","alias_value":"JTETUX2P7YJO","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JTETUX2P7YJOLIP4","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JTETUX2P","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:e08f735aacf3a10e399740175fd62ce91fd94693bd732c41a1fd605086cf1726","target":"graph","created_at":"2026-05-18T00:38:17Z","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":"Haj\\'os conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most (n - 1)/2 cycles. The conjecture is only proved for graph classes in which every element contains vertices of degree 2 or 4. We develop new techniques to construct cycle decompositions. They work on the common neighbourhood of two degree-6 vertices. With these techniques we find structures that cannot occur in a minimal counterexample to Haj\\'os conjecture and verify the conjecture for Eulerian graphs of pathwidth at most 6. This implies that these graphs satisfy the small cycle double cover co","authors_text":"Elke Fuchs, Irene Heinrich, Laura Gellert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-19T16:05:42Z","title":"Cycle decompositions of pathwidth-6 graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07066","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:605ce061629a6639ea86be0c8c938c0e311def3858218c15ac13c86ecaa78174","target":"record","created_at":"2026-05-18T00:38:17Z","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":"99e463a9c38db3df1f087aa6bc513d437acaaef08066ee586aaafee92b9948bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-19T16:05:42Z","title_canon_sha256":"f8d0887c966e839dcb15ca71855f955bad15c712f48a43dca3d4320462b734dc"},"schema_version":"1.0","source":{"id":"1705.07066","kind":"arxiv","version":2}},"canonical_sha256":"4cc93a5f4ffe12e5a1fc0d92415d72322f109eb4a3b5ab72d2defdcd90a192d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cc93a5f4ffe12e5a1fc0d92415d72322f109eb4a3b5ab72d2defdcd90a192d0","first_computed_at":"2026-05-18T00:38:17.948885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:17.948885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wJpmfczdP+8+db+Zlq0GTCQAvTCUraoGkQrpFfy94bAuGMGXyBtMspseNIaUkJJDVaomPj6H+wJR/JzIdkGhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:17.949862Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07066","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:605ce061629a6639ea86be0c8c938c0e311def3858218c15ac13c86ecaa78174","sha256:e08f735aacf3a10e399740175fd62ce91fd94693bd732c41a1fd605086cf1726"],"state_sha256":"7587330198dcbec6ab2316a795868e7d94fe0bb2892c282ae98039c0fabfda02"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jIKqsWZ9i+WfeorVmRSEQZ+ZK+QoWYjG6Dfwbxm4m99Hvu8ldzbcjDUuHVSO0z1UnaRzJ2tpMzp09vb5liYmBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T21:27:14.852016Z","bundle_sha256":"bba839001a161c878d51cb24a70ae96c18f5832ee18f2b33263f3b8c5a795828"}}