{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ZSKY7PV33HGHSY6F2LYGPUIINB","short_pith_number":"pith:ZSKY7PV3","canonical_record":{"source":{"id":"1211.1868","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-08T14:38:22Z","cross_cats_sorted":[],"title_canon_sha256":"8e19fbc2b33b7c57fb79fd43cb31b58ca6a5e2cfcfebeadef6db451b85829f91","abstract_canon_sha256":"61b055fe91b07e6362fabbdf8b9d2edf6ff0605575c6a4ec63a4be127c6978ee"},"schema_version":"1.0"},"canonical_sha256":"cc958fbebbd9cc7963c5d2f067d108684ae938fdc9fee31b67c0b1909e677167","source":{"kind":"arxiv","id":"1211.1868","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1868","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1868v4","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1868","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZSKY7PV33HGH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZSKY7PV33HGHSY6F","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZSKY7PV3","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ZSKY7PV33HGHSY6F2LYGPUIINB","target":"record","payload":{"canonical_record":{"source":{"id":"1211.1868","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-08T14:38:22Z","cross_cats_sorted":[],"title_canon_sha256":"8e19fbc2b33b7c57fb79fd43cb31b58ca6a5e2cfcfebeadef6db451b85829f91","abstract_canon_sha256":"61b055fe91b07e6362fabbdf8b9d2edf6ff0605575c6a4ec63a4be127c6978ee"},"schema_version":"1.0"},"canonical_sha256":"cc958fbebbd9cc7963c5d2f067d108684ae938fdc9fee31b67c0b1909e677167","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:03.438551Z","signature_b64":"ozj4FvbpdFg9WxopCmhiyd2DXXmOFUL9R2P2XJ1bE7XMdwgDQInFjEiSqLxmugjMepgUUaSCZHr/WeZSViNbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc958fbebbd9cc7963c5d2f067d108684ae938fdc9fee31b67c0b1909e677167","last_reissued_at":"2026-05-18T00:16:03.438140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:03.438140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.1868","source_version":4,"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:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/b0fHFrmbVTJ6BKUW74Ba94cNf3kP3+aeYGTS9YW8VPoTgHR08fCBln8QpyC3k6Ejnpnf5pvPiQ2mqYMkvRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:25:57.188449Z"},"content_sha256":"5d3676851542041e741ecf16ad42b005f68f1c6b24bd1cf8f5aab8fc56684d8c","schema_version":"1.0","event_id":"sha256:5d3676851542041e741ecf16ad42b005f68f1c6b24bd1cf8f5aab8fc56684d8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ZSKY7PV33HGHSY6F2LYGPUIINB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Even-cycle decompositions of graphs with no odd-$K_4$-minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maryam Verdian-Rizi, Sang-il Oum, Tony Huynh","submitted_at":"2012-11-08T14:38:22Z","abstract_excerpt":"An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length. Evidently, every Eulerian bipartite graph has an even-cycle decomposition. Seymour (1981) proved that every 2-connected loopless Eulerian planar graph with an even number of edges also admits an even-cycle decomposition. Later, Zhang (1994) generalized this to graphs with no $K_5$-minor.\n  Our main theorem gives sufficient conditions for the existence of even-cycle decompositions of graphs in the absence of odd minors. Namely, we prove that every 2-connected loopless Eulerian odd-$K_4$-minor-free graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1868","kind":"arxiv","version":4},"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:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkIR3pSlLJtKS/7XczHwrO7QBI72gvRbrk1pdQFihnIMjCk7Il81dDmHFfrhtNezDjD/MuP7/kPO5ubK3MOjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:25:57.188793Z"},"content_sha256":"d21a5cb988094fa05d6a0ed07b24e74cbbe54c43f70f2aa6c351dc9d47857113","schema_version":"1.0","event_id":"sha256:d21a5cb988094fa05d6a0ed07b24e74cbbe54c43f70f2aa6c351dc9d47857113"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSKY7PV33HGHSY6F2LYGPUIINB/bundle.json","state_url":"https://pith.science/pith/ZSKY7PV33HGHSY6F2LYGPUIINB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSKY7PV33HGHSY6F2LYGPUIINB/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-10T19:25:57Z","links":{"resolver":"https://pith.science/pith/ZSKY7PV33HGHSY6F2LYGPUIINB","bundle":"https://pith.science/pith/ZSKY7PV33HGHSY6F2LYGPUIINB/bundle.json","state":"https://pith.science/pith/ZSKY7PV33HGHSY6F2LYGPUIINB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSKY7PV33HGHSY6F2LYGPUIINB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ZSKY7PV33HGHSY6F2LYGPUIINB","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":"61b055fe91b07e6362fabbdf8b9d2edf6ff0605575c6a4ec63a4be127c6978ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-08T14:38:22Z","title_canon_sha256":"8e19fbc2b33b7c57fb79fd43cb31b58ca6a5e2cfcfebeadef6db451b85829f91"},"schema_version":"1.0","source":{"id":"1211.1868","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1868","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1868v4","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1868","created_at":"2026-05-18T00:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZSKY7PV33HGH","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"ZSKY7PV33HGHSY6F","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"ZSKY7PV3","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:d21a5cb988094fa05d6a0ed07b24e74cbbe54c43f70f2aa6c351dc9d47857113","target":"graph","created_at":"2026-05-18T00:16:03Z","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":"An even-cycle decomposition of a graph G is a partition of E(G) into cycles of even length. Evidently, every Eulerian bipartite graph has an even-cycle decomposition. Seymour (1981) proved that every 2-connected loopless Eulerian planar graph with an even number of edges also admits an even-cycle decomposition. Later, Zhang (1994) generalized this to graphs with no $K_5$-minor.\n  Our main theorem gives sufficient conditions for the existence of even-cycle decompositions of graphs in the absence of odd minors. Namely, we prove that every 2-connected loopless Eulerian odd-$K_4$-minor-free graph ","authors_text":"Maryam Verdian-Rizi, Sang-il Oum, Tony Huynh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-08T14:38:22Z","title":"Even-cycle decompositions of graphs with no odd-$K_4$-minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1868","kind":"arxiv","version":4},"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:5d3676851542041e741ecf16ad42b005f68f1c6b24bd1cf8f5aab8fc56684d8c","target":"record","created_at":"2026-05-18T00:16:03Z","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":"61b055fe91b07e6362fabbdf8b9d2edf6ff0605575c6a4ec63a4be127c6978ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-08T14:38:22Z","title_canon_sha256":"8e19fbc2b33b7c57fb79fd43cb31b58ca6a5e2cfcfebeadef6db451b85829f91"},"schema_version":"1.0","source":{"id":"1211.1868","kind":"arxiv","version":4}},"canonical_sha256":"cc958fbebbd9cc7963c5d2f067d108684ae938fdc9fee31b67c0b1909e677167","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc958fbebbd9cc7963c5d2f067d108684ae938fdc9fee31b67c0b1909e677167","first_computed_at":"2026-05-18T00:16:03.438140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:03.438140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ozj4FvbpdFg9WxopCmhiyd2DXXmOFUL9R2P2XJ1bE7XMdwgDQInFjEiSqLxmugjMepgUUaSCZHr/WeZSViNbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:03.438551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1868","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d3676851542041e741ecf16ad42b005f68f1c6b24bd1cf8f5aab8fc56684d8c","sha256:d21a5cb988094fa05d6a0ed07b24e74cbbe54c43f70f2aa6c351dc9d47857113"],"state_sha256":"07aaa7fc649d3c841d2d71a43133052de5a675ff72c1ccc3d25641cd57464c8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+DW+lajBqKWwNPCfbYlZknOEiytNuKp56ALUMeaSkPLt5sUbalvw6PVb4S8qurWDFMIyxaVNFD1ulU/sILZuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:25:57.190728Z","bundle_sha256":"5dfd271393893b995a367829bd7e922abe30673304bcf4b3f0ba1f059a51eaa1"}}