{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BKOYPYCEA2TMNEFMST2BV65CUB","short_pith_number":"pith:BKOYPYCE","schema_version":"1.0","canonical_sha256":"0a9d87e04406a6c690ac94f41afba2a05fdd0405bcf3826ba6a9d7d8066aa444","source":{"kind":"arxiv","id":"1604.03703","version":1},"attestation_state":"computed","paper":{"title":"A communication-avoiding parallel algorithm for the symmetric eigenvalue problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler","submitted_at":"2016-04-13T09:36:02Z","abstract_excerpt":"Many large-scale scientific computations require eigenvalue solvers in a scaling regime where efficiency is limited by data movement. We introduce a parallel algorithm for computing the eigenvalues of a dense symmetric matrix, which performs asymptotically less communication than previously known approaches. We provide analysis in the Bulk Synchronous Parallel (BSP) model with additional consideration for communication between a local memory and cache. Given sufficient memory to store $c$ copies of the symmetric matrix, our algorithm requires $\\Theta(\\sqrt{c})$ less interprocessor communicatio"},"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":"1604.03703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-13T09:36:02Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"3c4366bcf357e76f6669c006bdc2477cd0c04269c1a67341cad368f17aade37f","abstract_canon_sha256":"9c7c0105225fd1f66e39df40caa1869afeafbbee7bc63df8d64718d506a5ad74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:59.177099Z","signature_b64":"aIIOljgU6bBTkxL3Bsj/ntqoLqLnCqyQDrPaxIJL9tQb3LHauTbVI5QXLidZ7JjOjS+EaDqYo9Qq7v5XXye3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a9d87e04406a6c690ac94f41afba2a05fdd0405bcf3826ba6a9d7d8066aa444","last_reissued_at":"2026-05-18T01:16:59.176426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:59.176426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A communication-avoiding parallel algorithm for the symmetric eigenvalue problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DC","authors_text":"Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler","submitted_at":"2016-04-13T09:36:02Z","abstract_excerpt":"Many large-scale scientific computations require eigenvalue solvers in a scaling regime where efficiency is limited by data movement. We introduce a parallel algorithm for computing the eigenvalues of a dense symmetric matrix, which performs asymptotically less communication than previously known approaches. We provide analysis in the Bulk Synchronous Parallel (BSP) model with additional consideration for communication between a local memory and cache. Given sufficient memory to store $c$ copies of the symmetric matrix, our algorithm requires $\\Theta(\\sqrt{c})$ less interprocessor communicatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03703","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":"1604.03703","created_at":"2026-05-18T01:16:59.176559+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.03703v1","created_at":"2026-05-18T01:16:59.176559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03703","created_at":"2026-05-18T01:16:59.176559+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKOYPYCEA2TM","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKOYPYCEA2TMNEFM","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKOYPYCE","created_at":"2026-05-18T12:30:07.202191+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/BKOYPYCEA2TMNEFMST2BV65CUB","json":"https://pith.science/pith/BKOYPYCEA2TMNEFMST2BV65CUB.json","graph_json":"https://pith.science/api/pith-number/BKOYPYCEA2TMNEFMST2BV65CUB/graph.json","events_json":"https://pith.science/api/pith-number/BKOYPYCEA2TMNEFMST2BV65CUB/events.json","paper":"https://pith.science/paper/BKOYPYCE"},"agent_actions":{"view_html":"https://pith.science/pith/BKOYPYCEA2TMNEFMST2BV65CUB","download_json":"https://pith.science/pith/BKOYPYCEA2TMNEFMST2BV65CUB.json","view_paper":"https://pith.science/paper/BKOYPYCE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.03703&json=true","fetch_graph":"https://pith.science/api/pith-number/BKOYPYCEA2TMNEFMST2BV65CUB/graph.json","fetch_events":"https://pith.science/api/pith-number/BKOYPYCEA2TMNEFMST2BV65CUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKOYPYCEA2TMNEFMST2BV65CUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKOYPYCEA2TMNEFMST2BV65CUB/action/storage_attestation","attest_author":"https://pith.science/pith/BKOYPYCEA2TMNEFMST2BV65CUB/action/author_attestation","sign_citation":"https://pith.science/pith/BKOYPYCEA2TMNEFMST2BV65CUB/action/citation_signature","submit_replication":"https://pith.science/pith/BKOYPYCEA2TMNEFMST2BV65CUB/action/replication_record"}},"created_at":"2026-05-18T01:16:59.176559+00:00","updated_at":"2026-05-18T01:16:59.176559+00:00"}