{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GYIJ2AVSN7544UFYTEUR74BMBL","short_pith_number":"pith:GYIJ2AVS","schema_version":"1.0","canonical_sha256":"36109d02b26ffbce50b899291ff02c0ad4a67b900b42a6fde36a9373fa847a9f","source":{"kind":"arxiv","id":"1609.03769","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Lazaric, Daniele Calandriello, Michal Valko","submitted_at":"2016-09-13T11:18:03Z","abstract_excerpt":"We derive a new proof to show that the incremental resparsification algorithm proposed by Kelner and Levin (2013) produces a spectral sparsifier in high probability. We rigorously take into account the dependencies across subsequent resparsifications using martingale inequalities, fixing a flaw in the original analysis."},"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":"1609.03769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-09-13T11:18:03Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"af590f90204a1aa49e34d68cdb07736af8cefeefcf476c57f97229bdda85d30f","abstract_canon_sha256":"fe3019041c7495192f60c1cc9e8c08fc594d5bfddad31bd4c21f2eef449e740b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:42.478471Z","signature_b64":"Y0Ao7otReEG5nP6GWcWbFr5iZ7ucmk2RmbduN+zUScWc4tVAjeXauycf4R6AqIjVxJrTmNX4IzOsTIpwgV2ICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36109d02b26ffbce50b899291ff02c0ad4a67b900b42a6fde36a9373fa847a9f","last_reissued_at":"2026-05-18T01:04:42.477987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:42.477987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alessandro Lazaric, Daniele Calandriello, Michal Valko","submitted_at":"2016-09-13T11:18:03Z","abstract_excerpt":"We derive a new proof to show that the incremental resparsification algorithm proposed by Kelner and Levin (2013) produces a spectral sparsifier in high probability. We rigorously take into account the dependencies across subsequent resparsifications using martingale inequalities, fixing a flaw in the original analysis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03769","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":"1609.03769","created_at":"2026-05-18T01:04:42.478061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03769v1","created_at":"2026-05-18T01:04:42.478061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03769","created_at":"2026-05-18T01:04:42.478061+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYIJ2AVSN754","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYIJ2AVSN7544UFY","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYIJ2AVS","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.20078","citing_title":"Improved large-scale graph learning through ridge spectral sparsification","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYIJ2AVSN7544UFYTEUR74BMBL","json":"https://pith.science/pith/GYIJ2AVSN7544UFYTEUR74BMBL.json","graph_json":"https://pith.science/api/pith-number/GYIJ2AVSN7544UFYTEUR74BMBL/graph.json","events_json":"https://pith.science/api/pith-number/GYIJ2AVSN7544UFYTEUR74BMBL/events.json","paper":"https://pith.science/paper/GYIJ2AVS"},"agent_actions":{"view_html":"https://pith.science/pith/GYIJ2AVSN7544UFYTEUR74BMBL","download_json":"https://pith.science/pith/GYIJ2AVSN7544UFYTEUR74BMBL.json","view_paper":"https://pith.science/paper/GYIJ2AVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03769&json=true","fetch_graph":"https://pith.science/api/pith-number/GYIJ2AVSN7544UFYTEUR74BMBL/graph.json","fetch_events":"https://pith.science/api/pith-number/GYIJ2AVSN7544UFYTEUR74BMBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYIJ2AVSN7544UFYTEUR74BMBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYIJ2AVSN7544UFYTEUR74BMBL/action/storage_attestation","attest_author":"https://pith.science/pith/GYIJ2AVSN7544UFYTEUR74BMBL/action/author_attestation","sign_citation":"https://pith.science/pith/GYIJ2AVSN7544UFYTEUR74BMBL/action/citation_signature","submit_replication":"https://pith.science/pith/GYIJ2AVSN7544UFYTEUR74BMBL/action/replication_record"}},"created_at":"2026-05-18T01:04:42.478061+00:00","updated_at":"2026-05-18T01:04:42.478061+00:00"}