{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:WMUWKKTKFLYFLSHGDCU67T5UY4","short_pith_number":"pith:WMUWKKTK","schema_version":"1.0","canonical_sha256":"b329652a6a2af055c8e618a9efcfb4c71e2dcefb78a5c68180dbdb40a49ea1b6","source":{"kind":"arxiv","id":"1011.3077","version":1},"attestation_state":"computed","paper":{"title":"Minimizing Communication for Eigenproblems and the Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MS","cs.NA"],"primary_cat":"math.NA","authors_text":"Grey Ballard, Ioana Dumitriu, James Demmel","submitted_at":"2010-11-13T00:18:02Z","abstract_excerpt":"Algorithms have two costs: arithmetic and communication. The latter represents the cost of moving data, either between levels of a memory hierarchy, or between processors over a network. Communication often dominates arithmetic and represents a rapidly increasing proportion of the total cost, so we seek algorithms that minimize communication. In \\cite{BDHS10} lower bounds were presented on the amount of communication required for essentially all $O(n^3)$-like algorithms for linear algebra, including eigenvalue problems and the SVD. Conventional algorithms, including those currently implemented"},"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":"1011.3077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-11-13T00:18:02Z","cross_cats_sorted":["cs.DC","cs.MS","cs.NA"],"title_canon_sha256":"720668e2ad9b8986112185af7725987abc9ee61ae98664abec56129e9989637d","abstract_canon_sha256":"277da2c46372b58db01acaa12d0fc8852b8d59dbb8991024f22ab4d8cbc0b55a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:56.549082Z","signature_b64":"mAhI3zyOWQFLu9ISYzZxfUPv09kN6hSAqfcQaOjnz3+mD/f6Gq8fpwkjM7R5qVtDul7ZOaFw3+tKUAZ01sjGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b329652a6a2af055c8e618a9efcfb4c71e2dcefb78a5c68180dbdb40a49ea1b6","last_reissued_at":"2026-05-18T04:35:56.548581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:56.548581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing Communication for Eigenproblems and the Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MS","cs.NA"],"primary_cat":"math.NA","authors_text":"Grey Ballard, Ioana Dumitriu, James Demmel","submitted_at":"2010-11-13T00:18:02Z","abstract_excerpt":"Algorithms have two costs: arithmetic and communication. The latter represents the cost of moving data, either between levels of a memory hierarchy, or between processors over a network. Communication often dominates arithmetic and represents a rapidly increasing proportion of the total cost, so we seek algorithms that minimize communication. In \\cite{BDHS10} lower bounds were presented on the amount of communication required for essentially all $O(n^3)$-like algorithms for linear algebra, including eigenvalue problems and the SVD. Conventional algorithms, including those currently implemented"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3077","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":"1011.3077","created_at":"2026-05-18T04:35:56.548667+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3077v1","created_at":"2026-05-18T04:35:56.548667+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3077","created_at":"2026-05-18T04:35:56.548667+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMUWKKTKFLYF","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMUWKKTKFLYFLSHG","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMUWKKTK","created_at":"2026-05-18T12:26:17.028572+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/WMUWKKTKFLYFLSHGDCU67T5UY4","json":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4.json","graph_json":"https://pith.science/api/pith-number/WMUWKKTKFLYFLSHGDCU67T5UY4/graph.json","events_json":"https://pith.science/api/pith-number/WMUWKKTKFLYFLSHGDCU67T5UY4/events.json","paper":"https://pith.science/paper/WMUWKKTK"},"agent_actions":{"view_html":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4","download_json":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4.json","view_paper":"https://pith.science/paper/WMUWKKTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3077&json=true","fetch_graph":"https://pith.science/api/pith-number/WMUWKKTKFLYFLSHGDCU67T5UY4/graph.json","fetch_events":"https://pith.science/api/pith-number/WMUWKKTKFLYFLSHGDCU67T5UY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/action/storage_attestation","attest_author":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/action/author_attestation","sign_citation":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/action/citation_signature","submit_replication":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/action/replication_record"}},"created_at":"2026-05-18T04:35:56.548667+00:00","updated_at":"2026-05-18T04:35:56.548667+00:00"}