{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NIHOE4GPYXQVUAUZDPRYWYHUBO","short_pith_number":"pith:NIHOE4GP","canonical_record":{"source":{"id":"1312.1869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-06T14:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"08b2a532a02964c2b2a02895c67d7aa5cfa74dc0c774e5248246559e07bf6b2b","abstract_canon_sha256":"ac73832730784ed090c714343d4c73b9e4e3d9129737ddab949d2801b4ec8ff2"},"schema_version":"1.0"},"canonical_sha256":"6a0ee270cfc5e15a02991be38b60f40ba63047ca8e8eca6b1397e6898f6dd85b","source":{"kind":"arxiv","id":"1312.1869","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1869","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1869v1","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1869","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"NIHOE4GPYXQV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NIHOE4GPYXQVUAUZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NIHOE4GP","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NIHOE4GPYXQVUAUZDPRYWYHUBO","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-06T14:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"08b2a532a02964c2b2a02895c67d7aa5cfa74dc0c774e5248246559e07bf6b2b","abstract_canon_sha256":"ac73832730784ed090c714343d4c73b9e4e3d9129737ddab949d2801b4ec8ff2"},"schema_version":"1.0"},"canonical_sha256":"6a0ee270cfc5e15a02991be38b60f40ba63047ca8e8eca6b1397e6898f6dd85b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:19.566832Z","signature_b64":"MgFGH9UI3VxU/9Pit7WDtv4l+YJY7nnOIHhfkyddcUEbkVBHinmeyXOx0D41BS6OiOgxE02dEaQc48rcstiFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a0ee270cfc5e15a02991be38b60f40ba63047ca8e8eca6b1397e6898f6dd85b","last_reissued_at":"2026-05-18T03:05:19.566388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:19.566388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1869","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-18T03:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2SbPsVcVqb0ZPRdnOc3HtvJgRUjEM1BokaUpm9wQO2ysTOWZwLpvZtAtvDOPSdVr6tWo/+ZcrTkvJAUjbQ5HBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:07:08.194726Z"},"content_sha256":"e5a8a5528e32c6c41c1bae4169d8f02286688ed1e3fdbc61fdfa10bf32de1311","schema_version":"1.0","event_id":"sha256:e5a8a5528e32c6c41c1bae4169d8f02286688ed1e3fdbc61fdfa10bf32de1311"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NIHOE4GPYXQVUAUZDPRYWYHUBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel inversion of huge covariance matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Anjishnu Banerjee, David Dunson, Joshua Vogelstein","submitted_at":"2013-12-06T14:14:31Z","abstract_excerpt":"An extremely common bottleneck encountered in statistical learning algorithms is inversion of huge covariance matrices, examples being in evaluating Gaussian likelihoods for a large number of data points. We propose general parallel algorithms for inverting positive definite matrices, which are nearly rank deficient. Such matrix inversions are needed in Gaussian process computations, among other settings, and remain a bottleneck even with the increasing literature on low rank approximations. We propose a general class of algorithms for parallelizing computations to dramatically speed up comput"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1869","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-18T03:05:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1gArqeoWe5+X0uI8q5Do3f8IWceK1iVp3H87jxwKma+IZsEyEazpI6Fo4G5Qwca/OVgu11g9sUMbHW19Kq1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:07:08.195067Z"},"content_sha256":"5b2b072302e99b7fba5365ac42c9928e86d43391a9c38926bec9af7243090ce5","schema_version":"1.0","event_id":"sha256:5b2b072302e99b7fba5365ac42c9928e86d43391a9c38926bec9af7243090ce5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NIHOE4GPYXQVUAUZDPRYWYHUBO/bundle.json","state_url":"https://pith.science/pith/NIHOE4GPYXQVUAUZDPRYWYHUBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NIHOE4GPYXQVUAUZDPRYWYHUBO/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-05T11:07:08Z","links":{"resolver":"https://pith.science/pith/NIHOE4GPYXQVUAUZDPRYWYHUBO","bundle":"https://pith.science/pith/NIHOE4GPYXQVUAUZDPRYWYHUBO/bundle.json","state":"https://pith.science/pith/NIHOE4GPYXQVUAUZDPRYWYHUBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NIHOE4GPYXQVUAUZDPRYWYHUBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NIHOE4GPYXQVUAUZDPRYWYHUBO","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":"ac73832730784ed090c714343d4c73b9e4e3d9129737ddab949d2801b4ec8ff2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-06T14:14:31Z","title_canon_sha256":"08b2a532a02964c2b2a02895c67d7aa5cfa74dc0c774e5248246559e07bf6b2b"},"schema_version":"1.0","source":{"id":"1312.1869","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1869","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1869v1","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1869","created_at":"2026-05-18T03:05:19Z"},{"alias_kind":"pith_short_12","alias_value":"NIHOE4GPYXQV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NIHOE4GPYXQVUAUZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NIHOE4GP","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:5b2b072302e99b7fba5365ac42c9928e86d43391a9c38926bec9af7243090ce5","target":"graph","created_at":"2026-05-18T03:05:19Z","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":"An extremely common bottleneck encountered in statistical learning algorithms is inversion of huge covariance matrices, examples being in evaluating Gaussian likelihoods for a large number of data points. We propose general parallel algorithms for inverting positive definite matrices, which are nearly rank deficient. Such matrix inversions are needed in Gaussian process computations, among other settings, and remain a bottleneck even with the increasing literature on low rank approximations. We propose a general class of algorithms for parallelizing computations to dramatically speed up comput","authors_text":"Anjishnu Banerjee, David Dunson, Joshua Vogelstein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-06T14:14:31Z","title":"Parallel inversion of huge covariance matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1869","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:e5a8a5528e32c6c41c1bae4169d8f02286688ed1e3fdbc61fdfa10bf32de1311","target":"record","created_at":"2026-05-18T03:05:19Z","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":"ac73832730784ed090c714343d4c73b9e4e3d9129737ddab949d2801b4ec8ff2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2013-12-06T14:14:31Z","title_canon_sha256":"08b2a532a02964c2b2a02895c67d7aa5cfa74dc0c774e5248246559e07bf6b2b"},"schema_version":"1.0","source":{"id":"1312.1869","kind":"arxiv","version":1}},"canonical_sha256":"6a0ee270cfc5e15a02991be38b60f40ba63047ca8e8eca6b1397e6898f6dd85b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a0ee270cfc5e15a02991be38b60f40ba63047ca8e8eca6b1397e6898f6dd85b","first_computed_at":"2026-05-18T03:05:19.566388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:19.566388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MgFGH9UI3VxU/9Pit7WDtv4l+YJY7nnOIHhfkyddcUEbkVBHinmeyXOx0D41BS6OiOgxE02dEaQc48rcstiFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:19.566832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1869","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5a8a5528e32c6c41c1bae4169d8f02286688ed1e3fdbc61fdfa10bf32de1311","sha256:5b2b072302e99b7fba5365ac42c9928e86d43391a9c38926bec9af7243090ce5"],"state_sha256":"cfb957ad4e18aa07415b7e56ac281115c9a08b495e844013b6513855e477449b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKVpgFrOKli1gilSnzL0qvk6mAlsCe1VzecSOj9iQmal4Wq6WQwkrS77jwlL56f27PcpFyLwb7XnLThgZ5OTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:07:08.197117Z","bundle_sha256":"729bf31553856923c2c6e470aa87de7187b24d9599691477a380f6e068c527e3"}}