{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FCZYQHPPYEJCPKZL4HBV2FI2RS","short_pith_number":"pith:FCZYQHPP","schema_version":"1.0","canonical_sha256":"28b3881defc11227ab2be1c35d151a8c868191a5fd76ba1b093a7570c3ad4a86","source":{"kind":"arxiv","id":"1611.06940","version":1},"attestation_state":"computed","paper":{"title":"A Framework for Analyzing Resparsification Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Pachocki, Rasmus Kyng, Richard Peng, Sushant Sachdeva","submitted_at":"2016-11-21T18:44:25Z","abstract_excerpt":"A spectral sparsifier of a graph $G$ is a sparser graph $H$ that approximately preserves the quadratic form of $G$, i.e. for all vectors $x$, $x^T L_G x \\approx x^T L_H x$, where $L_G$ and $L_H$ denote the respective graph Laplacians. Spectral sparsifiers generalize cut sparsifiers, and have found many applications in designing graph algorithms. In recent years, there has been interest in computing spectral sparsifiers in semi-streaming and dynamic settings. Natural algorithms in these settings often involve repeated sparsification of a graph, and accumulation of errors across these steps. We "},"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":"1611.06940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T18:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"3bec404a0949f6b77dfc306e4bca947dc2ac9e48e1cbdc8df3dc2f641278b265","abstract_canon_sha256":"e619c2924b5098225ee77e3c1076ef3ea3f7ed903fcc71295f1d84e838c86b52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:32.473170Z","signature_b64":"8a6z8c5P7O2GVPrQoZTrE6C4AY9iROIUqahSo9JQumpF0pE1Ut1A206hAKYSVkruz6RfacFTJnQ42MGqDxVADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28b3881defc11227ab2be1c35d151a8c868191a5fd76ba1b093a7570c3ad4a86","last_reissued_at":"2026-05-18T00:57:32.472542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:32.472542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Framework for Analyzing Resparsification Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Pachocki, Rasmus Kyng, Richard Peng, Sushant Sachdeva","submitted_at":"2016-11-21T18:44:25Z","abstract_excerpt":"A spectral sparsifier of a graph $G$ is a sparser graph $H$ that approximately preserves the quadratic form of $G$, i.e. for all vectors $x$, $x^T L_G x \\approx x^T L_H x$, where $L_G$ and $L_H$ denote the respective graph Laplacians. Spectral sparsifiers generalize cut sparsifiers, and have found many applications in designing graph algorithms. In recent years, there has been interest in computing spectral sparsifiers in semi-streaming and dynamic settings. Natural algorithms in these settings often involve repeated sparsification of a graph, and accumulation of errors across these steps. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06940","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":"1611.06940","created_at":"2026-05-18T00:57:32.472630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06940v1","created_at":"2026-05-18T00:57:32.472630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06940","created_at":"2026-05-18T00:57:32.472630+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCZYQHPPYEJC","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCZYQHPPYEJCPKZL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCZYQHPP","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20078","citing_title":"Improved large-scale graph learning through ridge spectral sparsification","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS","json":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS.json","graph_json":"https://pith.science/api/pith-number/FCZYQHPPYEJCPKZL4HBV2FI2RS/graph.json","events_json":"https://pith.science/api/pith-number/FCZYQHPPYEJCPKZL4HBV2FI2RS/events.json","paper":"https://pith.science/paper/FCZYQHPP"},"agent_actions":{"view_html":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS","download_json":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS.json","view_paper":"https://pith.science/paper/FCZYQHPP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06940&json=true","fetch_graph":"https://pith.science/api/pith-number/FCZYQHPPYEJCPKZL4HBV2FI2RS/graph.json","fetch_events":"https://pith.science/api/pith-number/FCZYQHPPYEJCPKZL4HBV2FI2RS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/action/storage_attestation","attest_author":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/action/author_attestation","sign_citation":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/action/citation_signature","submit_replication":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/action/replication_record"}},"created_at":"2026-05-18T00:57:32.472630+00:00","updated_at":"2026-05-18T00:57:32.472630+00:00"}