{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NQQTGC3475KVPCMTIR7G4H2ZOC","short_pith_number":"pith:NQQTGC34","canonical_record":{"source":{"id":"1211.2189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-09T17:02:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"329f93202333077361fda5d9d1d6930fc231ce2aad0bf6049c41110bed9cc289","abstract_canon_sha256":"4b7ea199a6f78df1c2a02cb752bed6cfeba96ecba124f90a3b054d55c3214f2a"},"schema_version":"1.0"},"canonical_sha256":"6c21330b7cff55578993447e6e1f597090529bd5f74dae99856fc84c876784c6","source":{"kind":"arxiv","id":"1211.2189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2189","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2189v1","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2189","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"NQQTGC3475KV","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NQQTGC3475KVPCMT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NQQTGC34","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NQQTGC3475KVPCMTIR7G4H2ZOC","target":"record","payload":{"canonical_record":{"source":{"id":"1211.2189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-09T17:02:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"329f93202333077361fda5d9d1d6930fc231ce2aad0bf6049c41110bed9cc289","abstract_canon_sha256":"4b7ea199a6f78df1c2a02cb752bed6cfeba96ecba124f90a3b054d55c3214f2a"},"schema_version":"1.0"},"canonical_sha256":"6c21330b7cff55578993447e6e1f597090529bd5f74dae99856fc84c876784c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:11.484455Z","signature_b64":"jSeI0/DMeNWqkm25Tj14LZob1yBwzyrhkiTqJf/m7L26+dTCwdVFNhQ9Bd1ZwTI1WvjmIDGFojGsBVrWHp/XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c21330b7cff55578993447e6e1f597090529bd5f74dae99856fc84c876784c6","last_reissued_at":"2026-05-18T03:41:11.483987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:11.483987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.2189","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-18T03:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kt7QLGVs7q3X5OfUMtl+WpnT9HB0TmMjz17/TJdVgFlOJUbFrT03q4mawp5kwoG48FfmmChbyvcObowIuIgUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:55:44.171279Z"},"content_sha256":"a2a80b8609c53226ce7df9b2dc97ddf86f68ce47a49d0c8ed126318533c520b6","schema_version":"1.0","event_id":"sha256:a2a80b8609c53226ce7df9b2dc97ddf86f68ce47a49d0c8ed126318533c520b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NQQTGC3475KVPCMTIR7G4H2ZOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattices and maximum flow algorithms in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Britta Peis, Jannik Matuschke","submitted_at":"2012-11-09T17:02:11Z","abstract_excerpt":"We show that the left/right relation on the set of s-t-paths of a plane graph induces a so-called submodular lattice. If the embedding of the graph is s-t-planar, this lattice is even consecutive. This implies that Ford and Fulkerson's uppermost path algorithm for maximum flow in such graphs is indeed a special case of a two-phase greedy algorithm on lattice polyhedra. We also show that the properties submodularity and consecutivity cannot be achieved simultaneously by any partial order on the paths if the graph is planar but not s-t-planar, thus providing a characterization of this class of g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2189","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-18T03:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZcZizMris6ymsbuXXdIVaDXPn43oxWUlQfetfOmX9KRtok8oxxVnyzQhq3EEOEHShLGsl4YbPuEk2BZp9m4XDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:55:44.171642Z"},"content_sha256":"47724a4e2e6311e3542ab18c7f1c51c226f195724e63dff3c28cc16b750f9289","schema_version":"1.0","event_id":"sha256:47724a4e2e6311e3542ab18c7f1c51c226f195724e63dff3c28cc16b750f9289"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQQTGC3475KVPCMTIR7G4H2ZOC/bundle.json","state_url":"https://pith.science/pith/NQQTGC3475KVPCMTIR7G4H2ZOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQQTGC3475KVPCMTIR7G4H2ZOC/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-03T03:55:44Z","links":{"resolver":"https://pith.science/pith/NQQTGC3475KVPCMTIR7G4H2ZOC","bundle":"https://pith.science/pith/NQQTGC3475KVPCMTIR7G4H2ZOC/bundle.json","state":"https://pith.science/pith/NQQTGC3475KVPCMTIR7G4H2ZOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQQTGC3475KVPCMTIR7G4H2ZOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NQQTGC3475KVPCMTIR7G4H2ZOC","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":"4b7ea199a6f78df1c2a02cb752bed6cfeba96ecba124f90a3b054d55c3214f2a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-09T17:02:11Z","title_canon_sha256":"329f93202333077361fda5d9d1d6930fc231ce2aad0bf6049c41110bed9cc289"},"schema_version":"1.0","source":{"id":"1211.2189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2189","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2189v1","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2189","created_at":"2026-05-18T03:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"NQQTGC3475KV","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NQQTGC3475KVPCMT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NQQTGC34","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:47724a4e2e6311e3542ab18c7f1c51c226f195724e63dff3c28cc16b750f9289","target":"graph","created_at":"2026-05-18T03:41: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":"We show that the left/right relation on the set of s-t-paths of a plane graph induces a so-called submodular lattice. If the embedding of the graph is s-t-planar, this lattice is even consecutive. This implies that Ford and Fulkerson's uppermost path algorithm for maximum flow in such graphs is indeed a special case of a two-phase greedy algorithm on lattice polyhedra. We also show that the properties submodularity and consecutivity cannot be achieved simultaneously by any partial order on the paths if the graph is planar but not s-t-planar, thus providing a characterization of this class of g","authors_text":"Britta Peis, Jannik Matuschke","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-09T17:02:11Z","title":"Lattices and maximum flow algorithms in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2189","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:a2a80b8609c53226ce7df9b2dc97ddf86f68ce47a49d0c8ed126318533c520b6","target":"record","created_at":"2026-05-18T03:41: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":"4b7ea199a6f78df1c2a02cb752bed6cfeba96ecba124f90a3b054d55c3214f2a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-11-09T17:02:11Z","title_canon_sha256":"329f93202333077361fda5d9d1d6930fc231ce2aad0bf6049c41110bed9cc289"},"schema_version":"1.0","source":{"id":"1211.2189","kind":"arxiv","version":1}},"canonical_sha256":"6c21330b7cff55578993447e6e1f597090529bd5f74dae99856fc84c876784c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c21330b7cff55578993447e6e1f597090529bd5f74dae99856fc84c876784c6","first_computed_at":"2026-05-18T03:41:11.483987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:11.483987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jSeI0/DMeNWqkm25Tj14LZob1yBwzyrhkiTqJf/m7L26+dTCwdVFNhQ9Bd1ZwTI1WvjmIDGFojGsBVrWHp/XBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:11.484455Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2a80b8609c53226ce7df9b2dc97ddf86f68ce47a49d0c8ed126318533c520b6","sha256:47724a4e2e6311e3542ab18c7f1c51c226f195724e63dff3c28cc16b750f9289"],"state_sha256":"b601d17ffe01a83205df789646e13438423090aed01465ec502d80ac7378f7dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkgUbnVURuRF+zYk3++Ae6uDsEboiv18VxcYgHZOA6QhownItiTD2JL51Sp/U9RbWSDnk0YlVjf+7FhJLCWNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:55:44.173565Z","bundle_sha256":"ad85552950ae4781f8c853b3d0bbbcca65fec979f40065f08cdfa3962cec24f6"}}