{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZV4645VSAE5LP6WNGGHBRCNM5Y","short_pith_number":"pith:ZV4645VS","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"},"canonical_sha256":"cd79ee76b2013ab7facd318e1889acee0ac22ffa8a7facf80a58fd5addf01e9c","source":{"kind":"arxiv","id":"1512.02068","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02068","created_at":"2026-05-18T00:59:26Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02068v2","created_at":"2026-05-18T00:59:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02068","created_at":"2026-05-18T00:59:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZV4645VSAE5L","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZV4645VSAE5LP6WN","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZV4645VS","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZV4645VSAE5LP6WNGGHBRCNM5Y","target":"record","payload":{"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"},"canonical_sha256":"cd79ee76b2013ab7facd318e1889acee0ac22ffa8a7facf80a58fd5addf01e9c","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"},"source_kind":"arxiv","source_id":"1512.02068","source_version":2,"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:59:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9sgPgRU7OFoCfywRl1qXjwyLcRRDhy71XCuGim4Uj3wYCG+VMpbaZ1MiqiMOW9w+/l3saNY7hqMp97CgzgHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:41:31.768454Z"},"content_sha256":"feacaa80f9739311e09064bb04fa546d183076be981609094ba50abffb4db8ea","schema_version":"1.0","event_id":"sha256:feacaa80f9739311e09064bb04fa546d183076be981609094ba50abffb4db8ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZV4645VSAE5LP6WNGGHBRCNM5Y","target":"graph","payload":{"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"},"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:59:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v4fVbvwaslLrW5d9Oawkv/8XbLmBH0bGhCGNBhgdU9AH1Nq04FPLQTzs69lAWKe87XoyOsYrh9WTky1QT720Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:41:31.769126Z"},"content_sha256":"e14d82445694ba4a08d0f0c8e3b86ab71ecd538922da60a8cc87402126523b3a","schema_version":"1.0","event_id":"sha256:e14d82445694ba4a08d0f0c8e3b86ab71ecd538922da60a8cc87402126523b3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/bundle.json","state_url":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/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-26T03:41:31Z","links":{"resolver":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y","bundle":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/bundle.json","state":"https://pith.science/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZV4645VSAE5LP6WNGGHBRCNM5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZV4645VSAE5LP6WNGGHBRCNM5Y","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":"5e104c03cefeff44878da00fc06f9d54edd058e20ba7048859b75a919404eea6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T14:37:39Z","title_canon_sha256":"b204c009d0b9ff7253197ce7dc429d0168cd0f795c2a56d302c4f6b3d2e9b737"},"schema_version":"1.0","source":{"id":"1512.02068","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02068","created_at":"2026-05-18T00:59:26Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02068v2","created_at":"2026-05-18T00:59:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02068","created_at":"2026-05-18T00:59:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZV4645VSAE5L","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZV4645VSAE5LP6WN","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZV4645VS","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:e14d82445694ba4a08d0f0c8e3b86ab71ecd538922da60a8cc87402126523b3a","target":"graph","created_at":"2026-05-18T00:59:26Z","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 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)$.","authors_text":"Cyril Nikolaev, Oren Weimann, Shay Mozes, Yahav Nussbaum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T14:37:39Z","title":"Minimum Cut of Directed Planar Graphs in O(nloglogn) Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02068","kind":"arxiv","version":2},"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:feacaa80f9739311e09064bb04fa546d183076be981609094ba50abffb4db8ea","target":"record","created_at":"2026-05-18T00:59:26Z","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":"5e104c03cefeff44878da00fc06f9d54edd058e20ba7048859b75a919404eea6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T14:37:39Z","title_canon_sha256":"b204c009d0b9ff7253197ce7dc429d0168cd0f795c2a56d302c4f6b3d2e9b737"},"schema_version":"1.0","source":{"id":"1512.02068","kind":"arxiv","version":2}},"canonical_sha256":"cd79ee76b2013ab7facd318e1889acee0ac22ffa8a7facf80a58fd5addf01e9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd79ee76b2013ab7facd318e1889acee0ac22ffa8a7facf80a58fd5addf01e9c","first_computed_at":"2026-05-18T00:59:26.249810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:26.249810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mvASVPJVh0zDRLoKraFF+QsmNMyZRYZkuWclErgvdZEuExoG00px33JeYGUgKJJdse4OlKYVOrQKr0iBgGB6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:26.250446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02068","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:feacaa80f9739311e09064bb04fa546d183076be981609094ba50abffb4db8ea","sha256:e14d82445694ba4a08d0f0c8e3b86ab71ecd538922da60a8cc87402126523b3a"],"state_sha256":"967f0dcc57a1c5b0cba92b5cb52533d59a6619ce6cd229e2afee2e3119d49af9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IHwC0d50QZ3WVPnJMRB0e2hZU35wBgMbCQQVzoCeh7TCZxvtefGqQjEjzpPX0jfi+P9ovkPw74wfwW5l5O5bDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:41:31.772725Z","bundle_sha256":"032204227b0dd7cd92e1ab7008e0c0b19c9b64b485edd85ab43c89152d4d967a"}}