{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JFVXHUIF5ZLQZC76G5KMOVR2GP","short_pith_number":"pith:JFVXHUIF","schema_version":"1.0","canonical_sha256":"496b73d105ee570c8bfe3754c7563a33e0b08d89be9def00016fabfaa37b4d5d","source":{"kind":"arxiv","id":"1704.04163","version":3},"attestation_state":"computed","paper":{"title":"Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Cameron Musco, David P. Woodruff, Praneeth Netrapalli, Shashanka Ubaru","submitted_at":"2017-04-13T14:55:23Z","abstract_excerpt":"Understanding the singular value spectrum of a matrix $A \\in \\mathbb{R}^{n \\times n}$ is a fundamental task in countless applications. In matrix multiplication time, it is possible to perform a full SVD and directly compute the singular values $\\sigma_1,...,\\sigma_n$. However, little is known about algorithms that break this runtime barrier.\n  Using tools from stochastic trace estimation, polynomial approximation, and fast system solvers, we show how to efficiently isolate different ranges of $A$'s spectrum and approximate the number of singular values in these ranges. We thus effectively comp"},"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":"1704.04163","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-13T14:55:23Z","cross_cats_sorted":["cs.LG","math.NA"],"title_canon_sha256":"16f77dff046b9d0acbc5bbfa8a4382210e65c559d8c6d2f285a9b3973d893ad7","abstract_canon_sha256":"d0c42c331eb1a776a8f944025002eca028b48b310c17c6648f35312de93798a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:03.382219Z","signature_b64":"m3Nq3Z/KzTYFMyy0ukAfcn/xAb/rBhBmP10UpA0rarwXa29QeZJjdmAuBOhDvvFZKs9+pgtcPRjU3yLlj8EoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"496b73d105ee570c8bfe3754c7563a33e0b08d89be9def00016fabfaa37b4d5d","last_reissued_at":"2026-05-17T23:57:03.381726Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:03.381726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.NA"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Cameron Musco, David P. Woodruff, Praneeth Netrapalli, Shashanka Ubaru","submitted_at":"2017-04-13T14:55:23Z","abstract_excerpt":"Understanding the singular value spectrum of a matrix $A \\in \\mathbb{R}^{n \\times n}$ is a fundamental task in countless applications. In matrix multiplication time, it is possible to perform a full SVD and directly compute the singular values $\\sigma_1,...,\\sigma_n$. However, little is known about algorithms that break this runtime barrier.\n  Using tools from stochastic trace estimation, polynomial approximation, and fast system solvers, we show how to efficiently isolate different ranges of $A$'s spectrum and approximate the number of singular values in these ranges. We thus effectively comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04163","kind":"arxiv","version":3},"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":"1704.04163","created_at":"2026-05-17T23:57:03.381809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04163v3","created_at":"2026-05-17T23:57:03.381809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04163","created_at":"2026-05-17T23:57:03.381809+00:00"},{"alias_kind":"pith_short_12","alias_value":"JFVXHUIF5ZLQ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JFVXHUIF5ZLQZC76","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JFVXHUIF","created_at":"2026-05-18T12:31:24.725408+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/JFVXHUIF5ZLQZC76G5KMOVR2GP","json":"https://pith.science/pith/JFVXHUIF5ZLQZC76G5KMOVR2GP.json","graph_json":"https://pith.science/api/pith-number/JFVXHUIF5ZLQZC76G5KMOVR2GP/graph.json","events_json":"https://pith.science/api/pith-number/JFVXHUIF5ZLQZC76G5KMOVR2GP/events.json","paper":"https://pith.science/paper/JFVXHUIF"},"agent_actions":{"view_html":"https://pith.science/pith/JFVXHUIF5ZLQZC76G5KMOVR2GP","download_json":"https://pith.science/pith/JFVXHUIF5ZLQZC76G5KMOVR2GP.json","view_paper":"https://pith.science/paper/JFVXHUIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04163&json=true","fetch_graph":"https://pith.science/api/pith-number/JFVXHUIF5ZLQZC76G5KMOVR2GP/graph.json","fetch_events":"https://pith.science/api/pith-number/JFVXHUIF5ZLQZC76G5KMOVR2GP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JFVXHUIF5ZLQZC76G5KMOVR2GP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JFVXHUIF5ZLQZC76G5KMOVR2GP/action/storage_attestation","attest_author":"https://pith.science/pith/JFVXHUIF5ZLQZC76G5KMOVR2GP/action/author_attestation","sign_citation":"https://pith.science/pith/JFVXHUIF5ZLQZC76G5KMOVR2GP/action/citation_signature","submit_replication":"https://pith.science/pith/JFVXHUIF5ZLQZC76G5KMOVR2GP/action/replication_record"}},"created_at":"2026-05-17T23:57:03.381809+00:00","updated_at":"2026-05-17T23:57:03.381809+00:00"}