{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HV5RYDOVKLCX6G2IS5B2QTWND7","short_pith_number":"pith:HV5RYDOV","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"},"canonical_sha256":"3d7b1c0dd552c57f1b489743a84ecd1fcc1591edb65febd3194a17d623fc5c13","source":{"kind":"arxiv","id":"1904.08382","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08382","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08382v2","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08382","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"HV5RYDOVKLCX","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HV5RYDOVKLCX6G2I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HV5RYDOV","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HV5RYDOVKLCX6G2IS5B2QTWND7","target":"record","payload":{"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"},"canonical_sha256":"3d7b1c0dd552c57f1b489743a84ecd1fcc1591edb65febd3194a17d623fc5c13","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"},"source_kind":"arxiv","source_id":"1904.08382","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-17T23:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yjq/g0LWHQsbk0dCdp3od0TE1LxIeDPkmbjsDGlVmU3c1hPkCuRtHOG45x9VuwzjlXMreaOAxg62HO3AeQ3+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:43:07.069524Z"},"content_sha256":"33597b8948c93a2dc38e34c3bb02601e9823d21346044d3464fd29f5c10f7502","schema_version":"1.0","event_id":"sha256:33597b8948c93a2dc38e34c3bb02601e9823d21346044d3464fd29f5c10f7502"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HV5RYDOVKLCX6G2IS5B2QTWND7","target":"graph","payload":{"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"},"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-17T23:48:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ObS0Fb7VKl9luZOg3Dt+4BBYCOtvQucBiElWJe5wHm/cj1M+hA3SJeF8Yqv4fWtn+wEFmCb0F4+T/nc/IjAXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:43:07.069870Z"},"content_sha256":"55b03ad371200c1b4f866aa6cc26ef12829f570f0b090a670a18e4c1b168052f","schema_version":"1.0","event_id":"sha256:55b03ad371200c1b4f866aa6cc26ef12829f570f0b090a670a18e4c1b168052f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/bundle.json","state_url":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/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-06-07T14:43:07Z","links":{"resolver":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7","bundle":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/bundle.json","state":"https://pith.science/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HV5RYDOVKLCX6G2IS5B2QTWND7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HV5RYDOVKLCX6G2IS5B2QTWND7","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":"5fc63e57395a81521dd8515a784845f2275f30a8c0c7d010469c28d48a26cbb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T17:32:34Z","title_canon_sha256":"f677e19503dbb48432cfdce05432cc1ccc3e479dfb42304054f23fdd0da83264"},"schema_version":"1.0","source":{"id":"1904.08382","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.08382","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"arxiv_version","alias_value":"1904.08382v2","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08382","created_at":"2026-05-17T23:48:04Z"},{"alias_kind":"pith_short_12","alias_value":"HV5RYDOVKLCX","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HV5RYDOVKLCX6G2I","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HV5RYDOV","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:55b03ad371200c1b4f866aa6cc26ef12829f570f0b090a670a18e4c1b168052f","target":"graph","created_at":"2026-05-17T23:48:04Z","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":"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 ","authors_text":"Liu Yang, Sebastian Forster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T17:32:34Z","title":"A Faster Local Algorithm for Detecting Bounded-Size Cuts with Applications to Higher-Connectivity Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08382","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:33597b8948c93a2dc38e34c3bb02601e9823d21346044d3464fd29f5c10f7502","target":"record","created_at":"2026-05-17T23:48:04Z","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":"5fc63e57395a81521dd8515a784845f2275f30a8c0c7d010469c28d48a26cbb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-17T17:32:34Z","title_canon_sha256":"f677e19503dbb48432cfdce05432cc1ccc3e479dfb42304054f23fdd0da83264"},"schema_version":"1.0","source":{"id":"1904.08382","kind":"arxiv","version":2}},"canonical_sha256":"3d7b1c0dd552c57f1b489743a84ecd1fcc1591edb65febd3194a17d623fc5c13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d7b1c0dd552c57f1b489743a84ecd1fcc1591edb65febd3194a17d623fc5c13","first_computed_at":"2026-05-17T23:48:04.328319Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:04.328319Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y8ykbXKEY4xnqN3gqJAOVZg/2pe5v/OM2MW0evhYMa3L8tn8A7dbcJRffD/BBoMC0j6jomIeWgxMzyqTxsYQCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:04.328722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.08382","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33597b8948c93a2dc38e34c3bb02601e9823d21346044d3464fd29f5c10f7502","sha256:55b03ad371200c1b4f866aa6cc26ef12829f570f0b090a670a18e4c1b168052f"],"state_sha256":"bdab95efd1c79dec687770254a60bf2c1cdcd34c9e95cca12d249f83d183c89b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gO9wwTPRp53U/IjQNWd8IVSH2VMwWthF2wxP3Y/COKatejGofB/KNvaK1e9V+XTbiy3mNMHGwgPxQKdale0Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:43:07.071712Z","bundle_sha256":"898186e12aae29230ca4730167147be54e42765c3161e759519c926998276b98"}}