{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GSHNPEWLZTOMOUFRGUHHBIEUBC","short_pith_number":"pith:GSHNPEWL","schema_version":"1.0","canonical_sha256":"348ed792cbccdcc750b1350e70a0940884023c98fa5e8196b5214438e607ffb9","source":{"kind":"arxiv","id":"1702.04786","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.04786","created_at":"2026-05-18T00:16:38.988095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04786v4","created_at":"2026-05-18T00:16:38.988095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04786","created_at":"2026-05-18T00:16:38.988095+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSHNPEWLZTOM","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSHNPEWLZTOMOUFR","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSHNPEWL","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC","json":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC.json","graph_json":"https://pith.science/api/pith-number/GSHNPEWLZTOMOUFRGUHHBIEUBC/graph.json","events_json":"https://pith.science/api/pith-number/GSHNPEWLZTOMOUFRGUHHBIEUBC/events.json","paper":"https://pith.science/paper/GSHNPEWL"},"agent_actions":{"view_html":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC","download_json":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC.json","view_paper":"https://pith.science/paper/GSHNPEWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04786&json=true","fetch_graph":"https://pith.science/api/pith-number/GSHNPEWLZTOMOUFRGUHHBIEUBC/graph.json","fetch_events":"https://pith.science/api/pith-number/GSHNPEWLZTOMOUFRGUHHBIEUBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/action/storage_attestation","attest_author":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/action/author_attestation","sign_citation":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/action/citation_signature","submit_replication":"https://pith.science/pith/GSHNPEWLZTOMOUFRGUHHBIEUBC/action/replication_record"}},"created_at":"2026-05-18T00:16:38.988095+00:00","updated_at":"2026-05-18T00:16:38.988095+00:00"}