{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:LHJSVINQ6K4JKYS2US5HRIC4B4","short_pith_number":"pith:LHJSVINQ","canonical_record":{"source":{"id":"math/0607077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-07-04T09:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"0aced9454fce92142e70e23c99620548cacfda573b756449660b0004af9e80f0","abstract_canon_sha256":"6973963dcda923438034d105d57bd3ae340a53aeb08dd9feb6185530d67851c9"},"schema_version":"1.0"},"canonical_sha256":"59d32aa1b0f2b895625aa4ba78a05c0f23fdf7132d481f9a6e2a91f4a7f8ee5a","source":{"kind":"arxiv","id":"math/0607077","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0607077","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"math/0607077v2","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0607077","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"LHJSVINQ6K4J","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"LHJSVINQ6K4JKYS2","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"LHJSVINQ","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:LHJSVINQ6K4JKYS2US5HRIC4B4","target":"record","payload":{"canonical_record":{"source":{"id":"math/0607077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-07-04T09:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"0aced9454fce92142e70e23c99620548cacfda573b756449660b0004af9e80f0","abstract_canon_sha256":"6973963dcda923438034d105d57bd3ae340a53aeb08dd9feb6185530d67851c9"},"schema_version":"1.0"},"canonical_sha256":"59d32aa1b0f2b895625aa4ba78a05c0f23fdf7132d481f9a6e2a91f4a7f8ee5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:11.042736Z","signature_b64":"EY233VNy4uDMFUK7aDr4luxDjSoNSZo1PiriQxEUH52oP1cZZ2FG8JupN5TifXJS585drXvAy86Wnk667S/3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d32aa1b0f2b895625aa4ba78a05c0f23fdf7132d481f9a6e2a91f4a7f8ee5a","last_reissued_at":"2026-05-18T03:45:11.041964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:11.041964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0607077","source_version":2,"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-18T03:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGCmDB0AgCsAxGYfhcYD+oWgD1MoGkIB/UuUbS1la3pTnRK7pdruICBCWT/tYkrJarMjanm4y3QOLs7+mqPUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:52:55.249769Z"},"content_sha256":"95613628f9f428a843be0ea9601ad0363fa8d29b01a2d8d31d045d789b91bcf1","schema_version":"1.0","event_id":"sha256:95613628f9f428a843be0ea9601ad0363fa8d29b01a2d8d31d045d789b91bcf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:LHJSVINQ6K4JKYS2US5HRIC4B4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tutte's 5-Flow Conjecture for Highly Cyclically Connected Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eckhard Steffen","submitted_at":"2006-07-04T09:27:21Z","abstract_excerpt":"In 1954, Tutte conjectured that every bridgeless graph has a nowhere-zero 5-flow. Let $\\omega$ be the minimum number of odd cycles in a 2-factor of a bridgeless cubic graph. Tutte's conjecture is equivalent to its restriction to cubic graphs with $\\omega \\geq 2$. We show that if a cubic graph $G$ has no edge cut with fewer than $ {5/2} \\omega - 1$ edges that separates two odd cycles of a minimum 2-factor of $G$, then $G$ has a nowhere-zero 5-flow. This implies that if a cubic graph $G$ is cyclically $n$-edge connected and $n \\geq {5/2} \\omega - 1$, then $G$ has a nowhere-zero 5-flow."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0607077","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"},"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-18T03:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KndQlByHvhRfn/3jcqXdZ7r6Xy9EnoeR8eXlvdD9cAcQ3n6igyykteJtKDLEVQ+VS3rlCPGmz946C1maU6iTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:52:55.250118Z"},"content_sha256":"c05680614f6aab457098e4bc5cb6866cc8ce7976bf0c8e734301ebbdc3aa2dc4","schema_version":"1.0","event_id":"sha256:c05680614f6aab457098e4bc5cb6866cc8ce7976bf0c8e734301ebbdc3aa2dc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHJSVINQ6K4JKYS2US5HRIC4B4/bundle.json","state_url":"https://pith.science/pith/LHJSVINQ6K4JKYS2US5HRIC4B4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHJSVINQ6K4JKYS2US5HRIC4B4/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-06-22T22:52:55Z","links":{"resolver":"https://pith.science/pith/LHJSVINQ6K4JKYS2US5HRIC4B4","bundle":"https://pith.science/pith/LHJSVINQ6K4JKYS2US5HRIC4B4/bundle.json","state":"https://pith.science/pith/LHJSVINQ6K4JKYS2US5HRIC4B4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHJSVINQ6K4JKYS2US5HRIC4B4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:LHJSVINQ6K4JKYS2US5HRIC4B4","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":"6973963dcda923438034d105d57bd3ae340a53aeb08dd9feb6185530d67851c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-07-04T09:27:21Z","title_canon_sha256":"0aced9454fce92142e70e23c99620548cacfda573b756449660b0004af9e80f0"},"schema_version":"1.0","source":{"id":"math/0607077","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0607077","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"math/0607077v2","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0607077","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"LHJSVINQ6K4J","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"LHJSVINQ6K4JKYS2","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"LHJSVINQ","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:c05680614f6aab457098e4bc5cb6866cc8ce7976bf0c8e734301ebbdc3aa2dc4","target":"graph","created_at":"2026-05-18T03:45:11Z","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":"In 1954, Tutte conjectured that every bridgeless graph has a nowhere-zero 5-flow. Let $\\omega$ be the minimum number of odd cycles in a 2-factor of a bridgeless cubic graph. Tutte's conjecture is equivalent to its restriction to cubic graphs with $\\omega \\geq 2$. We show that if a cubic graph $G$ has no edge cut with fewer than $ {5/2} \\omega - 1$ edges that separates two odd cycles of a minimum 2-factor of $G$, then $G$ has a nowhere-zero 5-flow. This implies that if a cubic graph $G$ is cyclically $n$-edge connected and $n \\geq {5/2} \\omega - 1$, then $G$ has a nowhere-zero 5-flow.","authors_text":"Eckhard Steffen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-07-04T09:27:21Z","title":"Tutte's 5-Flow Conjecture for Highly Cyclically Connected Cubic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0607077","kind":"arxiv","version":2},"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:95613628f9f428a843be0ea9601ad0363fa8d29b01a2d8d31d045d789b91bcf1","target":"record","created_at":"2026-05-18T03:45:11Z","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":"6973963dcda923438034d105d57bd3ae340a53aeb08dd9feb6185530d67851c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2006-07-04T09:27:21Z","title_canon_sha256":"0aced9454fce92142e70e23c99620548cacfda573b756449660b0004af9e80f0"},"schema_version":"1.0","source":{"id":"math/0607077","kind":"arxiv","version":2}},"canonical_sha256":"59d32aa1b0f2b895625aa4ba78a05c0f23fdf7132d481f9a6e2a91f4a7f8ee5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59d32aa1b0f2b895625aa4ba78a05c0f23fdf7132d481f9a6e2a91f4a7f8ee5a","first_computed_at":"2026-05-18T03:45:11.041964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:11.041964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EY233VNy4uDMFUK7aDr4luxDjSoNSZo1PiriQxEUH52oP1cZZ2FG8JupN5TifXJS585drXvAy86Wnk667S/3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:11.042736Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0607077","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95613628f9f428a843be0ea9601ad0363fa8d29b01a2d8d31d045d789b91bcf1","sha256:c05680614f6aab457098e4bc5cb6866cc8ce7976bf0c8e734301ebbdc3aa2dc4"],"state_sha256":"ed7e63b0c1bbc4e359ed366d90e318bf1467251c0f0d6560cd06c8f0970836e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FTgBA+sQlron53+wrPFEn3YE1eEjOV1ZNBsMk9QRVmOfBoNKiMYs3Abpmxo95Ed5pb8h3XX4VZ6YlF4q6j0fAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:52:55.252087Z","bundle_sha256":"c434aa6eec473676c9c427945683d81dc0d76d1fb8ea89d6e3c5bf8577a253ec"}}