{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:LL5YNEME3K4VIHVLIMOJWNS64E","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":"0bfdb8b48035c4a5c2e822a54afd60dfad984421e4f1c8d70f99c93187c0b505","cross_cats_sorted":["cs.DM","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-12T22:11:21Z","title_canon_sha256":"d40626f141907cb5ae2601a9680d4981112c9bb1b67c7197ae442d95d2e371db"},"schema_version":"1.0","source":{"id":"1209.2744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2744","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2744v1","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2744","created_at":"2026-05-18T01:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"LL5YNEME3K4V","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"LL5YNEME3K4VIHVL","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"LL5YNEME","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:ac915ef1147c057c8bfaa7cac825be7396d23f48f79befc4ac0904c2683cc560","target":"graph","created_at":"2026-05-18T01:46:14Z","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 classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut conditions are satisfied. Simple examples show that a similar theorem is impossible in the node-capacitated setting. Nevertheless, we prove that an approximate flow/cut theorem does hold: For some universal c > 0, if the node cut conditions are satisfied, then one can simultaneously route a c-fraction of all the demands. This answers an open question of Chekuri and K","authors_text":"James R. Lee, Manor Mendel, Mohammad Moharrami","cross_cats":["cs.DM","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-12T22:11:21Z","title":"A node-capacitated Okamura-Seymour theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2744","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:f496b0014f3e1ac2345c62be0d6b5086d83116c7a5ed8fea257c867d2c7197f9","target":"record","created_at":"2026-05-18T01:46:14Z","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":"0bfdb8b48035c4a5c2e822a54afd60dfad984421e4f1c8d70f99c93187c0b505","cross_cats_sorted":["cs.DM","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-09-12T22:11:21Z","title_canon_sha256":"d40626f141907cb5ae2601a9680d4981112c9bb1b67c7197ae442d95d2e371db"},"schema_version":"1.0","source":{"id":"1209.2744","kind":"arxiv","version":1}},"canonical_sha256":"5afb869184dab9541eab431c9b365ee13389a23711949c1dbc964634b247d74f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5afb869184dab9541eab431c9b365ee13389a23711949c1dbc964634b247d74f","first_computed_at":"2026-05-18T01:46:14.469152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:46:14.469152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c50sXzE8/w0aE7nVd4dMbKCgDAn+sIIrJrR63/BoJKEFVEeaR6xw1UNfpj9f7O9OiFhhTdo96LFiGb29JRekAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:46:14.469630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.2744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f496b0014f3e1ac2345c62be0d6b5086d83116c7a5ed8fea257c867d2c7197f9","sha256:ac915ef1147c057c8bfaa7cac825be7396d23f48f79befc4ac0904c2683cc560"],"state_sha256":"37d8e6f6c9bb389d8aa41ef6266b3805bd37df62519afa546729c8aebdded6dc"}