{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:7ECV3ZCQE65EPLTFD6KIUI5DP3","short_pith_number":"pith:7ECV3ZCQ","canonical_record":{"source":{"id":"2406.02910","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-05T04:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"b0034cadafbd6614a5992512e2fd8d7dd5e50ff381eae9269e49b8d0eaf6e166","abstract_canon_sha256":"e45d74d051276e6072cc4b46adc4e6b68c2385535bd2e456df755fc680422741"},"schema_version":"1.0"},"canonical_sha256":"f9055de45027ba47ae651f948a23a37ed5a69568a5f637d6c1e49791463a09a8","source":{"kind":"arxiv","id":"2406.02910","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02910","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02910v1","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02910","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"7ECV3ZCQE65E","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"7ECV3ZCQE65EPLTF","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"7ECV3ZCQ","created_at":"2026-07-05T08:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:7ECV3ZCQE65EPLTFD6KIUI5DP3","target":"record","payload":{"canonical_record":{"source":{"id":"2406.02910","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-05T04:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"b0034cadafbd6614a5992512e2fd8d7dd5e50ff381eae9269e49b8d0eaf6e166","abstract_canon_sha256":"e45d74d051276e6072cc4b46adc4e6b68c2385535bd2e456df755fc680422741"},"schema_version":"1.0"},"canonical_sha256":"f9055de45027ba47ae651f948a23a37ed5a69568a5f637d6c1e49791463a09a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:32.422693Z","signature_b64":"3vUT1zHZN+JX+KpJn5E0k+yXTUNYP8x/BV+ZsPCTUiMz/qVCLsF8JJ0Tyi2szHicGpQ6ocxEEB9U/hCxjILRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9055de45027ba47ae651f948a23a37ed5a69568a5f637d6c1e49791463a09a8","last_reissued_at":"2026-07-05T08:27:32.422195Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:32.422195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.02910","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-05T08:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiWolici1K0nribLWV8gPs0rvq6tLgZx8lBaQIDEElGfQyT6iy3iO8zvMpDiyBOUTxI0gKGm8JkisXLcF+79BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:04:44.054513Z"},"content_sha256":"13010d0b56eede628472030f4d3e0887a2030d4241775f407e820dfeeff97475","schema_version":"1.0","event_id":"sha256:13010d0b56eede628472030f4d3e0887a2030d4241775f407e820dfeeff97475"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:7ECV3ZCQE65EPLTFD6KIUI5DP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-Dimensional Geometric Streaming for Nearly Low Rank Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Hossein Esfandiari, Peilin Zhong, Praneeth Kacham, Vahab Mirrokni","submitted_at":"2024-06-05T04:03:44Z","abstract_excerpt":"We study streaming algorithms for the $\\ell_p$ subspace approximation problem. Given points $a_1, \\ldots, a_n$ as an insertion-only stream and a rank parameter $k$, the $\\ell_p$ subspace approximation problem is to find a $k$-dimensional subspace $V$ such that $(\\sum_{i=1}^n d(a_i, V)^p)^{1/p}$ is minimized, where $d(a, V)$ denotes the Euclidean distance between $a$ and $V$ defined as $\\min_{v \\in V}\\|{a - v}\\|_{\\infty}$. When $p = \\infty$, we need to find a subspace $V$ that minimizes $\\max_i d(a_i, V)$. For $\\ell_{\\infty}$ subspace approximation, we give a deterministic strong coreset constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02910","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/2406.02910/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-05T08:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zmc+aWXkHX1WgqjOy1A4Pr2wEIHTYtJE468poNto4sTMejrC5ApS/5cnkxgAK8Noit+SDC3zfBH9bmL+aNRkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:04:44.055229Z"},"content_sha256":"4118ed395c690b8343eb3cba7edeed7ab8a0d1088194d13819d25c061f197b9d","schema_version":"1.0","event_id":"sha256:4118ed395c690b8343eb3cba7edeed7ab8a0d1088194d13819d25c061f197b9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/bundle.json","state_url":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/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-07T13:04:44Z","links":{"resolver":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3","bundle":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/bundle.json","state":"https://pith.science/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ECV3ZCQE65EPLTFD6KIUI5DP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:7ECV3ZCQE65EPLTFD6KIUI5DP3","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":"e45d74d051276e6072cc4b46adc4e6b68c2385535bd2e456df755fc680422741","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-05T04:03:44Z","title_canon_sha256":"b0034cadafbd6614a5992512e2fd8d7dd5e50ff381eae9269e49b8d0eaf6e166"},"schema_version":"1.0","source":{"id":"2406.02910","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.02910","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"2406.02910v1","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02910","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"7ECV3ZCQE65E","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"7ECV3ZCQE65EPLTF","created_at":"2026-07-05T08:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"7ECV3ZCQ","created_at":"2026-07-05T08:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:4118ed395c690b8343eb3cba7edeed7ab8a0d1088194d13819d25c061f197b9d","target":"graph","created_at":"2026-07-05T08:27:32Z","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/2406.02910/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study streaming algorithms for the $\\ell_p$ subspace approximation problem. Given points $a_1, \\ldots, a_n$ as an insertion-only stream and a rank parameter $k$, the $\\ell_p$ subspace approximation problem is to find a $k$-dimensional subspace $V$ such that $(\\sum_{i=1}^n d(a_i, V)^p)^{1/p}$ is minimized, where $d(a, V)$ denotes the Euclidean distance between $a$ and $V$ defined as $\\min_{v \\in V}\\|{a - v}\\|_{\\infty}$. When $p = \\infty$, we need to find a subspace $V$ that minimizes $\\max_i d(a_i, V)$. For $\\ell_{\\infty}$ subspace approximation, we give a deterministic strong coreset constr","authors_text":"David P. Woodruff, Hossein Esfandiari, Peilin Zhong, Praneeth Kacham, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-05T04:03:44Z","title":"High-Dimensional Geometric Streaming for Nearly Low Rank Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02910","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:13010d0b56eede628472030f4d3e0887a2030d4241775f407e820dfeeff97475","target":"record","created_at":"2026-07-05T08:27:32Z","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":"e45d74d051276e6072cc4b46adc4e6b68c2385535bd2e456df755fc680422741","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-05T04:03:44Z","title_canon_sha256":"b0034cadafbd6614a5992512e2fd8d7dd5e50ff381eae9269e49b8d0eaf6e166"},"schema_version":"1.0","source":{"id":"2406.02910","kind":"arxiv","version":1}},"canonical_sha256":"f9055de45027ba47ae651f948a23a37ed5a69568a5f637d6c1e49791463a09a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9055de45027ba47ae651f948a23a37ed5a69568a5f637d6c1e49791463a09a8","first_computed_at":"2026-07-05T08:27:32.422195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:32.422195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3vUT1zHZN+JX+KpJn5E0k+yXTUNYP8x/BV+ZsPCTUiMz/qVCLsF8JJ0Tyi2szHicGpQ6ocxEEB9U/hCxjILRCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:32.422693Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.02910","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13010d0b56eede628472030f4d3e0887a2030d4241775f407e820dfeeff97475","sha256:4118ed395c690b8343eb3cba7edeed7ab8a0d1088194d13819d25c061f197b9d"],"state_sha256":"fecdb74045194d7b2c1d2657f2c0cb2f815442e56d09ec4a431b4035fc745fd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdlQdlm8xMFhf/AxAU6pjt/HdlS+9ApMEVlXie+cBMacTS0TsDHgnDxJoivUQSjK3Z7RLbQjM0jz4rl7dn0mBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:04:44.058608Z","bundle_sha256":"f20da4faaee8a8e28e67c09052c298310495a5e5a5b4f4107871de353591ad54"}}