{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:K3BPGUP7B4LOXSZWPKTLTLNYSM","short_pith_number":"pith:K3BPGUP7","canonical_record":{"source":{"id":"0708.3696","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2007-08-27T23:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"9ec6cd55963ca00f1bfab9b8fd515a0b09de0125fdfd496a542f7d6a9972a04b","abstract_canon_sha256":"6237e2e5e050febceffec5d2e8e42834bc8eb1a4601c75f07ee7c6740895e2ea"},"schema_version":"1.0"},"canonical_sha256":"56c2f351ff0f16ebcb367aa6b9adb8931d949e65b14daf01c8442ebfe13e345f","source":{"kind":"arxiv","id":"0708.3696","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0708.3696","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"0708.3696v1","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.3696","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"K3BPGUP7B4LO","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"pith_short_16","alias_value":"K3BPGUP7B4LOXSZW","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"pith_short_8","alias_value":"K3BPGUP7","created_at":"2026-07-04T15:03:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:K3BPGUP7B4LOXSZWPKTLTLNYSM","target":"record","payload":{"canonical_record":{"source":{"id":"0708.3696","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2007-08-27T23:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"9ec6cd55963ca00f1bfab9b8fd515a0b09de0125fdfd496a542f7d6a9972a04b","abstract_canon_sha256":"6237e2e5e050febceffec5d2e8e42834bc8eb1a4601c75f07ee7c6740895e2ea"},"schema_version":"1.0"},"canonical_sha256":"56c2f351ff0f16ebcb367aa6b9adb8931d949e65b14daf01c8442ebfe13e345f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:03:51.561723Z","signature_b64":"Uk8w0CWQxPdYehc5nFssMjduuHpvfELrL3raE+cchZNy+nDqrCmzOlCMffHSduWt5zdHp9yVuhlBMWlVMaAODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56c2f351ff0f16ebcb367aa6b9adb8931d949e65b14daf01c8442ebfe13e345f","last_reissued_at":"2026-07-04T15:03:51.561374Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:03:51.561374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0708.3696","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-07-04T15:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EsPi5pWc38ihwjGKa7ffGbdEQ8nkbvv7IYbgDbUnQq88Nq9PaNmRudRZc64ATvq8Xo8YPIK6q/ZkITbGdhB9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T21:00:53.009764Z"},"content_sha256":"5abae03ac38a52f6fc37bb752bc4e7c86c1c27f721112df379c7aed7ccdbaf39","schema_version":"1.0","event_id":"sha256:5abae03ac38a52f6fc37bb752bc4e7c86c1c27f721112df379c7aed7ccdbaf39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:K3BPGUP7B4LOXSZWPKTLTLNYSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relative-Error CUR Matrix Decompositions","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael W. Mahoney, Petros Drineas, S. Muthukrishnan","submitted_at":"2007-08-27T23:34:50Z","abstract_excerpt":"Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of ``components.'' Typically, these components are linear combinations of the rows and columns of the matrix, and are thus difficult to interpret in terms of the original features of the input data. In this paper, we propose and study matrix approximations that are explicitly expressed in terms of a small number of columns and/or rows of the data matrix, and thereby more amenable to interpretation in terms of the original data. Our main algorithmic results are two randomized algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.3696","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0708.3696/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:03:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D1DUOL9eFlTRqGzlpmFV7/XnnLLpipzEo9nGNSbjCMxw3NqWb9qovenQpt4mDuMLakOGNzewzkMkr5glxMJKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T21:00:53.010136Z"},"content_sha256":"3137c5eb0548eb7d40c37756ea41b0a9264e627552c8d29535a7fcaf0628e66d","schema_version":"1.0","event_id":"sha256:3137c5eb0548eb7d40c37756ea41b0a9264e627552c8d29535a7fcaf0628e66d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3BPGUP7B4LOXSZWPKTLTLNYSM/bundle.json","state_url":"https://pith.science/pith/K3BPGUP7B4LOXSZWPKTLTLNYSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3BPGUP7B4LOXSZWPKTLTLNYSM/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-07-04T21:00:53Z","links":{"resolver":"https://pith.science/pith/K3BPGUP7B4LOXSZWPKTLTLNYSM","bundle":"https://pith.science/pith/K3BPGUP7B4LOXSZWPKTLTLNYSM/bundle.json","state":"https://pith.science/pith/K3BPGUP7B4LOXSZWPKTLTLNYSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3BPGUP7B4LOXSZWPKTLTLNYSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:K3BPGUP7B4LOXSZWPKTLTLNYSM","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":"6237e2e5e050febceffec5d2e8e42834bc8eb1a4601c75f07ee7c6740895e2ea","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2007-08-27T23:34:50Z","title_canon_sha256":"9ec6cd55963ca00f1bfab9b8fd515a0b09de0125fdfd496a542f7d6a9972a04b"},"schema_version":"1.0","source":{"id":"0708.3696","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0708.3696","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"arxiv_version","alias_value":"0708.3696v1","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.3696","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"pith_short_12","alias_value":"K3BPGUP7B4LO","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"pith_short_16","alias_value":"K3BPGUP7B4LOXSZW","created_at":"2026-07-04T15:03:51Z"},{"alias_kind":"pith_short_8","alias_value":"K3BPGUP7","created_at":"2026-07-04T15:03:51Z"}],"graph_snapshots":[{"event_id":"sha256:3137c5eb0548eb7d40c37756ea41b0a9264e627552c8d29535a7fcaf0628e66d","target":"graph","created_at":"2026-07-04T15:03:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0708.3696/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of ``components.'' Typically, these components are linear combinations of the rows and columns of the matrix, and are thus difficult to interpret in terms of the original features of the input data. In this paper, we propose and study matrix approximations that are explicitly expressed in terms of a small number of columns and/or rows of the data matrix, and thereby more amenable to interpretation in terms of the original data. Our main algorithmic results are two randomized algor","authors_text":"Michael W. Mahoney, Petros Drineas, S. Muthukrishnan","cross_cats":[],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2007-08-27T23:34:50Z","title":"Relative-Error CUR Matrix Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.3696","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:5abae03ac38a52f6fc37bb752bc4e7c86c1c27f721112df379c7aed7ccdbaf39","target":"record","created_at":"2026-07-04T15:03:51Z","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":"6237e2e5e050febceffec5d2e8e42834bc8eb1a4601c75f07ee7c6740895e2ea","cross_cats_sorted":[],"license":"","primary_cat":"cs.DS","submitted_at":"2007-08-27T23:34:50Z","title_canon_sha256":"9ec6cd55963ca00f1bfab9b8fd515a0b09de0125fdfd496a542f7d6a9972a04b"},"schema_version":"1.0","source":{"id":"0708.3696","kind":"arxiv","version":1}},"canonical_sha256":"56c2f351ff0f16ebcb367aa6b9adb8931d949e65b14daf01c8442ebfe13e345f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56c2f351ff0f16ebcb367aa6b9adb8931d949e65b14daf01c8442ebfe13e345f","first_computed_at":"2026-07-04T15:03:51.561374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:03:51.561374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uk8w0CWQxPdYehc5nFssMjduuHpvfELrL3raE+cchZNy+nDqrCmzOlCMffHSduWt5zdHp9yVuhlBMWlVMaAODQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:03:51.561723Z","signed_message":"canonical_sha256_bytes"},"source_id":"0708.3696","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5abae03ac38a52f6fc37bb752bc4e7c86c1c27f721112df379c7aed7ccdbaf39","sha256:3137c5eb0548eb7d40c37756ea41b0a9264e627552c8d29535a7fcaf0628e66d"],"state_sha256":"d8f266231f55ec53037cec96300782f9361c345b93c9ede3d0ba2d857d655c4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YgKmVkToh/mR5bsbfI7uRQ5DchbkZE7xu/xAszDqs53zw/ioFiXiADdu6SMZIWlRqND7WxT/DFx/vt360RRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T21:00:53.012354Z","bundle_sha256":"4a07e7d960a8386ab708851546b31c9edd8c2f117d3e46291e97ac78773e1369"}}