{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZV4645VSAE5LP6WNGGHBRCNM5Y","short_pith_number":"pith:ZV4645VS","schema_version":"1.0","canonical_sha256":"cd79ee76b2013ab7facd318e1889acee0ac22ffa8a7facf80a58fd5addf01e9c","source":{"kind":"arxiv","id":"1512.02068","version":2},"attestation_state":"computed","paper":{"title":"Minimum Cut of Directed Planar Graphs in O(nloglogn) Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cyril Nikolaev, Oren Weimann, Shay Mozes, Yahav Nussbaum","submitted_at":"2015-12-07T14:37:39Z","abstract_excerpt":"We give an $O(n \\log \\log n)$ time algorithm for computing the minimum cut (or equivalently, the shortest cycle) of a weighted directed planar graph. This improves the previous fastest $O(n\\log^3 n)$ solution. Interestingly, while in undirected planar graphs both min-cut and min $st$-cut have $O(n \\log \\log n)$ solutions, in directed planar graphs our result makes min-cut faster than min $st$-cut, which currently requires $O(n \\log n)$."},"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":"1512.02068","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T14:37:39Z","cross_cats_sorted":[],"title_canon_sha256":"b204c009d0b9ff7253197ce7dc429d0168cd0f795c2a56d302c4f6b3d2e9b737","abstract_canon_sha256":"5e104c03cefeff44878da00fc06f9d54edd058e20ba7048859b75a919404eea6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:26.250446Z","signature_b64":"mvASVPJVh0zDRLoKraFF+QsmNMyZRYZkuWclErgvdZEuExoG00px33JeYGUgKJJdse4OlKYVOrQKr0iBgGB6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd79ee76b2013ab7facd318e1889acee0ac22ffa8a7facf80a58fd5addf01e9c","last_reissued_at":"2026-05-18T00:59:26.249810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:26.249810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Cut of Directed Planar Graphs in O(nloglogn) Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cyril Nikolaev, Oren Weimann, Shay Mozes, Yahav Nussbaum","submitted_at":"2015-12-07T14:37:39Z","abstract_excerpt":"We give an $O(n \\log \\log n)$ time algorithm for computing the minimum cut (or equivalently, the shortest cycle) of a weighted directed planar graph. This improves the previous fastest $O(n\\log^3 n)$ solution. Interestingly, while in undirected planar graphs both min-cut and min $st$-cut have $O(n \\log \\log n)$ solutions, in directed planar graphs our result makes min-cut faster than min $st$-cut, which currently requires $O(n \\log n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02068","kind":"arxiv","version":2},"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":"1512.02068","created_at":"2026-05-18T00:59:26.249915+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02068v2","created_at":"2026-05-18T00:59:26.249915+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02068","created_at":"2026-05-18T00:59:26.249915+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZV4645VSAE5L","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZV4645VSAE5LP6WN","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZV4645VS","created_at":"2026-05-18T12:29:52.810259+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/ZV4645VSAE5LP6WNGGHBRCNM5Y","json":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y.json","graph_json":"https://pith.science/api/pith-number/ZV4645VSAE5LP6WNGGHBRCNM5Y/graph.json","events_json":"https://pith.science/api/pith-number/ZV4645VSAE5LP6WNGGHBRCNM5Y/events.json","paper":"https://pith.science/paper/ZV4645VS"},"agent_actions":{"view_html":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y","download_json":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y.json","view_paper":"https://pith.science/paper/ZV4645VS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02068&json=true","fetch_graph":"https://pith.science/api/pith-number/ZV4645VSAE5LP6WNGGHBRCNM5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/ZV4645VSAE5LP6WNGGHBRCNM5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/action/storage_attestation","attest_author":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/action/author_attestation","sign_citation":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/action/citation_signature","submit_replication":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/action/replication_record"}},"created_at":"2026-05-18T00:59:26.249915+00:00","updated_at":"2026-05-18T00:59:26.249915+00:00"}