{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WBPYZRMV5YHXXKTK5IXZTQKR4Z","short_pith_number":"pith:WBPYZRMV","canonical_record":{"source":{"id":"2404.00324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-30T11:39:16Z","cross_cats_sorted":[],"title_canon_sha256":"879851c6beed12273912e85911d275f9345fe145d4a78761f02a75d7b5064478","abstract_canon_sha256":"062c1c4e097dab49ca6e3a4c735cf9bac9aef8793456f9b6a8a281073317bcce"},"schema_version":"1.0"},"canonical_sha256":"b05f8cc595ee0f7baa6aea2f99c151e645703013284398ad53bd83921e8b747e","source":{"kind":"arxiv","id":"2404.00324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.00324","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"2404.00324v1","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00324","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"WBPYZRMV5YHX","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"pith_short_16","alias_value":"WBPYZRMV5YHXXKTK","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"pith_short_8","alias_value":"WBPYZRMV","created_at":"2026-07-05T08:02:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WBPYZRMV5YHXXKTK5IXZTQKR4Z","target":"record","payload":{"canonical_record":{"source":{"id":"2404.00324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-30T11:39:16Z","cross_cats_sorted":[],"title_canon_sha256":"879851c6beed12273912e85911d275f9345fe145d4a78761f02a75d7b5064478","abstract_canon_sha256":"062c1c4e097dab49ca6e3a4c735cf9bac9aef8793456f9b6a8a281073317bcce"},"schema_version":"1.0"},"canonical_sha256":"b05f8cc595ee0f7baa6aea2f99c151e645703013284398ad53bd83921e8b747e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:02:31.578287Z","signature_b64":"RXMNXcfxOdFElfxs/yKeg9a3EenrANqEr9GtTVDfatQfCwWU03cy+O09YBOHEk273H1x1Md4cE4sSkmOq2v1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b05f8cc595ee0f7baa6aea2f99c151e645703013284398ad53bd83921e8b747e","last_reissued_at":"2026-07-05T08:02:31.577580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:02:31.577580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.00324","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-07-05T08:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fpu0go/CmMDkHbVTz3no1cZZSx4d8yxhr5NFiAnDAXp2HAVvbk29JNjvwD9o7CdYz0wgkCpySxk8yf8w4Vu1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:01:51.630900Z"},"content_sha256":"4e7da9fa6af726c1c810686379712fbe05435ac483db4b3624020be83b71b6e0","schema_version":"1.0","event_id":"sha256:4e7da9fa6af726c1c810686379712fbe05435ac483db4b3624020be83b71b6e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WBPYZRMV5YHXXKTK5IXZTQKR4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparsity of 3-flow critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sergey Norin, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2024-03-30T11:39:16Z","abstract_excerpt":"A connected graph G is 3-flow-critical if G does not have a nowhere-zero 3-flow, but every proper contraction of G does. We prove that every n-vertex 3-flow-critical graph other than K_2 and K_4 has at least 5n/3 edges. This bound is tight up to lower-order terms, answering a question of Li et al. (2022). It also generalizes the result of Koester (1991) on the maximum average degree of 4-critical planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00324","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.00324/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:02:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qkI0oCTUc4YQg1uCy05+K+ztEY7uOeovzI4iF2gMqY7pw+9jJu2Sm8Bf7aL3qH44kyduWDCwuKRS/E6hruoPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T03:01:51.631599Z"},"content_sha256":"40395ab132af33c7c52d19fd2e89a9e4c8a53aee35e14f4fccbe344d07bd1bc1","schema_version":"1.0","event_id":"sha256:40395ab132af33c7c52d19fd2e89a9e4c8a53aee35e14f4fccbe344d07bd1bc1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBPYZRMV5YHXXKTK5IXZTQKR4Z/bundle.json","state_url":"https://pith.science/pith/WBPYZRMV5YHXXKTK5IXZTQKR4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBPYZRMV5YHXXKTK5IXZTQKR4Z/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-08-14T03:01:51Z","links":{"resolver":"https://pith.science/pith/WBPYZRMV5YHXXKTK5IXZTQKR4Z","bundle":"https://pith.science/pith/WBPYZRMV5YHXXKTK5IXZTQKR4Z/bundle.json","state":"https://pith.science/pith/WBPYZRMV5YHXXKTK5IXZTQKR4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBPYZRMV5YHXXKTK5IXZTQKR4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WBPYZRMV5YHXXKTK5IXZTQKR4Z","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":"062c1c4e097dab49ca6e3a4c735cf9bac9aef8793456f9b6a8a281073317bcce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-30T11:39:16Z","title_canon_sha256":"879851c6beed12273912e85911d275f9345fe145d4a78761f02a75d7b5064478"},"schema_version":"1.0","source":{"id":"2404.00324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.00324","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"arxiv_version","alias_value":"2404.00324v1","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00324","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"pith_short_12","alias_value":"WBPYZRMV5YHX","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"pith_short_16","alias_value":"WBPYZRMV5YHXXKTK","created_at":"2026-07-05T08:02:31Z"},{"alias_kind":"pith_short_8","alias_value":"WBPYZRMV","created_at":"2026-07-05T08:02:31Z"}],"graph_snapshots":[{"event_id":"sha256:40395ab132af33c7c52d19fd2e89a9e4c8a53aee35e14f4fccbe344d07bd1bc1","target":"graph","created_at":"2026-07-05T08:02:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.00324/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A connected graph G is 3-flow-critical if G does not have a nowhere-zero 3-flow, but every proper contraction of G does. We prove that every n-vertex 3-flow-critical graph other than K_2 and K_4 has at least 5n/3 edges. This bound is tight up to lower-order terms, answering a question of Li et al. (2022). It also generalizes the result of Koester (1991) on the maximum average degree of 4-critical planar graphs.","authors_text":"Sergey Norin, Zden\\v{e}k Dvo\\v{r}\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-30T11:39:16Z","title":"Sparsity of 3-flow critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00324","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:4e7da9fa6af726c1c810686379712fbe05435ac483db4b3624020be83b71b6e0","target":"record","created_at":"2026-07-05T08:02:31Z","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":"062c1c4e097dab49ca6e3a4c735cf9bac9aef8793456f9b6a8a281073317bcce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-30T11:39:16Z","title_canon_sha256":"879851c6beed12273912e85911d275f9345fe145d4a78761f02a75d7b5064478"},"schema_version":"1.0","source":{"id":"2404.00324","kind":"arxiv","version":1}},"canonical_sha256":"b05f8cc595ee0f7baa6aea2f99c151e645703013284398ad53bd83921e8b747e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b05f8cc595ee0f7baa6aea2f99c151e645703013284398ad53bd83921e8b747e","first_computed_at":"2026-07-05T08:02:31.577580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:02:31.577580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RXMNXcfxOdFElfxs/yKeg9a3EenrANqEr9GtTVDfatQfCwWU03cy+O09YBOHEk273H1x1Md4cE4sSkmOq2v1AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:02:31.578287Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.00324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e7da9fa6af726c1c810686379712fbe05435ac483db4b3624020be83b71b6e0","sha256:40395ab132af33c7c52d19fd2e89a9e4c8a53aee35e14f4fccbe344d07bd1bc1"],"state_sha256":"972d55995bf6631b635863bb51d91b1ff5c0c68106ef8ec85e1b908222939180"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYgorjs8REYwIkzsihTS2P19C0EGF4gouy8KccZg7X8LzGBml+xY5j9W7fszUgljmkXe0nKkDko2BYQhTOmuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T03:01:51.638130Z","bundle_sha256":"7f792667eb56c1827f1dc98c43e28adf44adcd1d7b1375a6b7f84c2604c47503"}}