{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GSHNPEWLZTOMOUFRGUHHBIEUBC","short_pith_number":"pith:GSHNPEWL","canonical_record":{"source":{"id":"1702.04786","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-15T21:35:22Z","cross_cats_sorted":[],"title_canon_sha256":"0f76f0777f7620820974c9a92b52f1adaf9d18789e5f6b76893639ff1d681ecd","abstract_canon_sha256":"488723575c2c87fe57cddc74f93dfe1ca2942d18b280b567870093db972f899a"},"schema_version":"1.0"},"canonical_sha256":"348ed792cbccdcc750b1350e70a0940884023c98fa5e8196b5214438e607ffb9","source":{"kind":"arxiv","id":"1702.04786","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04786","created_at":"2026-05-18T00:16:38Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04786v4","created_at":"2026-05-18T00:16:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04786","created_at":"2026-05-18T00:16:38Z"},{"alias_kind":"pith_short_12","alias_value":"GSHNPEWLZTOM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSHNPEWLZTOMOUFR","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSHNPEWL","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GSHNPEWLZTOMOUFRGUHHBIEUBC","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04786","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-15T21:35:22Z","cross_cats_sorted":[],"title_canon_sha256":"0f76f0777f7620820974c9a92b52f1adaf9d18789e5f6b76893639ff1d681ecd","abstract_canon_sha256":"488723575c2c87fe57cddc74f93dfe1ca2942d18b280b567870093db972f899a"},"schema_version":"1.0"},"canonical_sha256":"348ed792cbccdcc750b1350e70a0940884023c98fa5e8196b5214438e607ffb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:38.988660Z","signature_b64":"Uyo9bRy1ItoSiULaozyADcG7pMYSLtJbO0zF/sOpmt73eXJJfo/Qdb/RqU1M6IKvp5H7KEwBSGkAYZCyTKmACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"348ed792cbccdcc750b1350e70a0940884023c98fa5e8196b5214438e607ffb9","last_reissued_at":"2026-05-18T00:16:38.987986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:38.987986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04786","source_version":4,"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:16:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gV4nanmPZvwnuB1HROrhi11z0P9OzW900sV8aDJcfMykvTOBuSPGmOAAm2FJJJlRxDucjLm3vzLGcXVfq6T+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:18:14.556876Z"},"content_sha256":"c7853f53a9043df73bbe47ece8eb74e00c22b0b3591e65328a87c821679ccc65","schema_version":"1.0","event_id":"sha256:c7853f53a9043df73bbe47ece8eb74e00c22b0b3591e65328a87c821679ccc65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GSHNPEWLZTOMOUFRGUHHBIEUBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding All Useless Arcs in Directed Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bundit Laekhanukit, Jittat Fakcharoenphol, Pattara Sukprasert","submitted_at":"2017-02-15T21:35:22Z","abstract_excerpt":"We present a linear-time algorithm for simplifying flow networks on directed planar graphs: Given a directed planar graph on $n$ vertices, a source vertex $s$ and a sink vertex $t$, our algorithm removes all the arcs that do not participate in any simple $s,t$-path in linear-time. The output graph produced by our algorithm satisfies the prerequisite needed by the $O(n\\log n)$-time algorithm of Weihe [FOCS'94 \\& JCSS'97] for computing maximum $s,t$-flow in directed planar graphs. Previously, Weihe's algorithm could not run in $O(n\\log n)$-time due to the absence of the preprocessing step; all t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04786","kind":"arxiv","version":4},"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:16:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yq7pvNPvczENRaBP6IJ7yGxTzVXxCMxltBcTcsWYymAtl8JGwjb9XaKPQuKXW50yLFsks/Dn1vTs921uJnXrDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:18:14.557223Z"},"content_sha256":"54c64c424f6e2ebcf27bb3b07ffdc47984e2752c816d72a27a593da9e3060fa5","schema_version":"1.0","event_id":"sha256:54c64c424f6e2ebcf27bb3b07ffdc47984e2752c816d72a27a593da9e3060fa5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/bundle.json","state_url":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/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-05-28T06:18:14Z","links":{"resolver":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC","bundle":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/bundle.json","state":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GSHNPEWLZTOMOUFRGUHHBIEUBC","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":"488723575c2c87fe57cddc74f93dfe1ca2942d18b280b567870093db972f899a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-15T21:35:22Z","title_canon_sha256":"0f76f0777f7620820974c9a92b52f1adaf9d18789e5f6b76893639ff1d681ecd"},"schema_version":"1.0","source":{"id":"1702.04786","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04786","created_at":"2026-05-18T00:16:38Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04786v4","created_at":"2026-05-18T00:16:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04786","created_at":"2026-05-18T00:16:38Z"},{"alias_kind":"pith_short_12","alias_value":"GSHNPEWLZTOM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GSHNPEWLZTOMOUFR","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GSHNPEWL","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:54c64c424f6e2ebcf27bb3b07ffdc47984e2752c816d72a27a593da9e3060fa5","target":"graph","created_at":"2026-05-18T00:16:38Z","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 present a linear-time algorithm for simplifying flow networks on directed planar graphs: Given a directed planar graph on $n$ vertices, a source vertex $s$ and a sink vertex $t$, our algorithm removes all the arcs that do not participate in any simple $s,t$-path in linear-time. The output graph produced by our algorithm satisfies the prerequisite needed by the $O(n\\log n)$-time algorithm of Weihe [FOCS'94 \\& JCSS'97] for computing maximum $s,t$-flow in directed planar graphs. Previously, Weihe's algorithm could not run in $O(n\\log n)$-time due to the absence of the preprocessing step; all t","authors_text":"Bundit Laekhanukit, Jittat Fakcharoenphol, Pattara Sukprasert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-15T21:35:22Z","title":"Finding All Useless Arcs in Directed Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04786","kind":"arxiv","version":4},"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:c7853f53a9043df73bbe47ece8eb74e00c22b0b3591e65328a87c821679ccc65","target":"record","created_at":"2026-05-18T00:16:38Z","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":"488723575c2c87fe57cddc74f93dfe1ca2942d18b280b567870093db972f899a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-15T21:35:22Z","title_canon_sha256":"0f76f0777f7620820974c9a92b52f1adaf9d18789e5f6b76893639ff1d681ecd"},"schema_version":"1.0","source":{"id":"1702.04786","kind":"arxiv","version":4}},"canonical_sha256":"348ed792cbccdcc750b1350e70a0940884023c98fa5e8196b5214438e607ffb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"348ed792cbccdcc750b1350e70a0940884023c98fa5e8196b5214438e607ffb9","first_computed_at":"2026-05-18T00:16:38.987986Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:38.987986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uyo9bRy1ItoSiULaozyADcG7pMYSLtJbO0zF/sOpmt73eXJJfo/Qdb/RqU1M6IKvp5H7KEwBSGkAYZCyTKmACQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:38.988660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04786","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c7853f53a9043df73bbe47ece8eb74e00c22b0b3591e65328a87c821679ccc65","sha256:54c64c424f6e2ebcf27bb3b07ffdc47984e2752c816d72a27a593da9e3060fa5"],"state_sha256":"81a72a4cc0cf2e16153b65a98a276e38a0b831fa2733b13f9d9c9e4acf99ed59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5dvwET1dFZkSgoLqf9jrvJTomW5++78i99FuTNoUc5OeRbTolarT1sLIntu1cUzNSx6VfiX3CvZrgYSp7kRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:18:14.559371Z","bundle_sha256":"ce032162500bd083d876ddcd85f9d817ab7254eeca65fcfc2e205fc46adfec3e"}}