{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HV5RYDOVKLCX6G2IS5B2QTWND7","short_pith_number":"pith:HV5RYDOV","schema_version":"1.0","canonical_sha256":"3d7b1c0dd552c57f1b489743a84ecd1fcc1591edb65febd3194a17d623fc5c13","source":{"kind":"arxiv","id":"1904.08382","version":2},"attestation_state":"computed","paper":{"title":"A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Liu Yang, Sebastian Forster","submitted_at":"2019-04-17T17:32:34Z","abstract_excerpt":"Consider the following \"local\" cut-detection problem in a directed graph: We are given a starting vertex $s$ and need to detect whether there is a cut with at most $k$ edges crossing the cut such that the side of the cut containing $s$ has at most $\\Delta$ interior edges. If we are given query access to the input graph, then this problem can in principle be solved in sublinear time without reading the whole graph and with query complexity depending on $k$ and $\\Delta$. We design an elegant randomized procedure that solves a slack variant of this problem with $O(k^2 \\Delta)$ queries, improving "},"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":"1904.08382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T17:32:34Z","cross_cats_sorted":[],"title_canon_sha256":"f677e19503dbb48432cfdce05432cc1ccc3e479dfb42304054f23fdd0da83264","abstract_canon_sha256":"5fc63e57395a81521dd8515a784845f2275f30a8c0c7d010469c28d48a26cbb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:04.328722Z","signature_b64":"Y8ykbXKEY4xnqN3gqJAOVZg/2pe5v/OM2MW0evhYMa3L8tn8A7dbcJRffD/BBoMC0j6jomIeWgxMzyqTxsYQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d7b1c0dd552c57f1b489743a84ecd1fcc1591edb65febd3194a17d623fc5c13","last_reissued_at":"2026-05-17T23:48:04.328319Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:04.328319Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Liu Yang, Sebastian Forster","submitted_at":"2019-04-17T17:32:34Z","abstract_excerpt":"Consider the following \"local\" cut-detection problem in a directed graph: We are given a starting vertex $s$ and need to detect whether there is a cut with at most $k$ edges crossing the cut such that the side of the cut containing $s$ has at most $\\Delta$ interior edges. If we are given query access to the input graph, then this problem can in principle be solved in sublinear time without reading the whole graph and with query complexity depending on $k$ and $\\Delta$. We design an elegant randomized procedure that solves a slack variant of this problem with $O(k^2 \\Delta)$ queries, improving "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08382","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":"1904.08382","created_at":"2026-05-17T23:48:04.328379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08382v2","created_at":"2026-05-17T23:48:04.328379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08382","created_at":"2026-05-17T23:48:04.328379+00:00"},{"alias_kind":"pith_short_12","alias_value":"HV5RYDOVKLCX","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HV5RYDOVKLCX6G2I","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HV5RYDOV","created_at":"2026-05-18T12:33:18.533446+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/HV5RYDOVKLCX6G2IS5B2QTWND7","json":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7.json","graph_json":"https://pith.science/api/pith-number/HV5RYDOVKLCX6G2IS5B2QTWND7/graph.json","events_json":"https://pith.science/api/pith-number/HV5RYDOVKLCX6G2IS5B2QTWND7/events.json","paper":"https://pith.science/paper/HV5RYDOV"},"agent_actions":{"view_html":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7","download_json":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7.json","view_paper":"https://pith.science/paper/HV5RYDOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08382&json=true","fetch_graph":"https://pith.science/api/pith-number/HV5RYDOVKLCX6G2IS5B2QTWND7/graph.json","fetch_events":"https://pith.science/api/pith-number/HV5RYDOVKLCX6G2IS5B2QTWND7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/action/storage_attestation","attest_author":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/action/author_attestation","sign_citation":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/action/citation_signature","submit_replication":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/action/replication_record"}},"created_at":"2026-05-17T23:48:04.328379+00:00","updated_at":"2026-05-17T23:48:04.328379+00:00"}