{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CSWDW4WNIGU2KR33NM44VDOYYX","short_pith_number":"pith:CSWDW4WN","canonical_record":{"source":{"id":"1708.09141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-30T07:08:14Z","cross_cats_sorted":[],"title_canon_sha256":"934d7795823bf46e0612ee76c86c4ef584ec18760cbc6e2841fc6194c27f0dab","abstract_canon_sha256":"25543bd7adc97e1cf93be4ee060e243b5730c569d7b58a76d39e0d72e69f2ef7"},"schema_version":"1.0"},"canonical_sha256":"14ac3b72cd41a9a5477b6b39ca8dd8c5d94b86d43077a1b223641843a3327d2b","source":{"kind":"arxiv","id":"1708.09141","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09141","created_at":"2026-05-17T23:56:55Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09141v2","created_at":"2026-05-17T23:56:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09141","created_at":"2026-05-17T23:56:55Z"},{"alias_kind":"pith_short_12","alias_value":"CSWDW4WNIGU2","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CSWDW4WNIGU2KR33","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CSWDW4WN","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CSWDW4WNIGU2KR33NM44VDOYYX","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-30T07:08:14Z","cross_cats_sorted":[],"title_canon_sha256":"934d7795823bf46e0612ee76c86c4ef584ec18760cbc6e2841fc6194c27f0dab","abstract_canon_sha256":"25543bd7adc97e1cf93be4ee060e243b5730c569d7b58a76d39e0d72e69f2ef7"},"schema_version":"1.0"},"canonical_sha256":"14ac3b72cd41a9a5477b6b39ca8dd8c5d94b86d43077a1b223641843a3327d2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:55.832692Z","signature_b64":"maWCnJkXX5lF4U/4KQwpMYd94U/vfcI3HSiaKor3KfNHbcYUz3Jwq0Ugk+Ui5E81yfmeWG4h5y3wSQUc9W4+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14ac3b72cd41a9a5477b6b39ca8dd8c5d94b86d43077a1b223641843a3327d2b","last_reissued_at":"2026-05-17T23:56:55.832176Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:55.832176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09141","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-17T23:56:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mwLUWJk2h205b8U8c2erCM/IBX1d9YSMQy/SxHONyKQHgV3FytIfldaUTWVg9+tRmNn3cAOttcklXyC80zIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:21:18.457658Z"},"content_sha256":"aeae7ce802218d36392903c04369bdc00344cfbc196ecdddc722e64628515306","schema_version":"1.0","event_id":"sha256:aeae7ce802218d36392903c04369bdc00344cfbc196ecdddc722e64628515306"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CSWDW4WNIGU2KR33NM44VDOYYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle Decompositions and Constructive Characterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irene Heinrich, Manuel Streicher","submitted_at":"2017-08-30T07:08:14Z","abstract_excerpt":"Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two edge disjoint cycles sharing three or more vertices. To this end, we discuss the interplay of three binary graph operators leading to novel constructive characterizations of two subclasses of Eulerian graphs. This enables us to present a polynomial-time algorithm which decides whether the number of cycles in a cycle decomposition of a given Eulerian graph is un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09141","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-17T23:56:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0FLaGezBbmlLRzUChoLv2k3pYkje55GTFW5pcFE4pXlXPEoVfC1UprlXSXpwQKv4/ssa7YeBk5UTf4gcrfaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T03:21:18.458223Z"},"content_sha256":"da12ff51cfb76cbda7999769b525625b432605fe02d2f5d4a2dd2764c59243fd","schema_version":"1.0","event_id":"sha256:da12ff51cfb76cbda7999769b525625b432605fe02d2f5d4a2dd2764c59243fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSWDW4WNIGU2KR33NM44VDOYYX/bundle.json","state_url":"https://pith.science/pith/CSWDW4WNIGU2KR33NM44VDOYYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSWDW4WNIGU2KR33NM44VDOYYX/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-26T03:21:18Z","links":{"resolver":"https://pith.science/pith/CSWDW4WNIGU2KR33NM44VDOYYX","bundle":"https://pith.science/pith/CSWDW4WNIGU2KR33NM44VDOYYX/bundle.json","state":"https://pith.science/pith/CSWDW4WNIGU2KR33NM44VDOYYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSWDW4WNIGU2KR33NM44VDOYYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CSWDW4WNIGU2KR33NM44VDOYYX","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":"25543bd7adc97e1cf93be4ee060e243b5730c569d7b58a76d39e0d72e69f2ef7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-30T07:08:14Z","title_canon_sha256":"934d7795823bf46e0612ee76c86c4ef584ec18760cbc6e2841fc6194c27f0dab"},"schema_version":"1.0","source":{"id":"1708.09141","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09141","created_at":"2026-05-17T23:56:55Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09141v2","created_at":"2026-05-17T23:56:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09141","created_at":"2026-05-17T23:56:55Z"},{"alias_kind":"pith_short_12","alias_value":"CSWDW4WNIGU2","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CSWDW4WNIGU2KR33","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CSWDW4WN","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:da12ff51cfb76cbda7999769b525625b432605fe02d2f5d4a2dd2764c59243fd","target":"graph","created_at":"2026-05-17T23:56:55Z","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":"Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two edge disjoint cycles sharing three or more vertices. To this end, we discuss the interplay of three binary graph operators leading to novel constructive characterizations of two subclasses of Eulerian graphs. This enables us to present a polynomial-time algorithm which decides whether the number of cycles in a cycle decomposition of a given Eulerian graph is un","authors_text":"Irene Heinrich, Manuel Streicher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-30T07:08:14Z","title":"Cycle Decompositions and Constructive Characterizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09141","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:aeae7ce802218d36392903c04369bdc00344cfbc196ecdddc722e64628515306","target":"record","created_at":"2026-05-17T23:56:55Z","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":"25543bd7adc97e1cf93be4ee060e243b5730c569d7b58a76d39e0d72e69f2ef7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-30T07:08:14Z","title_canon_sha256":"934d7795823bf46e0612ee76c86c4ef584ec18760cbc6e2841fc6194c27f0dab"},"schema_version":"1.0","source":{"id":"1708.09141","kind":"arxiv","version":2}},"canonical_sha256":"14ac3b72cd41a9a5477b6b39ca8dd8c5d94b86d43077a1b223641843a3327d2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14ac3b72cd41a9a5477b6b39ca8dd8c5d94b86d43077a1b223641843a3327d2b","first_computed_at":"2026-05-17T23:56:55.832176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:55.832176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"maWCnJkXX5lF4U/4KQwpMYd94U/vfcI3HSiaKor3KfNHbcYUz3Jwq0Ugk+Ui5E81yfmeWG4h5y3wSQUc9W4+BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:55.832692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09141","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aeae7ce802218d36392903c04369bdc00344cfbc196ecdddc722e64628515306","sha256:da12ff51cfb76cbda7999769b525625b432605fe02d2f5d4a2dd2764c59243fd"],"state_sha256":"1fe94e67f3c2175bd9608e16635c62e3612656eb72012249a696c849519983fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x+3ym1l3QlCVMpZnVLtIeoihRQboilO7cWjlWYMtpq9SBe5q/KCBY2h0HEGjlJU8k4IwRv9UnXNLyXtBkn6yDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T03:21:18.460850Z","bundle_sha256":"47070d97f13b82f9ab29f834e5017834c8eef29913363c9d6c1337eb08269d2c"}}