{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WRZREAGOEMIYXCSEDNBEZMJGX6","short_pith_number":"pith:WRZREAGO","canonical_record":{"source":{"id":"1412.8225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T23:22:42Z","cross_cats_sorted":[],"title_canon_sha256":"ff306a72bb0b8d198ff210819659ca71224032c7e29188e8e5e43935f2bd0b7d","abstract_canon_sha256":"dbd5e42b084f7dc6ba2cd04eebfb7821d45057ecdf2ebf3ce3874231951df5a2"},"schema_version":"1.0"},"canonical_sha256":"b4731200ce23118b8a441b424cb126bfa51c4e46fb392d8a1fdfae04e460422f","source":{"kind":"arxiv","id":"1412.8225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8225","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8225v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8225","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"WRZREAGOEMIY","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WRZREAGOEMIYXCSE","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WRZREAGO","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WRZREAGOEMIYXCSEDNBEZMJGX6","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8225","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T23:22:42Z","cross_cats_sorted":[],"title_canon_sha256":"ff306a72bb0b8d198ff210819659ca71224032c7e29188e8e5e43935f2bd0b7d","abstract_canon_sha256":"dbd5e42b084f7dc6ba2cd04eebfb7821d45057ecdf2ebf3ce3874231951df5a2"},"schema_version":"1.0"},"canonical_sha256":"b4731200ce23118b8a441b424cb126bfa51c4e46fb392d8a1fdfae04e460422f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:23.744020Z","signature_b64":"3K1kvXV01XwxIpFni4F6dYIVy4UdoWG2cEDmVopSXsrXeKmJp17+qOPM1M3faaaENLGCrIK0wz6Zqx1q78IWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4731200ce23118b8a441b424cb126bfa51c4e46fb392d8a1fdfae04e460422f","last_reissued_at":"2026-05-18T02:30:23.743336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:23.743336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8225","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:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKJWVjekXjndK47lXNNUJjdtKUVa+VooIUUhy8kKup46rUoAGCYwF9f0/Q+CKaf95fK9S8p/PQJ8Qr3YQC85AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:28:31.230513Z"},"content_sha256":"70ee52383bee9772537144ac3da717767d444bd9c83874c649f58ca586e1d833","schema_version":"1.0","event_id":"sha256:70ee52383bee9772537144ac3da717767d444bd9c83874c649f58ca586e1d833"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WRZREAGOEMIYXCSEDNBEZMJGX6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sketching Algorithm for Spectral Graph Sparsification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bo Qin, David P. Woodruff, Jiecao Chen, Qin Zhang","submitted_at":"2014-12-28T23:22:42Z","abstract_excerpt":"We study the problem of compressing a weighted graph $G$ on $n$ vertices, building a \"sketch\" $H$ of $G$, so that given any vector $x \\in \\mathbb{R}^n$, the value $x^T L_G x$ can be approximated up to a multiplicative $1+\\epsilon$ factor from only $H$ and $x$, where $L_G$ denotes the Laplacian of $G$. One solution to this problem is to build a spectral sparsifier $H$ of $G$, which, using the result of Batson, Spielman, and Srivastava, consists of $O(n \\epsilon^{-2})$ reweighted edges of $G$ and has the property that simultaneously for all $x \\in \\mathbb{R}^n$, $x^T L_H x = (1 \\pm \\epsilon) x^T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8225","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:30:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MzMnkB5tsY88NGYP/rCadz+E5nkxvup1CvCZnxWuCd1yUMa75/HOnSOTEFgze5gj2R2XOBXMH4HzHcs/yZy8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T05:28:31.231162Z"},"content_sha256":"6a7555ce9e9e645c0d3b2830835b77d121348d469001cc1a79c4bed23c67e90b","schema_version":"1.0","event_id":"sha256:6a7555ce9e9e645c0d3b2830835b77d121348d469001cc1a79c4bed23c67e90b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/bundle.json","state_url":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/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-11T05:28:31Z","links":{"resolver":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6","bundle":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/bundle.json","state":"https://pith.science/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRZREAGOEMIYXCSEDNBEZMJGX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WRZREAGOEMIYXCSEDNBEZMJGX6","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":"dbd5e42b084f7dc6ba2cd04eebfb7821d45057ecdf2ebf3ce3874231951df5a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T23:22:42Z","title_canon_sha256":"ff306a72bb0b8d198ff210819659ca71224032c7e29188e8e5e43935f2bd0b7d"},"schema_version":"1.0","source":{"id":"1412.8225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8225","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8225v1","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8225","created_at":"2026-05-18T02:30:23Z"},{"alias_kind":"pith_short_12","alias_value":"WRZREAGOEMIY","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WRZREAGOEMIYXCSE","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WRZREAGO","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:6a7555ce9e9e645c0d3b2830835b77d121348d469001cc1a79c4bed23c67e90b","target":"graph","created_at":"2026-05-18T02:30:23Z","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":"We study the problem of compressing a weighted graph $G$ on $n$ vertices, building a \"sketch\" $H$ of $G$, so that given any vector $x \\in \\mathbb{R}^n$, the value $x^T L_G x$ can be approximated up to a multiplicative $1+\\epsilon$ factor from only $H$ and $x$, where $L_G$ denotes the Laplacian of $G$. One solution to this problem is to build a spectral sparsifier $H$ of $G$, which, using the result of Batson, Spielman, and Srivastava, consists of $O(n \\epsilon^{-2})$ reweighted edges of $G$ and has the property that simultaneously for all $x \\in \\mathbb{R}^n$, $x^T L_H x = (1 \\pm \\epsilon) x^T","authors_text":"Bo Qin, David P. Woodruff, Jiecao Chen, Qin Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T23:22:42Z","title":"A Sketching Algorithm for Spectral Graph Sparsification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8225","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:70ee52383bee9772537144ac3da717767d444bd9c83874c649f58ca586e1d833","target":"record","created_at":"2026-05-18T02:30:23Z","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":"dbd5e42b084f7dc6ba2cd04eebfb7821d45057ecdf2ebf3ce3874231951df5a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-28T23:22:42Z","title_canon_sha256":"ff306a72bb0b8d198ff210819659ca71224032c7e29188e8e5e43935f2bd0b7d"},"schema_version":"1.0","source":{"id":"1412.8225","kind":"arxiv","version":1}},"canonical_sha256":"b4731200ce23118b8a441b424cb126bfa51c4e46fb392d8a1fdfae04e460422f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4731200ce23118b8a441b424cb126bfa51c4e46fb392d8a1fdfae04e460422f","first_computed_at":"2026-05-18T02:30:23.743336Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:23.743336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3K1kvXV01XwxIpFni4F6dYIVy4UdoWG2cEDmVopSXsrXeKmJp17+qOPM1M3faaaENLGCrIK0wz6Zqx1q78IWCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:23.744020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70ee52383bee9772537144ac3da717767d444bd9c83874c649f58ca586e1d833","sha256:6a7555ce9e9e645c0d3b2830835b77d121348d469001cc1a79c4bed23c67e90b"],"state_sha256":"8ff2579df333502d3da7a9c2abb4f16142690b7336d4491176d1e19f055e0718"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/kfif/wwOPywwzQVLEC3Wguse/UJUy8aA5GaLNWh1z8sijn/XWxB7Tbi03weyNGFdcZs8oLF0NwSMPjebAfPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T05:28:31.235353Z","bundle_sha256":"8916b9aa66c9e4ab3dba62761b3f956dfb42264a8686d72d2f1fd201d72498c8"}}