{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FHBLACHREDY6Y4A2G7EOSNZ3V4","short_pith_number":"pith:FHBLACHR","schema_version":"1.0","canonical_sha256":"29c2b008f120f1ec701a37c8e9373baf27bfb3e2c5433e38ac047252a3089145","source":{"kind":"arxiv","id":"1609.05059","version":2},"attestation_state":"computed","paper":{"title":"Decomposing planar cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur Hoffmann-Ostenhof, Kenta Ozeki, Tom\\'a\\v{s} Kaiser","submitted_at":"2016-09-16T14:02:50Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1609.05059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-16T14:02:50Z","cross_cats_sorted":[],"title_canon_sha256":"4c995d337c338517dcdb309d99748cf018acf095f7aa190ddfa3add5030d78b4","abstract_canon_sha256":"d3cef709f882f821913d4951c52178ac3baa7bc18e50d0d2bae13468eee7b627"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:51.898063Z","signature_b64":"74AnL7lXKMpJEecVvZ3w2WTy/2Fw/lI7R1NQzccHCNcfo+8vn/StFt6gKzfh5r33LpyeShsdsXqQZ38J7TRrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29c2b008f120f1ec701a37c8e9373baf27bfb3e2c5433e38ac047252a3089145","last_reissued_at":"2026-05-18T00:31:51.897424Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:51.897424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing planar cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Arthur Hoffmann-Ostenhof, Kenta Ozeki, Tom\\'a\\v{s} Kaiser","submitted_at":"2016-09-16T14:02:50Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05059","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.05059","created_at":"2026-05-18T00:31:51.897521+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05059v2","created_at":"2026-05-18T00:31:51.897521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05059","created_at":"2026-05-18T00:31:51.897521+00:00"},{"alias_kind":"pith_short_12","alias_value":"FHBLACHREDY6","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FHBLACHREDY6Y4A2","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FHBLACHR","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FHBLACHREDY6Y4A2G7EOSNZ3V4","json":"https://pith.science/pith/FHBLACHREDY6Y4A2G7EOSNZ3V4.json","graph_json":"https://pith.science/api/pith-number/FHBLACHREDY6Y4A2G7EOSNZ3V4/graph.json","events_json":"https://pith.science/api/pith-number/FHBLACHREDY6Y4A2G7EOSNZ3V4/events.json","paper":"https://pith.science/paper/FHBLACHR"},"agent_actions":{"view_html":"https://pith.science/pith/FHBLACHREDY6Y4A2G7EOSNZ3V4","download_json":"https://pith.science/pith/FHBLACHREDY6Y4A2G7EOSNZ3V4.json","view_paper":"https://pith.science/paper/FHBLACHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05059&json=true","fetch_graph":"https://pith.science/api/pith-number/FHBLACHREDY6Y4A2G7EOSNZ3V4/graph.json","fetch_events":"https://pith.science/api/pith-number/FHBLACHREDY6Y4A2G7EOSNZ3V4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FHBLACHREDY6Y4A2G7EOSNZ3V4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FHBLACHREDY6Y4A2G7EOSNZ3V4/action/storage_attestation","attest_author":"https://pith.science/pith/FHBLACHREDY6Y4A2G7EOSNZ3V4/action/author_attestation","sign_citation":"https://pith.science/pith/FHBLACHREDY6Y4A2G7EOSNZ3V4/action/citation_signature","submit_replication":"https://pith.science/pith/FHBLACHREDY6Y4A2G7EOSNZ3V4/action/replication_record"}},"created_at":"2026-05-18T00:31:51.897521+00:00","updated_at":"2026-05-18T00:31:51.897521+00:00"}