{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:7DD5FF5WJ6RZJ4CI37YORV3WH3","short_pith_number":"pith:7DD5FF5W","canonical_record":{"source":{"id":"0908.1423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-11T00:33:22Z","cross_cats_sorted":[],"title_canon_sha256":"5c8050ef0ba816da9b4face1b0142462921102aa15c67c2148bc780ab4f3ec16","abstract_canon_sha256":"5a08cda4d402121223e721164de6ed25395fcc8d5939e6294abacb868229f53a"},"schema_version":"1.0"},"canonical_sha256":"f8c7d297b64fa394f048dff0e8d7763ec55da438d7cdf1c7277c8a8d95752c1c","source":{"kind":"arxiv","id":"0908.1423","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1423","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1423v1","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1423","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"7DD5FF5WJ6RZ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7DD5FF5WJ6RZJ4CI","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7DD5FF5W","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:7DD5FF5WJ6RZJ4CI37YORV3WH3","target":"record","payload":{"canonical_record":{"source":{"id":"0908.1423","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-11T00:33:22Z","cross_cats_sorted":[],"title_canon_sha256":"5c8050ef0ba816da9b4face1b0142462921102aa15c67c2148bc780ab4f3ec16","abstract_canon_sha256":"5a08cda4d402121223e721164de6ed25395fcc8d5939e6294abacb868229f53a"},"schema_version":"1.0"},"canonical_sha256":"f8c7d297b64fa394f048dff0e8d7763ec55da438d7cdf1c7277c8a8d95752c1c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:42.313718Z","signature_b64":"bcXoSleKKKa6vvITbfh4bCyC69cRSlChSo4+mlEMZ4bROk5kPMlc2aLxznmm0uCUfvnxa3IOTYzkNsUrrwa/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8c7d297b64fa394f048dff0e8d7763ec55da438d7cdf1c7277c8a8d95752c1c","last_reissued_at":"2026-05-18T00:40:42.312857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:42.312857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.1423","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aHMZ0EEovExpboYtGqGfxN+XnKvnC4cCxj5ww7mSlzCTqk5yZcQ125ovdHCziU99Q/WK5jLRsQ66cvROdORrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:19:22.198079Z"},"content_sha256":"08c80fe5663bc2af7b1e0e6d139aeff6e9e8d773a746b8096c0b0f92f9688442","schema_version":"1.0","event_id":"sha256:08c80fe5663bc2af7b1e0e6d139aeff6e9e8d773a746b8096c0b0f92f9688442"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:7DD5FF5WJ6RZJ4CI37YORV3WH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Short Cycle Covers of Cubic Graphs and Graphs with Minimum Degree Three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidicky, Daniel Kral, Pavel Nejedly, Robert Samal, Tomas Kaiser","submitted_at":"2009-08-11T00:33:22Z","abstract_excerpt":"The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with $m$ edges can be covered by cycles of total length at most $7m/5=1.400m$. We show that every cubic bridgeless graph has a cycle cover of total length at most $34m/21\\approx 1.619m$ and every bridgeless graph with minimum degree three has a cycle cover of total length at most $44m/27\\approx 1.630m$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1423","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWCkDkFhZFMUW/u+uiDG9NKkxPn8Qt7R/r0TdU2Tt6GVZ5vbo01IR1GgrFNfP+ePVk9+7CEcpIM+QIsTeI3oDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:19:22.198840Z"},"content_sha256":"76cd728b5f0a1e8e989ad2f42445c268ad5e1458ae1fb1520f1bb64670e41849","schema_version":"1.0","event_id":"sha256:76cd728b5f0a1e8e989ad2f42445c268ad5e1458ae1fb1520f1bb64670e41849"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DD5FF5WJ6RZJ4CI37YORV3WH3/bundle.json","state_url":"https://pith.science/pith/7DD5FF5WJ6RZJ4CI37YORV3WH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DD5FF5WJ6RZJ4CI37YORV3WH3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T13:19:22Z","links":{"resolver":"https://pith.science/pith/7DD5FF5WJ6RZJ4CI37YORV3WH3","bundle":"https://pith.science/pith/7DD5FF5WJ6RZJ4CI37YORV3WH3/bundle.json","state":"https://pith.science/pith/7DD5FF5WJ6RZJ4CI37YORV3WH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DD5FF5WJ6RZJ4CI37YORV3WH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:7DD5FF5WJ6RZJ4CI37YORV3WH3","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":"5a08cda4d402121223e721164de6ed25395fcc8d5939e6294abacb868229f53a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-11T00:33:22Z","title_canon_sha256":"5c8050ef0ba816da9b4face1b0142462921102aa15c67c2148bc780ab4f3ec16"},"schema_version":"1.0","source":{"id":"0908.1423","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.1423","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"arxiv_version","alias_value":"0908.1423v1","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.1423","created_at":"2026-05-18T00:40:42Z"},{"alias_kind":"pith_short_12","alias_value":"7DD5FF5WJ6RZ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7DD5FF5WJ6RZJ4CI","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7DD5FF5W","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:76cd728b5f0a1e8e989ad2f42445c268ad5e1458ae1fb1520f1bb64670e41849","target":"graph","created_at":"2026-05-18T00:40:42Z","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 Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with $m$ edges can be covered by cycles of total length at most $7m/5=1.400m$. We show that every cubic bridgeless graph has a cycle cover of total length at most $34m/21\\approx 1.619m$ and every bridgeless graph with minimum degree three has a cycle cover of total length at most $44m/27\\approx 1.630m$.","authors_text":"Bernard Lidicky, Daniel Kral, Pavel Nejedly, Robert Samal, Tomas Kaiser","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-11T00:33:22Z","title":"Short Cycle Covers of Cubic Graphs and Graphs with Minimum Degree Three"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.1423","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:08c80fe5663bc2af7b1e0e6d139aeff6e9e8d773a746b8096c0b0f92f9688442","target":"record","created_at":"2026-05-18T00:40:42Z","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":"5a08cda4d402121223e721164de6ed25395fcc8d5939e6294abacb868229f53a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-11T00:33:22Z","title_canon_sha256":"5c8050ef0ba816da9b4face1b0142462921102aa15c67c2148bc780ab4f3ec16"},"schema_version":"1.0","source":{"id":"0908.1423","kind":"arxiv","version":1}},"canonical_sha256":"f8c7d297b64fa394f048dff0e8d7763ec55da438d7cdf1c7277c8a8d95752c1c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8c7d297b64fa394f048dff0e8d7763ec55da438d7cdf1c7277c8a8d95752c1c","first_computed_at":"2026-05-18T00:40:42.312857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:42.312857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bcXoSleKKKa6vvITbfh4bCyC69cRSlChSo4+mlEMZ4bROk5kPMlc2aLxznmm0uCUfvnxa3IOTYzkNsUrrwa/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:42.313718Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.1423","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08c80fe5663bc2af7b1e0e6d139aeff6e9e8d773a746b8096c0b0f92f9688442","sha256:76cd728b5f0a1e8e989ad2f42445c268ad5e1458ae1fb1520f1bb64670e41849"],"state_sha256":"99121b64f981702b42f2337f2198596d3540a5010402380ac246789dd2b3a2cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmFbM7db6M2bGHRyRFmHajcWnt1lLhJKVSwqVdKabFLuje4AtQPKfwyx51gI4jFx2NJdQIxjnf6P/0N5PTl3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:19:22.202751Z","bundle_sha256":"61ba0c129a04071b686d05a547b026043c601d150bb1089cc1515db73221ba68"}}