{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SYBMHVU4GZ5EBHJOU5OAGMWHJR","short_pith_number":"pith:SYBMHVU4","schema_version":"1.0","canonical_sha256":"9602c3d69c367a409d2ea75c0332c74c54eda3c77384381555b5347d598baa86","source":{"kind":"arxiv","id":"1004.4915","version":1},"attestation_state":"computed","paper":{"title":"Graph Sparsification via Refinement Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashish Goel, Michael Kapralov, Sanjeev Khanna","submitted_at":"2010-04-27T21:05:00Z","abstract_excerpt":"A graph G'(V,E') is an \\eps-sparsification of G for some \\eps>0, if every (weighted) cut in G' is within (1\\pm \\eps) of the corresponding cut in G. A celebrated result of Benczur and Karger shows that for every undirected graph G, an \\eps-sparsification with O(n\\log n/\\e^2) edges can be constructed in O(m\\log^2n) time. Applications to modern massive data sets often constrain algorithms to use computation models that restrict random access to the input. The semi-streaming model, in which the algorithm is constrained to use \\tilde O(n) space, has been shown to be a good abstraction for analyzing"},"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":"1004.4915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-27T21:05:00Z","cross_cats_sorted":[],"title_canon_sha256":"60c502c9d5878e73365d2b8478e4e3441718df868c296d371361985b310dfb0e","abstract_canon_sha256":"17f9ade5bbd090bae1e0aecf57e8cec6b98b5c3901d31c1a1708b2ff631d7ac8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:15.659609Z","signature_b64":"82Sp+GEIqKNWTIG1icca32VzIBk47AKOb0iPVt/FGfNo4NB5SSSbM/Cynczq3stG5GKwUiVlnXi3kMJq9mYPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9602c3d69c367a409d2ea75c0332c74c54eda3c77384381555b5347d598baa86","last_reissued_at":"2026-05-18T02:24:15.659070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:15.659070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Sparsification via Refinement Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashish Goel, Michael Kapralov, Sanjeev Khanna","submitted_at":"2010-04-27T21:05:00Z","abstract_excerpt":"A graph G'(V,E') is an \\eps-sparsification of G for some \\eps>0, if every (weighted) cut in G' is within (1\\pm \\eps) of the corresponding cut in G. A celebrated result of Benczur and Karger shows that for every undirected graph G, an \\eps-sparsification with O(n\\log n/\\e^2) edges can be constructed in O(m\\log^2n) time. Applications to modern massive data sets often constrain algorithms to use computation models that restrict random access to the input. The semi-streaming model, in which the algorithm is constrained to use \\tilde O(n) space, has been shown to be a good abstraction for analyzing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4915","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":"1004.4915","created_at":"2026-05-18T02:24:15.659146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.4915v1","created_at":"2026-05-18T02:24:15.659146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4915","created_at":"2026-05-18T02:24:15.659146+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYBMHVU4GZ5E","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYBMHVU4GZ5EBHJO","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYBMHVU4","created_at":"2026-05-18T12:26:13.927090+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/SYBMHVU4GZ5EBHJOU5OAGMWHJR","json":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR.json","graph_json":"https://pith.science/api/pith-number/SYBMHVU4GZ5EBHJOU5OAGMWHJR/graph.json","events_json":"https://pith.science/api/pith-number/SYBMHVU4GZ5EBHJOU5OAGMWHJR/events.json","paper":"https://pith.science/paper/SYBMHVU4"},"agent_actions":{"view_html":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR","download_json":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR.json","view_paper":"https://pith.science/paper/SYBMHVU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.4915&json=true","fetch_graph":"https://pith.science/api/pith-number/SYBMHVU4GZ5EBHJOU5OAGMWHJR/graph.json","fetch_events":"https://pith.science/api/pith-number/SYBMHVU4GZ5EBHJOU5OAGMWHJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/action/storage_attestation","attest_author":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/action/author_attestation","sign_citation":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/action/citation_signature","submit_replication":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/action/replication_record"}},"created_at":"2026-05-18T02:24:15.659146+00:00","updated_at":"2026-05-18T02:24:15.659146+00:00"}