{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W3TAJPV7QRQB2IKLLV2DJHYB7P","short_pith_number":"pith:W3TAJPV7","schema_version":"1.0","canonical_sha256":"b6e604bebf84601d214b5d74349f01fbd7d3bc8d09d6093e3c97218c013fcfc5","source":{"kind":"arxiv","id":"1605.08490","version":1},"attestation_state":"computed","paper":{"title":"A Simple and Strongly-Local Flow-Based Method for Cut Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"David F. Gleich, Michael W. Mahoney, Nate Veldt","submitted_at":"2016-05-27T01:55:31Z","abstract_excerpt":"Many graph-based learning problems can be cast as finding a good set of vertices nearby a seed set, and a powerful methodology for these problems is based on maximum flows. We introduce and analyze a new method for locally-biased graph-based learning called SimpleLocal, which finds good conductance cuts near a set of seed vertices. An important feature of our algorithm is that it is strongly-local, meaning it does not need to explore the entire graph to find cuts that are locally optimal. This method solves the same objective as existing strongly-local flow-based methods, but it enables a simp"},"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":"1605.08490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-05-27T01:55:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fc09f676ea7db22d686493ee8621de21d452a28f69710f579b1f2f861b24c590","abstract_canon_sha256":"e605c8ca24016fda4d62d1a07223b6a6a1cf67f717e4cd3d304519c930b9188f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.791271Z","signature_b64":"vzffrndTwxuqGWbHbWNwJR2znaH4BfHh8TWHFlzSGs84YKMXwttoHlAO3vQjofAOG/ZUDMMKa+ncOiRP/FsFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6e604bebf84601d214b5d74349f01fbd7d3bc8d09d6093e3c97218c013fcfc5","last_reissued_at":"2026-05-18T01:13:29.790610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.790610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple and Strongly-Local Flow-Based Method for Cut Improvement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"David F. Gleich, Michael W. Mahoney, Nate Veldt","submitted_at":"2016-05-27T01:55:31Z","abstract_excerpt":"Many graph-based learning problems can be cast as finding a good set of vertices nearby a seed set, and a powerful methodology for these problems is based on maximum flows. We introduce and analyze a new method for locally-biased graph-based learning called SimpleLocal, which finds good conductance cuts near a set of seed vertices. An important feature of our algorithm is that it is strongly-local, meaning it does not need to explore the entire graph to find cuts that are locally optimal. This method solves the same objective as existing strongly-local flow-based methods, but it enables a simp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08490","kind":"arxiv","version":1},"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":"1605.08490","created_at":"2026-05-18T01:13:29.790707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08490v1","created_at":"2026-05-18T01:13:29.790707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08490","created_at":"2026-05-18T01:13:29.790707+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3TAJPV7QRQB","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3TAJPV7QRQB2IKL","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3TAJPV7","created_at":"2026-05-18T12:30:48.956258+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/W3TAJPV7QRQB2IKLLV2DJHYB7P","json":"https://pith.science/pith/W3TAJPV7QRQB2IKLLV2DJHYB7P.json","graph_json":"https://pith.science/api/pith-number/W3TAJPV7QRQB2IKLLV2DJHYB7P/graph.json","events_json":"https://pith.science/api/pith-number/W3TAJPV7QRQB2IKLLV2DJHYB7P/events.json","paper":"https://pith.science/paper/W3TAJPV7"},"agent_actions":{"view_html":"https://pith.science/pith/W3TAJPV7QRQB2IKLLV2DJHYB7P","download_json":"https://pith.science/pith/W3TAJPV7QRQB2IKLLV2DJHYB7P.json","view_paper":"https://pith.science/paper/W3TAJPV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08490&json=true","fetch_graph":"https://pith.science/api/pith-number/W3TAJPV7QRQB2IKLLV2DJHYB7P/graph.json","fetch_events":"https://pith.science/api/pith-number/W3TAJPV7QRQB2IKLLV2DJHYB7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3TAJPV7QRQB2IKLLV2DJHYB7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3TAJPV7QRQB2IKLLV2DJHYB7P/action/storage_attestation","attest_author":"https://pith.science/pith/W3TAJPV7QRQB2IKLLV2DJHYB7P/action/author_attestation","sign_citation":"https://pith.science/pith/W3TAJPV7QRQB2IKLLV2DJHYB7P/action/citation_signature","submit_replication":"https://pith.science/pith/W3TAJPV7QRQB2IKLLV2DJHYB7P/action/replication_record"}},"created_at":"2026-05-18T01:13:29.790707+00:00","updated_at":"2026-05-18T01:13:29.790707+00:00"}