{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:SYBMHVU4GZ5EBHJOU5OAGMWHJR","short_pith_number":"pith:SYBMHVU4","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"},"canonical_sha256":"9602c3d69c367a409d2ea75c0332c74c54eda3c77384381555b5347d598baa86","source":{"kind":"arxiv","id":"1004.4915","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.4915","created_at":"2026-05-18T02:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"1004.4915v1","created_at":"2026-05-18T02:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4915","created_at":"2026-05-18T02:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"SYBMHVU4GZ5E","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SYBMHVU4GZ5EBHJO","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SYBMHVU4","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:SYBMHVU4GZ5EBHJOU5OAGMWHJR","target":"record","payload":{"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"},"canonical_sha256":"9602c3d69c367a409d2ea75c0332c74c54eda3c77384381555b5347d598baa86","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"},"source_kind":"arxiv","source_id":"1004.4915","source_version":1,"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-18T02:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7uOo5CM68aDfiAaxqbsD5/t4QdXIPzDxq1MWE4fs9+z2GfoQrGMFZcn8JJkeL+FbgahIFkCbFIUbWw6X6CJUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:15:30.830373Z"},"content_sha256":"7b05e6c62c34ff7724765b1893ffa4725cd7f9bf07fedfd505969cdc7e053f7d","schema_version":"1.0","event_id":"sha256:7b05e6c62c34ff7724765b1893ffa4725cd7f9bf07fedfd505969cdc7e053f7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:SYBMHVU4GZ5EBHJOU5OAGMWHJR","target":"graph","payload":{"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"},"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-18T02:24:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBuzKvv6h4qagPKJX4IAvNbk7ua6if58UIuna40sis5Ct7+E+GG66Shzf17vw0kG759LLZ41Ub5jRa9HX7qmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:15:30.830721Z"},"content_sha256":"1a280da82298dc73996858488c6e1a3c10306034aea4f80e1073a0a1428f77d1","schema_version":"1.0","event_id":"sha256:1a280da82298dc73996858488c6e1a3c10306034aea4f80e1073a0a1428f77d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/bundle.json","state_url":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/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-30T23:15:30Z","links":{"resolver":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR","bundle":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/bundle.json","state":"https://pith.science/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYBMHVU4GZ5EBHJOU5OAGMWHJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:SYBMHVU4GZ5EBHJOU5OAGMWHJR","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":"17f9ade5bbd090bae1e0aecf57e8cec6b98b5c3901d31c1a1708b2ff631d7ac8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-27T21:05:00Z","title_canon_sha256":"60c502c9d5878e73365d2b8478e4e3441718df868c296d371361985b310dfb0e"},"schema_version":"1.0","source":{"id":"1004.4915","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.4915","created_at":"2026-05-18T02:24:15Z"},{"alias_kind":"arxiv_version","alias_value":"1004.4915v1","created_at":"2026-05-18T02:24:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4915","created_at":"2026-05-18T02:24:15Z"},{"alias_kind":"pith_short_12","alias_value":"SYBMHVU4GZ5E","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"SYBMHVU4GZ5EBHJO","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"SYBMHVU4","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:1a280da82298dc73996858488c6e1a3c10306034aea4f80e1073a0a1428f77d1","target":"graph","created_at":"2026-05-18T02:24:15Z","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":"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","authors_text":"Ashish Goel, Michael Kapralov, Sanjeev Khanna","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-27T21:05:00Z","title":"Graph Sparsification via Refinement Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4915","kind":"arxiv","version":1},"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:7b05e6c62c34ff7724765b1893ffa4725cd7f9bf07fedfd505969cdc7e053f7d","target":"record","created_at":"2026-05-18T02:24:15Z","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":"17f9ade5bbd090bae1e0aecf57e8cec6b98b5c3901d31c1a1708b2ff631d7ac8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-27T21:05:00Z","title_canon_sha256":"60c502c9d5878e73365d2b8478e4e3441718df868c296d371361985b310dfb0e"},"schema_version":"1.0","source":{"id":"1004.4915","kind":"arxiv","version":1}},"canonical_sha256":"9602c3d69c367a409d2ea75c0332c74c54eda3c77384381555b5347d598baa86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9602c3d69c367a409d2ea75c0332c74c54eda3c77384381555b5347d598baa86","first_computed_at":"2026-05-18T02:24:15.659070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:15.659070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"82Sp+GEIqKNWTIG1icca32VzIBk47AKOb0iPVt/FGfNo4NB5SSSbM/Cynczq3stG5GKwUiVlnXi3kMJq9mYPBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:15.659609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.4915","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b05e6c62c34ff7724765b1893ffa4725cd7f9bf07fedfd505969cdc7e053f7d","sha256:1a280da82298dc73996858488c6e1a3c10306034aea4f80e1073a0a1428f77d1"],"state_sha256":"306c6a746df89ac684ce1d6748e3db3707cfcf0c36ce262e5d2bcbd5b7b8e24b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhPoPvG0fjhDmjP9L8GWls6N9aOnqhZsbz/HFbvGeMRPcaphqxEKM8H1Y9XM1i84SU4x413z0tI6kEAf7zbEDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:15:30.832795Z","bundle_sha256":"212faefa5634ef696b4af7c29795fd8d39c5ce16c7e2e7814b825ff02c04291f"}}