{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JOELPJYKRERSRX4DVPNSDWH3I6","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":"2396b47ece53f462f2dd8a5f542e8e3fa7d7ad3f906a7367ca11b072552265be","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-30T09:23:44Z","title_canon_sha256":"02ccaea0b88324a4105f74c47b9e0beb5de30403db19819975d88aa6a5ed7a2f"},"schema_version":"1.0","source":{"id":"1901.10718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.10718","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.10718v1","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10718","created_at":"2026-05-17T23:55:06Z"},{"alias_kind":"pith_short_12","alias_value":"JOELPJYKRERS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JOELPJYKRERSRX4D","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JOELPJYK","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:fd08fe1bbc1300b19c27f66c8215fe12850f153be539638afe4bc2c78f476600","target":"graph","created_at":"2026-05-17T23:55:06Z","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":"A cycle cover of a graph is a collection of cycles such that each edge of the graph is contained in at least one of the cycles. The length of a cycle cover is the sum of all cycle lengths in the cover. We prove that every bridgeless cubic graph with $m$ edges has a cycle cover of length at most $212/135 \\cdot m \\ (\\approx 1.570 m)$. Moreover, if the graph is cyclically $4$-edge-connected we obtain a cover of length at most $47/30 \\cdot m \\approx 1.567 m$.","authors_text":"Robert Luko\\v{t}ka","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-30T09:23:44Z","title":"Short cycle covers of cubic graphs and intersecting 5-circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10718","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:17fca6df9f2fbea20067455137628b1fd7e050b5ba7e4004fd3d886623818e3d","target":"record","created_at":"2026-05-17T23:55:06Z","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":"2396b47ece53f462f2dd8a5f542e8e3fa7d7ad3f906a7367ca11b072552265be","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-30T09:23:44Z","title_canon_sha256":"02ccaea0b88324a4105f74c47b9e0beb5de30403db19819975d88aa6a5ed7a2f"},"schema_version":"1.0","source":{"id":"1901.10718","kind":"arxiv","version":1}},"canonical_sha256":"4b88b7a70a892328df83abdb21d8fb4794c0c88c88830380f9950e19e0820a48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b88b7a70a892328df83abdb21d8fb4794c0c88c88830380f9950e19e0820a48","first_computed_at":"2026-05-17T23:55:06.197537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:06.197537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GgYr0HG3Ou36nrzwn63GM3Ff9znrU95Yk133GonB/ZlQ4vLBiWdEtQ5rBwgIPHwkkJHoUkz4aIbDXOMfkoiWCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:06.198204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.10718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17fca6df9f2fbea20067455137628b1fd7e050b5ba7e4004fd3d886623818e3d","sha256:fd08fe1bbc1300b19c27f66c8215fe12850f153be539638afe4bc2c78f476600"],"state_sha256":"09b282a4834bf721c6bc16d5c011a722e6117e8ddddbcb52b718edc414083d60"}