{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:WMUWKKTKFLYFLSHGDCU67T5UY4","short_pith_number":"pith:WMUWKKTK","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"},"canonical_sha256":"b329652a6a2af055c8e618a9efcfb4c71e2dcefb78a5c68180dbdb40a49ea1b6","source":{"kind":"arxiv","id":"1011.3077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3077","created_at":"2026-05-18T04:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3077v1","created_at":"2026-05-18T04:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3077","created_at":"2026-05-18T04:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"WMUWKKTKFLYF","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WMUWKKTKFLYFLSHG","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WMUWKKTK","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:WMUWKKTKFLYFLSHGDCU67T5UY4","target":"record","payload":{"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"},"canonical_sha256":"b329652a6a2af055c8e618a9efcfb4c71e2dcefb78a5c68180dbdb40a49ea1b6","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"},"source_kind":"arxiv","source_id":"1011.3077","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:35:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lzqWVpvYb1pfN48C69fsxLHO3+xzOzqfnXFrbrjdHCXjv27Vm0zLzLeUOMg18K7hmQ9u13YJWJcNPCf87SLxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:39:56.293604Z"},"content_sha256":"f265055b47dbfb59a225dbb1965276454588a1ed6c06bb143b1a7da8f6a54b0d","schema_version":"1.0","event_id":"sha256:f265055b47dbfb59a225dbb1965276454588a1ed6c06bb143b1a7da8f6a54b0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:WMUWKKTKFLYFLSHGDCU67T5UY4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:35:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j6+n1vqozoFfx+T1LJAsSfwdFkioIw6wby+4BJOtsntZgs+pOa0IQPy2AM2AqJpFZl9tS588Kf6Uu5lRjKKTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:39:56.294272Z"},"content_sha256":"8e89ae501148ac15e7afa7c547bf28bef41fa4e505e8c02865377846033dfabc","schema_version":"1.0","event_id":"sha256:8e89ae501148ac15e7afa7c547bf28bef41fa4e505e8c02865377846033dfabc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/bundle.json","state_url":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T01:39:56Z","links":{"resolver":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4","bundle":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/bundle.json","state":"https://pith.science/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMUWKKTKFLYFLSHGDCU67T5UY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:WMUWKKTKFLYFLSHGDCU67T5UY4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"277da2c46372b58db01acaa12d0fc8852b8d59dbb8991024f22ab4d8cbc0b55a","cross_cats_sorted":["cs.DC","cs.MS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-11-13T00:18:02Z","title_canon_sha256":"720668e2ad9b8986112185af7725987abc9ee61ae98664abec56129e9989637d"},"schema_version":"1.0","source":{"id":"1011.3077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3077","created_at":"2026-05-18T04:35:56Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3077v1","created_at":"2026-05-18T04:35:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3077","created_at":"2026-05-18T04:35:56Z"},{"alias_kind":"pith_short_12","alias_value":"WMUWKKTKFLYF","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"WMUWKKTKFLYFLSHG","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"WMUWKKTK","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:8e89ae501148ac15e7afa7c547bf28bef41fa4e505e8c02865377846033dfabc","target":"graph","created_at":"2026-05-18T04:35:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Grey Ballard, Ioana Dumitriu, James Demmel","cross_cats":["cs.DC","cs.MS","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-11-13T00:18:02Z","title":"Minimizing Communication for Eigenproblems and the Singular Value Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3077","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f265055b47dbfb59a225dbb1965276454588a1ed6c06bb143b1a7da8f6a54b0d","target":"record","created_at":"2026-05-18T04:35:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"277da2c46372b58db01acaa12d0fc8852b8d59dbb8991024f22ab4d8cbc0b55a","cross_cats_sorted":["cs.DC","cs.MS","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-11-13T00:18:02Z","title_canon_sha256":"720668e2ad9b8986112185af7725987abc9ee61ae98664abec56129e9989637d"},"schema_version":"1.0","source":{"id":"1011.3077","kind":"arxiv","version":1}},"canonical_sha256":"b329652a6a2af055c8e618a9efcfb4c71e2dcefb78a5c68180dbdb40a49ea1b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b329652a6a2af055c8e618a9efcfb4c71e2dcefb78a5c68180dbdb40a49ea1b6","first_computed_at":"2026-05-18T04:35:56.548581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:56.548581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mAhI3zyOWQFLu9ISYzZxfUPv09kN6hSAqfcQaOjnz3+mD/f6Gq8fpwkjM7R5qVtDul7ZOaFw3+tKUAZ01sjGAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:56.549082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f265055b47dbfb59a225dbb1965276454588a1ed6c06bb143b1a7da8f6a54b0d","sha256:8e89ae501148ac15e7afa7c547bf28bef41fa4e505e8c02865377846033dfabc"],"state_sha256":"fb7d42344b6d1cf7caeb6ba6e05c82f6230e7a5a77e69952bb8d5a98585f9ed8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0Jgds9juscOtR20zQl20K2dki+1BntFn+S6OSTyJBTuaSwL1Kyr2cScNHHG7+sveA6SalwFI1JzafSsdiwvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:39:56.297811Z","bundle_sha256":"b410cc1dde567604e738ca001e0246e57cab9780afe428d0e1c57e4f716410c6"}}