{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MBWZBGCSGNJMTCUVPMYFHOIZJB","short_pith_number":"pith:MBWZBGCS","canonical_record":{"source":{"id":"1703.07964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-23T08:37:54Z","cross_cats_sorted":[],"title_canon_sha256":"32f633e5f12fc66ddc7b8379609347d9e9e2a0fb76d7f25573dc084cb0679361","abstract_canon_sha256":"66b14e47fdd9767befc77ce766db91acdd4950e3e19963968c35c161a9b16c04"},"schema_version":"1.0"},"canonical_sha256":"606d9098523352c98a957b3053b91948612d579eb7d6cff82dcd270e62c17f08","source":{"kind":"arxiv","id":"1703.07964","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07964","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07964v1","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07964","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"MBWZBGCSGNJM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MBWZBGCSGNJMTCUV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MBWZBGCS","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MBWZBGCSGNJMTCUVPMYFHOIZJB","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-23T08:37:54Z","cross_cats_sorted":[],"title_canon_sha256":"32f633e5f12fc66ddc7b8379609347d9e9e2a0fb76d7f25573dc084cb0679361","abstract_canon_sha256":"66b14e47fdd9767befc77ce766db91acdd4950e3e19963968c35c161a9b16c04"},"schema_version":"1.0"},"canonical_sha256":"606d9098523352c98a957b3053b91948612d579eb7d6cff82dcd270e62c17f08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:04.282031Z","signature_b64":"muvPr8m97BwapbivffHipgwIfv8/JZ+efVKoM2FaOnEcRhs08uDEEJmKhzpu1lla0o47mWKNG4OfOBqFbNoqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"606d9098523352c98a957b3053b91948612d579eb7d6cff82dcd270e62c17f08","last_reissued_at":"2026-05-18T00:48:04.281437Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:04.281437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07964","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-18T00:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHSRvfHne5NEMZrn1Ohz0KeExGzG6onRnp+YexCydnZT8fobnTD+PF/0oHBVQHpas9Vfw5ccJC4PSzldzdV+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:12:15.943975Z"},"content_sha256":"d06a9c85870e2a8d41f111a20730fcaacec1fd7d71583c5803414e72ee84c520","schema_version":"1.0","event_id":"sha256:d06a9c85870e2a8d41f111a20730fcaacec1fd7d71583c5803414e72ee84c520"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MBWZBGCSGNJMTCUVPMYFHOIZJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hsueh-I Lu, Hung-Chun Liang","submitted_at":"2017-03-23T08:37:54Z","abstract_excerpt":"Let $G$ be an $n$-node simple directed planar graph with nonnegative edge weights. We study the fundamental problems of computing (1) a global cut of $G$ with minimum weight and (2) a~cycle of $G$ with minimum weight. The best previously known algorithm for the former problem, running in $O(n\\log^3 n)$ time, can be obtained from the algorithm of \\Lacki, Nussbaum, Sankowski, and Wulff-Nilsen for single-source all-sinks maximum flows. The best previously known result for the latter problem is the $O(n\\log^3 n)$-time algorithm of Wulff-Nilsen. By exploiting duality between the two problems in pla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07964","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-18T00:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d++ZJhaUnyOgsFL6/UCLXrugv4AuAFlJu9ptXg+JuQgfKkrl+QPNKQS9ckwGXL2JK5pODp2wcgh0kwCxlKBDBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T13:12:15.944331Z"},"content_sha256":"d39691602adeb1f2ad5ca49c0ce9f1f825090ce4c937dade73d447e128411445","schema_version":"1.0","event_id":"sha256:d39691602adeb1f2ad5ca49c0ce9f1f825090ce4c937dade73d447e128411445"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBWZBGCSGNJMTCUVPMYFHOIZJB/bundle.json","state_url":"https://pith.science/pith/MBWZBGCSGNJMTCUVPMYFHOIZJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBWZBGCSGNJMTCUVPMYFHOIZJB/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-07-03T13:12:15Z","links":{"resolver":"https://pith.science/pith/MBWZBGCSGNJMTCUVPMYFHOIZJB","bundle":"https://pith.science/pith/MBWZBGCSGNJMTCUVPMYFHOIZJB/bundle.json","state":"https://pith.science/pith/MBWZBGCSGNJMTCUVPMYFHOIZJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBWZBGCSGNJMTCUVPMYFHOIZJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MBWZBGCSGNJMTCUVPMYFHOIZJB","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":"66b14e47fdd9767befc77ce766db91acdd4950e3e19963968c35c161a9b16c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-23T08:37:54Z","title_canon_sha256":"32f633e5f12fc66ddc7b8379609347d9e9e2a0fb76d7f25573dc084cb0679361"},"schema_version":"1.0","source":{"id":"1703.07964","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07964","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07964v1","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07964","created_at":"2026-05-18T00:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"MBWZBGCSGNJM","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MBWZBGCSGNJMTCUV","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MBWZBGCS","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:d39691602adeb1f2ad5ca49c0ce9f1f825090ce4c937dade73d447e128411445","target":"graph","created_at":"2026-05-18T00:48:04Z","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":"Let $G$ be an $n$-node simple directed planar graph with nonnegative edge weights. We study the fundamental problems of computing (1) a global cut of $G$ with minimum weight and (2) a~cycle of $G$ with minimum weight. The best previously known algorithm for the former problem, running in $O(n\\log^3 n)$ time, can be obtained from the algorithm of \\Lacki, Nussbaum, Sankowski, and Wulff-Nilsen for single-source all-sinks maximum flows. The best previously known result for the latter problem is the $O(n\\log^3 n)$-time algorithm of Wulff-Nilsen. By exploiting duality between the two problems in pla","authors_text":"Hsueh-I Lu, Hung-Chun Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-23T08:37:54Z","title":"Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07964","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:d06a9c85870e2a8d41f111a20730fcaacec1fd7d71583c5803414e72ee84c520","target":"record","created_at":"2026-05-18T00:48:04Z","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":"66b14e47fdd9767befc77ce766db91acdd4950e3e19963968c35c161a9b16c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-23T08:37:54Z","title_canon_sha256":"32f633e5f12fc66ddc7b8379609347d9e9e2a0fb76d7f25573dc084cb0679361"},"schema_version":"1.0","source":{"id":"1703.07964","kind":"arxiv","version":1}},"canonical_sha256":"606d9098523352c98a957b3053b91948612d579eb7d6cff82dcd270e62c17f08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"606d9098523352c98a957b3053b91948612d579eb7d6cff82dcd270e62c17f08","first_computed_at":"2026-05-18T00:48:04.281437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:04.281437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"muvPr8m97BwapbivffHipgwIfv8/JZ+efVKoM2FaOnEcRhs08uDEEJmKhzpu1lla0o47mWKNG4OfOBqFbNoqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:04.282031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07964","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d06a9c85870e2a8d41f111a20730fcaacec1fd7d71583c5803414e72ee84c520","sha256:d39691602adeb1f2ad5ca49c0ce9f1f825090ce4c937dade73d447e128411445"],"state_sha256":"ee7df0a72dbae1565711cfbe427d6aa6fe7b3b4929bccf4820e964a09e41e054"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ag8fpkXHu2FnBNH6ORWJxe/uDJPziYFVE7dwkJJYjGJxCJstZAGyy44045qUfe28pnbhPEPsvtNUgi8A9/mwCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T13:12:15.946332Z","bundle_sha256":"dcadd7d71b4a61499c06f7634d1df467c6a899ae26f099927c6ff8c810a1afbb"}}