{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7QIL2UGN7UPCGNTUTVPZ533VEC","short_pith_number":"pith:7QIL2UGN","schema_version":"1.0","canonical_sha256":"fc10bd50cdfd1e2336749d5f9eef75208d7a8b02964e7ce8251c928696403fdd","source":{"kind":"arxiv","id":"1512.06214","version":1},"attestation_state":"computed","paper":{"title":"A new proof of Seymour's 6-flow theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edita Rollov\\'a, Matt DeVos, Robert \\v{S}\\'amal","submitted_at":"2015-12-19T09:28:31Z","abstract_excerpt":"Tutte's famous 5-flow conjecture asserts that every bridgeless graph has a nowhere-zero 5-flow. Seymour proved that every such graph has a nowhere-zero 6-flow. Here we give (two versions of) a new proof of Seymour's Theorem. Both are roughly equal to Seymour's in terms of complexity, but they offer an alternative perspective which we hope will be of value."},"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":"1512.06214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-19T09:28:31Z","cross_cats_sorted":[],"title_canon_sha256":"82ab4db60c3743d394288f0f0929eeb943b2ad0a6b2eb12726f67b9f9e05e23c","abstract_canon_sha256":"2db7d6a30f2bea6c57f23836d5fe780d54621d692074cfe04c4124c8d6fc449d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:04.817108Z","signature_b64":"otZIHGgB3e5cAN9rgQzZTeDm5oDQL3LrNjsv34k4oYTWRfSWETAPx8j/TshRJaZqCJOZYK/6ZnGRT+wyruC6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc10bd50cdfd1e2336749d5f9eef75208d7a8b02964e7ce8251c928696403fdd","last_reissued_at":"2026-05-18T01:24:04.816370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:04.816370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new proof of Seymour's 6-flow theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Edita Rollov\\'a, Matt DeVos, Robert \\v{S}\\'amal","submitted_at":"2015-12-19T09:28:31Z","abstract_excerpt":"Tutte's famous 5-flow conjecture asserts that every bridgeless graph has a nowhere-zero 5-flow. Seymour proved that every such graph has a nowhere-zero 6-flow. Here we give (two versions of) a new proof of Seymour's Theorem. Both are roughly equal to Seymour's in terms of complexity, but they offer an alternative perspective which we hope will be of value."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.06214","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":"1512.06214","created_at":"2026-05-18T01:24:04.816495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.06214v1","created_at":"2026-05-18T01:24:04.816495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.06214","created_at":"2026-05-18T01:24:04.816495+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QIL2UGN7UPC","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QIL2UGN7UPCGNTU","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QIL2UGN","created_at":"2026-05-18T12:29:10.953037+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/7QIL2UGN7UPCGNTUTVPZ533VEC","json":"https://pith.science/pith/7QIL2UGN7UPCGNTUTVPZ533VEC.json","graph_json":"https://pith.science/api/pith-number/7QIL2UGN7UPCGNTUTVPZ533VEC/graph.json","events_json":"https://pith.science/api/pith-number/7QIL2UGN7UPCGNTUTVPZ533VEC/events.json","paper":"https://pith.science/paper/7QIL2UGN"},"agent_actions":{"view_html":"https://pith.science/pith/7QIL2UGN7UPCGNTUTVPZ533VEC","download_json":"https://pith.science/pith/7QIL2UGN7UPCGNTUTVPZ533VEC.json","view_paper":"https://pith.science/paper/7QIL2UGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.06214&json=true","fetch_graph":"https://pith.science/api/pith-number/7QIL2UGN7UPCGNTUTVPZ533VEC/graph.json","fetch_events":"https://pith.science/api/pith-number/7QIL2UGN7UPCGNTUTVPZ533VEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QIL2UGN7UPCGNTUTVPZ533VEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QIL2UGN7UPCGNTUTVPZ533VEC/action/storage_attestation","attest_author":"https://pith.science/pith/7QIL2UGN7UPCGNTUTVPZ533VEC/action/author_attestation","sign_citation":"https://pith.science/pith/7QIL2UGN7UPCGNTUTVPZ533VEC/action/citation_signature","submit_replication":"https://pith.science/pith/7QIL2UGN7UPCGNTUTVPZ533VEC/action/replication_record"}},"created_at":"2026-05-18T01:24:04.816495+00:00","updated_at":"2026-05-18T01:24:04.816495+00:00"}