{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JOELPJYKRERSRX4DVPNSDWH3I6","short_pith_number":"pith:JOELPJYK","schema_version":"1.0","canonical_sha256":"4b88b7a70a892328df83abdb21d8fb4794c0c88c88830380f9950e19e0820a48","source":{"kind":"arxiv","id":"1901.10718","version":1},"attestation_state":"computed","paper":{"title":"Short cycle covers of cubic graphs and intersecting 5-circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Robert Luko\\v{t}ka","submitted_at":"2019-01-30T09:23:44Z","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$."},"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":"1901.10718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-30T09:23:44Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"02ccaea0b88324a4105f74c47b9e0beb5de30403db19819975d88aa6a5ed7a2f","abstract_canon_sha256":"2396b47ece53f462f2dd8a5f542e8e3fa7d7ad3f906a7367ca11b072552265be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:06.198204Z","signature_b64":"GgYr0HG3Ou36nrzwn63GM3Ff9znrU95Yk133GonB/ZlQ4vLBiWdEtQ5rBwgIPHwkkJHoUkz4aIbDXOMfkoiWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b88b7a70a892328df83abdb21d8fb4794c0c88c88830380f9950e19e0820a48","last_reissued_at":"2026-05-17T23:55:06.197537Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:06.197537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short cycle covers of cubic graphs and intersecting 5-circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Robert Luko\\v{t}ka","submitted_at":"2019-01-30T09:23:44Z","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$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10718","kind":"arxiv","version":1},"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":"1901.10718","created_at":"2026-05-17T23:55:06.197634+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10718v1","created_at":"2026-05-17T23:55:06.197634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10718","created_at":"2026-05-17T23:55:06.197634+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOELPJYKRERS","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOELPJYKRERSRX4D","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOELPJYK","created_at":"2026-05-18T12:33:21.387695+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/JOELPJYKRERSRX4DVPNSDWH3I6","json":"https://pith.science/pith/JOELPJYKRERSRX4DVPNSDWH3I6.json","graph_json":"https://pith.science/api/pith-number/JOELPJYKRERSRX4DVPNSDWH3I6/graph.json","events_json":"https://pith.science/api/pith-number/JOELPJYKRERSRX4DVPNSDWH3I6/events.json","paper":"https://pith.science/paper/JOELPJYK"},"agent_actions":{"view_html":"https://pith.science/pith/JOELPJYKRERSRX4DVPNSDWH3I6","download_json":"https://pith.science/pith/JOELPJYKRERSRX4DVPNSDWH3I6.json","view_paper":"https://pith.science/paper/JOELPJYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10718&json=true","fetch_graph":"https://pith.science/api/pith-number/JOELPJYKRERSRX4DVPNSDWH3I6/graph.json","fetch_events":"https://pith.science/api/pith-number/JOELPJYKRERSRX4DVPNSDWH3I6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOELPJYKRERSRX4DVPNSDWH3I6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOELPJYKRERSRX4DVPNSDWH3I6/action/storage_attestation","attest_author":"https://pith.science/pith/JOELPJYKRERSRX4DVPNSDWH3I6/action/author_attestation","sign_citation":"https://pith.science/pith/JOELPJYKRERSRX4DVPNSDWH3I6/action/citation_signature","submit_replication":"https://pith.science/pith/JOELPJYKRERSRX4DVPNSDWH3I6/action/replication_record"}},"created_at":"2026-05-17T23:55:06.197634+00:00","updated_at":"2026-05-17T23:55:06.197634+00:00"}