{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Z4ZD2RWNT65OSNNZTA5KOHJLRL","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":"3e23820bca96484bad5163462c7c5fb51d7adf2c34f8a5e44f8d1c3a911546c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-19T17:24:20Z","title_canon_sha256":"3ce02044e6ae934ea992b6292f53406683db11e54323a3c74a46642a5da8a6be"},"schema_version":"1.0","source":{"id":"1701.05516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05516","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05516v1","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05516","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"Z4ZD2RWNT65O","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z4ZD2RWNT65OSNNZ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z4ZD2RWN","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:a0c652b07a9dba7f993f9bbe553b7b54cf7923e4047594285ec43090eeda2403","target":"graph","created_at":"2026-05-18T00:52:29Z","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":"Substantial efforts have been made to compute or estimate the minimum number $c(G)$ of cycles needed to partition the edges of an Eulerian graph. We give an equivalent characterization of Eulerian graphs of treewidth $2$ and with maximum degree $4$. This characterization enables us to present a linear time algorithm for the computation of $c(G)$ for all $G$ in this class.","authors_text":"Irene Heinrich, Sven O. Krumke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-19T17:24:20Z","title":"Minimum Cycle Decomposition: A Constructive Characterization for Graphs of Treewidth Two with Node Degrees Two and Four"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05516","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:1836b07d17beeb0698ec6588750cdbe126b228f164392cb37dacda71451836b4","target":"record","created_at":"2026-05-18T00:52:29Z","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":"3e23820bca96484bad5163462c7c5fb51d7adf2c34f8a5e44f8d1c3a911546c4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-19T17:24:20Z","title_canon_sha256":"3ce02044e6ae934ea992b6292f53406683db11e54323a3c74a46642a5da8a6be"},"schema_version":"1.0","source":{"id":"1701.05516","kind":"arxiv","version":1}},"canonical_sha256":"cf323d46cd9fbae935b9983aa71d2b8ae37ecaf52bc2148ba90cd040c1d7f6a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf323d46cd9fbae935b9983aa71d2b8ae37ecaf52bc2148ba90cd040c1d7f6a5","first_computed_at":"2026-05-18T00:52:29.645130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:29.645130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VJe167WWIEvcwMDJwmO2XFV4vDJKcAW95Umy2hinJbHuu5CFNHz9LB5YZ3cv82dG7YUHfKLkXyaaqaxxfDSYAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:29.645638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1836b07d17beeb0698ec6588750cdbe126b228f164392cb37dacda71451836b4","sha256:a0c652b07a9dba7f993f9bbe553b7b54cf7923e4047594285ec43090eeda2403"],"state_sha256":"401b90a1223f3682d2a5d63fa4bedba8de6180fcd3256ce533ea40de26f47931"}