{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7AZYATABMIRVMBBIAA6PA4KEHA","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":"2f9d6b9890866740c877e18d41ab4d6ad372ac53fd27d42a6baf45455e078f3b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-16T17:05:58Z","title_canon_sha256":"9d30a0028c2cbd4c01c1772bbc20659b229bc3003f6ef7e0354aa8273895da1c"},"schema_version":"1.0","source":{"id":"1607.04768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04768","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04768v1","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04768","created_at":"2026-05-18T01:10:56Z"},{"alias_kind":"pith_short_12","alias_value":"7AZYATABMIRV","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7AZYATABMIRVMBBI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7AZYATAB","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:e175e67402e8c76844f1815919e327fb6855b60e6f79e0d9f1663e402339c3a2","target":"graph","created_at":"2026-05-18T01:10:56Z","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":"It was conjectured by Hoffmann-Ostenhof that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. In this paper, we show that this conjecture holds for traceable cubic graphs.","authors_text":"F. Abdolhosseini, H. Hashemi, M.S. Moradian, S. Akbari","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-16T17:05:58Z","title":"Hoffmann-Ostenhof's conjecture for traceable cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04768","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:dec9af423d6471d40322602f1f9c772eee8b4701d7e94adaa16af4f8d7bcbd99","target":"record","created_at":"2026-05-18T01:10:56Z","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":"2f9d6b9890866740c877e18d41ab4d6ad372ac53fd27d42a6baf45455e078f3b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-16T17:05:58Z","title_canon_sha256":"9d30a0028c2cbd4c01c1772bbc20659b229bc3003f6ef7e0354aa8273895da1c"},"schema_version":"1.0","source":{"id":"1607.04768","kind":"arxiv","version":1}},"canonical_sha256":"f833804c016223560428003cf071443824ee865df35cca070b453398d9199fcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f833804c016223560428003cf071443824ee865df35cca070b453398d9199fcc","first_computed_at":"2026-05-18T01:10:56.734976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:56.734976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AI7mzPCLRyjGnLsXmTvrWQUUGuc5R8Wek388VmUMMGFBJdfSeQR/ms2131xlj6yNP9GZUpva4KWvfzXstU2mCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:56.735587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dec9af423d6471d40322602f1f9c772eee8b4701d7e94adaa16af4f8d7bcbd99","sha256:e175e67402e8c76844f1815919e327fb6855b60e6f79e0d9f1663e402339c3a2"],"state_sha256":"f6609363bded37494cbadc2b68c835af3aaf85242284ae00c038e19e4f2e53cf"}