{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:II2APJFVAFXIITA5NSQ57FGOM3","short_pith_number":"pith:II2APJFV","canonical_record":{"source":{"id":"1312.1413","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CG","submitted_at":"2013-12-05T02:30:19Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"fc2e145ea358ae5ec64cef30dd7dc83d2dd097946264ddcf25b58d79ab545538","abstract_canon_sha256":"08f10f5c91f6bce9cf8cbc16d1b18681ff06f49fc7e23bc4c49eabf97061a036"},"schema_version":"1.0"},"canonical_sha256":"423407a4b5016e844c1d6ca1df94ce66c85e2a5235306bd67870f0225998329f","source":{"kind":"arxiv","id":"1312.1413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1413","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1413v1","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1413","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"II2APJFVAFXI","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"II2APJFVAFXIITA5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"II2APJFV","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:II2APJFVAFXIITA5NSQ57FGOM3","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1413","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CG","submitted_at":"2013-12-05T02:30:19Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"fc2e145ea358ae5ec64cef30dd7dc83d2dd097946264ddcf25b58d79ab545538","abstract_canon_sha256":"08f10f5c91f6bce9cf8cbc16d1b18681ff06f49fc7e23bc4c49eabf97061a036"},"schema_version":"1.0"},"canonical_sha256":"423407a4b5016e844c1d6ca1df94ce66c85e2a5235306bd67870f0225998329f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:27.398512Z","signature_b64":"3dFRxF4p1lvLHdSo7AAHof1OXFZutLZIEkiOdRrPgFhaVLpbXH7mvFHuHbFmHk+Np/xFi49nKaSGSO/5zJC2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"423407a4b5016e844c1d6ca1df94ce66c85e2a5235306bd67870f0225998329f","last_reissued_at":"2026-05-18T03:05:27.397923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:27.397923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1413","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:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+8Z3qXUsByXezMVbt5rUvMYXNZXfoPefWjq/2h+g4/bUycZ8XXItlSsV1cPZplXGvj5v6jcbwYOFi9oQDIk6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:50:24.915391Z"},"content_sha256":"d094a327144b4252cc19e0d5ff411bf120962f4e94a7861212bea311878b94b7","schema_version":"1.0","event_id":"sha256:d094a327144b4252cc19e0d5ff411bf120962f4e94a7861212bea311878b94b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:II2APJFVAFXIITA5NSQ57FGOM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Subspace Approximation via Greedy Least-Squares","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["math.NA"],"primary_cat":"cs.CG","authors_text":"Felix Krahmer, Mark Iwen","submitted_at":"2013-12-05T02:30:19Z","abstract_excerpt":"In this note, we develop fast and deterministic dimensionality reduction techniques for a family of subspace approximation problems. Let $P\\subset \\mathbbm{R}^N$ be a given set of $M$ points. The techniques developed herein find an $O(n \\log M)$-dimensional subspace that is guaranteed to always contain a near-best fit $n$-dimensional hyperplane $\\mathcal{H}$ for $P$ with respect to the cumulative projection error $(\\sum_{{\\bf x} \\in P} \\| {\\bf x} - \\Pi_\\mathcal{H} {\\bf x} \\|^p_2)^{1/p}$, for any chosen $p > 2$. The deterministic algorithm runs in $\\tilde{O} (MN^2)$-time, and can be randomized "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1413","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:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GccHNXwu9mcFh0YiJEnaRpLbnGeyqzlCWkUIocQ1bg/0vhu1cBqTAWfvUUHGQZpyFlgpnKEb6ODX5/lgnrd1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T10:50:24.915761Z"},"content_sha256":"5e9ef74157234d522397a18c0aeeaf225bf1edf8fa877b7741477678c9f052aa","schema_version":"1.0","event_id":"sha256:5e9ef74157234d522397a18c0aeeaf225bf1edf8fa877b7741477678c9f052aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/II2APJFVAFXIITA5NSQ57FGOM3/bundle.json","state_url":"https://pith.science/pith/II2APJFVAFXIITA5NSQ57FGOM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/II2APJFVAFXIITA5NSQ57FGOM3/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-25T10:50:24Z","links":{"resolver":"https://pith.science/pith/II2APJFVAFXIITA5NSQ57FGOM3","bundle":"https://pith.science/pith/II2APJFVAFXIITA5NSQ57FGOM3/bundle.json","state":"https://pith.science/pith/II2APJFVAFXIITA5NSQ57FGOM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/II2APJFVAFXIITA5NSQ57FGOM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:II2APJFVAFXIITA5NSQ57FGOM3","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":"08f10f5c91f6bce9cf8cbc16d1b18681ff06f49fc7e23bc4c49eabf97061a036","cross_cats_sorted":["math.NA"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CG","submitted_at":"2013-12-05T02:30:19Z","title_canon_sha256":"fc2e145ea358ae5ec64cef30dd7dc83d2dd097946264ddcf25b58d79ab545538"},"schema_version":"1.0","source":{"id":"1312.1413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1413","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1413v1","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1413","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"II2APJFVAFXI","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"II2APJFVAFXIITA5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"II2APJFV","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:5e9ef74157234d522397a18c0aeeaf225bf1edf8fa877b7741477678c9f052aa","target":"graph","created_at":"2026-05-18T03:05:27Z","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":"In this note, we develop fast and deterministic dimensionality reduction techniques for a family of subspace approximation problems. Let $P\\subset \\mathbbm{R}^N$ be a given set of $M$ points. The techniques developed herein find an $O(n \\log M)$-dimensional subspace that is guaranteed to always contain a near-best fit $n$-dimensional hyperplane $\\mathcal{H}$ for $P$ with respect to the cumulative projection error $(\\sum_{{\\bf x} \\in P} \\| {\\bf x} - \\Pi_\\mathcal{H} {\\bf x} \\|^p_2)^{1/p}$, for any chosen $p > 2$. The deterministic algorithm runs in $\\tilde{O} (MN^2)$-time, and can be randomized ","authors_text":"Felix Krahmer, Mark Iwen","cross_cats":["math.NA"],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CG","submitted_at":"2013-12-05T02:30:19Z","title":"Fast Subspace Approximation via Greedy Least-Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1413","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:d094a327144b4252cc19e0d5ff411bf120962f4e94a7861212bea311878b94b7","target":"record","created_at":"2026-05-18T03:05:27Z","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":"08f10f5c91f6bce9cf8cbc16d1b18681ff06f49fc7e23bc4c49eabf97061a036","cross_cats_sorted":["math.NA"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.CG","submitted_at":"2013-12-05T02:30:19Z","title_canon_sha256":"fc2e145ea358ae5ec64cef30dd7dc83d2dd097946264ddcf25b58d79ab545538"},"schema_version":"1.0","source":{"id":"1312.1413","kind":"arxiv","version":1}},"canonical_sha256":"423407a4b5016e844c1d6ca1df94ce66c85e2a5235306bd67870f0225998329f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"423407a4b5016e844c1d6ca1df94ce66c85e2a5235306bd67870f0225998329f","first_computed_at":"2026-05-18T03:05:27.397923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:27.397923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3dFRxF4p1lvLHdSo7AAHof1OXFZutLZIEkiOdRrPgFhaVLpbXH7mvFHuHbFmHk+Np/xFi49nKaSGSO/5zJC2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:27.398512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d094a327144b4252cc19e0d5ff411bf120962f4e94a7861212bea311878b94b7","sha256:5e9ef74157234d522397a18c0aeeaf225bf1edf8fa877b7741477678c9f052aa"],"state_sha256":"13d213565761ad70d4e3d353a47a8a138abbe5d0b643bcc322a0c28a8a099feb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TH/l1bu86bzhMPqpV6rZm1qC0JmZkjFsQfB2HuUHBv4Xfe8Td9Gv03Pol17lkt/qiGu7VtmT+K1ao/OzFOdHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T10:50:24.917746Z","bundle_sha256":"626a85c384dbeaea0db65ab670b955198e5e7d0a214ac61a353eef395305cf0a"}}