{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FHBLACHREDY6Y4A2G7EOSNZ3V4","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":"d3cef709f882f821913d4951c52178ac3baa7bc18e50d0d2bae13468eee7b627","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-16T14:02:50Z","title_canon_sha256":"4c995d337c338517dcdb309d99748cf018acf095f7aa190ddfa3add5030d78b4"},"schema_version":"1.0","source":{"id":"1609.05059","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05059","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05059v2","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05059","created_at":"2026-05-18T00:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"FHBLACHREDY6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FHBLACHREDY6Y4A2","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FHBLACHR","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:3e3371628c6fdec53bf5215c857ba3f225ad6f0c8fc06b8a48921bc5b483dec9","target":"graph","created_at":"2026-05-18T00:31:51Z","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":"The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.","authors_text":"Arthur Hoffmann-Ostenhof, Kenta Ozeki, Tom\\'a\\v{s} Kaiser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-16T14:02:50Z","title":"Decomposing planar cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05059","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:943177e31318176c9ea2edceea6867122f7f06296c14dea549b3edfd8cf349e7","target":"record","created_at":"2026-05-18T00:31:51Z","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":"d3cef709f882f821913d4951c52178ac3baa7bc18e50d0d2bae13468eee7b627","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-16T14:02:50Z","title_canon_sha256":"4c995d337c338517dcdb309d99748cf018acf095f7aa190ddfa3add5030d78b4"},"schema_version":"1.0","source":{"id":"1609.05059","kind":"arxiv","version":2}},"canonical_sha256":"29c2b008f120f1ec701a37c8e9373baf27bfb3e2c5433e38ac047252a3089145","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29c2b008f120f1ec701a37c8e9373baf27bfb3e2c5433e38ac047252a3089145","first_computed_at":"2026-05-18T00:31:51.897424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:51.897424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"74AnL7lXKMpJEecVvZ3w2WTy/2Fw/lI7R1NQzccHCNcfo+8vn/StFt6gKzfh5r33LpyeShsdsXqQZ38J7TRrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:51.898063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05059","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:943177e31318176c9ea2edceea6867122f7f06296c14dea549b3edfd8cf349e7","sha256:3e3371628c6fdec53bf5215c857ba3f225ad6f0c8fc06b8a48921bc5b483dec9"],"state_sha256":"b579afb4af135da0c0898f0b40b59e84a77177de9a2cf834ff1060ec2e9047ad"}