{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:P7YXEQEM5LMSRJW2HJKIVYLLBU","short_pith_number":"pith:P7YXEQEM","canonical_record":{"source":{"id":"1703.06065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T16:08:23Z","cross_cats_sorted":["cs.DC","cs.DS","cs.LG"],"title_canon_sha256":"ceec936cdcea2f2b7d41d013839b3d4386e07da0c8af08601328d03b6d892dd1","abstract_canon_sha256":"da3fb4dd024fe19d935c3a3c0de73e31ce09904c6643ff3b99183ee753ceaad3"},"schema_version":"1.0"},"canonical_sha256":"7ff172408cead928a6da3a548ae16b0d354be4c23d12c91c6abfabda1c2049e2","source":{"kind":"arxiv","id":"1703.06065","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06065","created_at":"2026-05-18T00:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06065v2","created_at":"2026-05-18T00:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06065","created_at":"2026-05-18T00:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"P7YXEQEM5LMS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P7YXEQEM5LMSRJW2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P7YXEQEM","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:P7YXEQEM5LMSRJW2HJKIVYLLBU","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T16:08:23Z","cross_cats_sorted":["cs.DC","cs.DS","cs.LG"],"title_canon_sha256":"ceec936cdcea2f2b7d41d013839b3d4386e07da0c8af08601328d03b6d892dd1","abstract_canon_sha256":"da3fb4dd024fe19d935c3a3c0de73e31ce09904c6643ff3b99183ee753ceaad3"},"schema_version":"1.0"},"canonical_sha256":"7ff172408cead928a6da3a548ae16b0d354be4c23d12c91c6abfabda1c2049e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:19.016543Z","signature_b64":"oXAO9TFsLSB2y/J67bBW+X0UHTjnigJOMLWcwF9ygK6NXrnbKbdtW0xu1mvfKAclAn3XTv3qFvkpxaJ/ftrxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ff172408cead928a6da3a548ae16b0d354be4c23d12c91c6abfabda1c2049e2","last_reissued_at":"2026-05-18T00:11:19.015765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:19.015765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06065","source_version":2,"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-18T00:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5MK7DV5zsozY4RaiTOE+MEqWSTXwjNe4JJZyGdKkXptUv1DC/wEvb/2YicasxUTDmlQAxqkhBc0ysO2awHVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:01:25.205549Z"},"content_sha256":"180a37870bdf1d614ed965a129a205856d77ba64d7ce7fe4939e0de157101874","schema_version":"1.0","event_id":"sha256:180a37870bdf1d614ed965a129a205856d77ba64d7ce7fe4939e0de157101874"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:P7YXEQEM5LMSRJW2HJKIVYLLBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block CUR: Decomposing Matrices using Groups of Columns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Brian Eriksson, Kevin S. Xu, Swayambhoo Jain, Urvashi Oswal","submitted_at":"2017-03-17T16:08:23Z","abstract_excerpt":"A common problem in large-scale data analysis is to approximate a matrix using a combination of specifically sampled rows and columns, known as CUR decomposition. Unfortunately, in many real-world environments, the ability to sample specific individual rows or columns of the matrix is limited by either system constraints or cost. In this paper, we consider matrix approximation by sampling predefined \\emph{blocks} of columns (or rows) from the matrix. We present an algorithm for sampling useful column blocks and provide novel guarantees for the quality of the approximation. This algorithm has a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06065","kind":"arxiv","version":2},"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-18T00:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5K84/2PpLNQOF6S5G20VU1wAwhswshCKZV2RoP2/xx7SspccoBKtAJBEJ/oXKhQibOMRZ5jnJKCOmOGPeS3wBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:01:25.206217Z"},"content_sha256":"8e0f78c1d81e700334e94daaa3094758426dd8300269ec7c589e7eda6166dcf3","schema_version":"1.0","event_id":"sha256:8e0f78c1d81e700334e94daaa3094758426dd8300269ec7c589e7eda6166dcf3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7YXEQEM5LMSRJW2HJKIVYLLBU/bundle.json","state_url":"https://pith.science/pith/P7YXEQEM5LMSRJW2HJKIVYLLBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7YXEQEM5LMSRJW2HJKIVYLLBU/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-05-26T10:01:25Z","links":{"resolver":"https://pith.science/pith/P7YXEQEM5LMSRJW2HJKIVYLLBU","bundle":"https://pith.science/pith/P7YXEQEM5LMSRJW2HJKIVYLLBU/bundle.json","state":"https://pith.science/pith/P7YXEQEM5LMSRJW2HJKIVYLLBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7YXEQEM5LMSRJW2HJKIVYLLBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:P7YXEQEM5LMSRJW2HJKIVYLLBU","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":"da3fb4dd024fe19d935c3a3c0de73e31ce09904c6643ff3b99183ee753ceaad3","cross_cats_sorted":["cs.DC","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T16:08:23Z","title_canon_sha256":"ceec936cdcea2f2b7d41d013839b3d4386e07da0c8af08601328d03b6d892dd1"},"schema_version":"1.0","source":{"id":"1703.06065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06065","created_at":"2026-05-18T00:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06065v2","created_at":"2026-05-18T00:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06065","created_at":"2026-05-18T00:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"P7YXEQEM5LMS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"P7YXEQEM5LMSRJW2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"P7YXEQEM","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:8e0f78c1d81e700334e94daaa3094758426dd8300269ec7c589e7eda6166dcf3","target":"graph","created_at":"2026-05-18T00:11: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":"A common problem in large-scale data analysis is to approximate a matrix using a combination of specifically sampled rows and columns, known as CUR decomposition. Unfortunately, in many real-world environments, the ability to sample specific individual rows or columns of the matrix is limited by either system constraints or cost. In this paper, we consider matrix approximation by sampling predefined \\emph{blocks} of columns (or rows) from the matrix. We present an algorithm for sampling useful column blocks and provide novel guarantees for the quality of the approximation. This algorithm has a","authors_text":"Brian Eriksson, Kevin S. Xu, Swayambhoo Jain, Urvashi Oswal","cross_cats":["cs.DC","cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T16:08:23Z","title":"Block CUR: Decomposing Matrices using Groups of Columns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06065","kind":"arxiv","version":2},"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:180a37870bdf1d614ed965a129a205856d77ba64d7ce7fe4939e0de157101874","target":"record","created_at":"2026-05-18T00:11: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":"da3fb4dd024fe19d935c3a3c0de73e31ce09904c6643ff3b99183ee753ceaad3","cross_cats_sorted":["cs.DC","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T16:08:23Z","title_canon_sha256":"ceec936cdcea2f2b7d41d013839b3d4386e07da0c8af08601328d03b6d892dd1"},"schema_version":"1.0","source":{"id":"1703.06065","kind":"arxiv","version":2}},"canonical_sha256":"7ff172408cead928a6da3a548ae16b0d354be4c23d12c91c6abfabda1c2049e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ff172408cead928a6da3a548ae16b0d354be4c23d12c91c6abfabda1c2049e2","first_computed_at":"2026-05-18T00:11:19.015765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:19.015765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oXAO9TFsLSB2y/J67bBW+X0UHTjnigJOMLWcwF9ygK6NXrnbKbdtW0xu1mvfKAclAn3XTv3qFvkpxaJ/ftrxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:19.016543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:180a37870bdf1d614ed965a129a205856d77ba64d7ce7fe4939e0de157101874","sha256:8e0f78c1d81e700334e94daaa3094758426dd8300269ec7c589e7eda6166dcf3"],"state_sha256":"514e85db327acc3afae9d196b3df791d4ebde29b387c09c5ff8bb988f079c032"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3YszWvRXx/u3kCQ2DO27bvS4cQazMe/5uvb9lNDEuslM4EC1kqVgFvx2S5xV5Dz1r5UQ6qgcnoKkGPqoyhTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:01:25.209869Z","bundle_sha256":"3a09fdca7218dd1638145892c8ffa5e3f796c160b4c92edd30841e19c09e90bc"}}