{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:O7RILHRKTTL4GIFVAZZBDSWUPB","short_pith_number":"pith:O7RILHRK","schema_version":"1.0","canonical_sha256":"77e2859e2a9cd7c320b5067211cad4784cb512cb2b6c307cef3c8a3da692ce38","source":{"kind":"arxiv","id":"1611.01569","version":3},"attestation_state":"computed","paper":{"title":"A Two Pronged Progress in Structured Dense Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Albert Gu, Atri Rudra, Christopher De Sa, Christopher R\\'e, Rohan Puttagunta","submitted_at":"2016-11-04T23:33:41Z","abstract_excerpt":"Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\\in\\mathbb{F}^{N\\times N}$ and a vector $b$, it is known that in the worst case $\\Theta(N^2)$ operations over $\\mathbb{F}$ are needed to compute $Ab$. A broad question is to identify classes of structured dense matrices that can be represented with $O(N)$ parameters, and for which matrix-vector multiplication can be performed sub-quadratically. One such class of structured matrices is the orthogonal polynomial transforms, whose rows correspond to a family of orthogonal polynomials. Other well kno"},"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.01569","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-04T23:33:41Z","cross_cats_sorted":[],"title_canon_sha256":"e874798ff5a471000b0d6610528626678fe22f92db3530b0db5b90ac72fa9bcb","abstract_canon_sha256":"9087cfe22e7139bfb6f5774ba796de6f0cd16b50da16a5bdee81cb9c13c7be36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:17.438431Z","signature_b64":"1kVCKDLkbpANybjPyAqBN5ZQeeFTmSNhiWlfmw7Svsqx0GFxZYSrmSfzm4BiUW23P52U3ktjBD8TB1zU8u+ZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77e2859e2a9cd7c320b5067211cad4784cb512cb2b6c307cef3c8a3da692ce38","last_reissued_at":"2026-05-18T00:30:17.437612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:17.437612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Two Pronged Progress in Structured Dense Matrix Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Albert Gu, Atri Rudra, Christopher De Sa, Christopher R\\'e, Rohan Puttagunta","submitted_at":"2016-11-04T23:33:41Z","abstract_excerpt":"Matrix-vector multiplication is one of the most fundamental computing primitives. Given a matrix $A\\in\\mathbb{F}^{N\\times N}$ and a vector $b$, it is known that in the worst case $\\Theta(N^2)$ operations over $\\mathbb{F}$ are needed to compute $Ab$. A broad question is to identify classes of structured dense matrices that can be represented with $O(N)$ parameters, and for which matrix-vector multiplication can be performed sub-quadratically. One such class of structured matrices is the orthogonal polynomial transforms, whose rows correspond to a family of orthogonal polynomials. Other well kno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01569","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":"1611.01569","created_at":"2026-05-18T00:30:17.437737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01569v3","created_at":"2026-05-18T00:30:17.437737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01569","created_at":"2026-05-18T00:30:17.437737+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7RILHRKTTL4","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7RILHRKTTL4GIFV","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7RILHRK","created_at":"2026-05-18T12:30:36.002864+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/O7RILHRKTTL4GIFVAZZBDSWUPB","json":"https://pith.science/pith/O7RILHRKTTL4GIFVAZZBDSWUPB.json","graph_json":"https://pith.science/api/pith-number/O7RILHRKTTL4GIFVAZZBDSWUPB/graph.json","events_json":"https://pith.science/api/pith-number/O7RILHRKTTL4GIFVAZZBDSWUPB/events.json","paper":"https://pith.science/paper/O7RILHRK"},"agent_actions":{"view_html":"https://pith.science/pith/O7RILHRKTTL4GIFVAZZBDSWUPB","download_json":"https://pith.science/pith/O7RILHRKTTL4GIFVAZZBDSWUPB.json","view_paper":"https://pith.science/paper/O7RILHRK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01569&json=true","fetch_graph":"https://pith.science/api/pith-number/O7RILHRKTTL4GIFVAZZBDSWUPB/graph.json","fetch_events":"https://pith.science/api/pith-number/O7RILHRKTTL4GIFVAZZBDSWUPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7RILHRKTTL4GIFVAZZBDSWUPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7RILHRKTTL4GIFVAZZBDSWUPB/action/storage_attestation","attest_author":"https://pith.science/pith/O7RILHRKTTL4GIFVAZZBDSWUPB/action/author_attestation","sign_citation":"https://pith.science/pith/O7RILHRKTTL4GIFVAZZBDSWUPB/action/citation_signature","submit_replication":"https://pith.science/pith/O7RILHRKTTL4GIFVAZZBDSWUPB/action/replication_record"}},"created_at":"2026-05-18T00:30:17.437737+00:00","updated_at":"2026-05-18T00:30:17.437737+00:00"}