{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:57PJXYZ5V54QDA7FCNP6N6KYDO","short_pith_number":"pith:57PJXYZ5","canonical_record":{"source":{"id":"1808.02083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-08-06T19:37:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"51ee585b914134368776ca99827b2e25eaa1a2e8f3e20c33366cd9b20a5bfeec","abstract_canon_sha256":"617dd0e0fab45ddd1ca05d96019fc62d9ea56be95bf79149f1cbfa44718fb74f"},"schema_version":"1.0"},"canonical_sha256":"efde9be33daf790183e5135fe6f9581b8ab3dbc3611f4a011c28d46a298beced","source":{"kind":"arxiv","id":"1808.02083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02083","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02083v1","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02083","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"57PJXYZ5V54Q","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"57PJXYZ5V54QDA7F","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"57PJXYZ5","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:57PJXYZ5V54QDA7FCNP6N6KYDO","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-08-06T19:37:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"51ee585b914134368776ca99827b2e25eaa1a2e8f3e20c33366cd9b20a5bfeec","abstract_canon_sha256":"617dd0e0fab45ddd1ca05d96019fc62d9ea56be95bf79149f1cbfa44718fb74f"},"schema_version":"1.0"},"canonical_sha256":"efde9be33daf790183e5135fe6f9581b8ab3dbc3611f4a011c28d46a298beced","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:47.672714Z","signature_b64":"uYlv9TVvo1lydSgKHu6wBf84dNCqq5SaGQPF+dASYfmkv+1xNjGyve9ulZ4aTkWqcUuDCVtmXKTvaBN8lfZuCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efde9be33daf790183e5135fe6f9581b8ab3dbc3611f4a011c28d46a298beced","last_reissued_at":"2026-05-18T00:08:47.672148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:47.672148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02083","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-18T00:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMPK6itsxeZDaQxKKxoM16RBq/ikTcwdoc7SZFToJOTtUWJpkeZD7SgjrqQLiNLzOMszWB/yC3P4/paa88KNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T16:05:47.566239Z"},"content_sha256":"66cb16aa0eca01c3d8a8562ee0eed5b7f9e3fe4e533df5315af36e8bd7953c57","schema_version":"1.0","event_id":"sha256:66cb16aa0eca01c3d8a8562ee0eed5b7f9e3fe4e533df5315af36e8bd7953c57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:57PJXYZ5V54QDA7FCNP6N6KYDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Principal Subspace Projection of Streaming Data Through Fast Similarity Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.CO","authors_text":"Andrea Giovannucci, Cengiz Pehlevan, Dmitri B. Chklovskii, Victor Minden","submitted_at":"2018-08-06T19:37:56Z","abstract_excerpt":"Big data problems frequently require processing datasets in a streaming fashion, either because all data are available at once but collectively are larger than available memory or because the data intrinsically arrive one data point at a time and must be processed online. Here, we introduce a computationally efficient version of similarity matching, a framework for online dimensionality reduction that incrementally estimates the top K-dimensional principal subspace of streamed data while keeping in memory only the last sample and the current iterate. To assess the performance of our approach, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02083","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-18T00:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXM0twe4oNQxcnP6CKs5/UUSy/jG5OdeJQMBz7rLglmOvixaEDOJ3STulJnBiZVf+tDgAIRv6WDVtK3MmLJ1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T16:05:47.566638Z"},"content_sha256":"2cf6f08e67d9d6602329b6d52f511f7c09a5df804a05653476e58ecb00a4792e","schema_version":"1.0","event_id":"sha256:2cf6f08e67d9d6602329b6d52f511f7c09a5df804a05653476e58ecb00a4792e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57PJXYZ5V54QDA7FCNP6N6KYDO/bundle.json","state_url":"https://pith.science/pith/57PJXYZ5V54QDA7FCNP6N6KYDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57PJXYZ5V54QDA7FCNP6N6KYDO/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-21T16:05:47Z","links":{"resolver":"https://pith.science/pith/57PJXYZ5V54QDA7FCNP6N6KYDO","bundle":"https://pith.science/pith/57PJXYZ5V54QDA7FCNP6N6KYDO/bundle.json","state":"https://pith.science/pith/57PJXYZ5V54QDA7FCNP6N6KYDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57PJXYZ5V54QDA7FCNP6N6KYDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:57PJXYZ5V54QDA7FCNP6N6KYDO","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":"617dd0e0fab45ddd1ca05d96019fc62d9ea56be95bf79149f1cbfa44718fb74f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-08-06T19:37:56Z","title_canon_sha256":"51ee585b914134368776ca99827b2e25eaa1a2e8f3e20c33366cd9b20a5bfeec"},"schema_version":"1.0","source":{"id":"1808.02083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02083","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02083v1","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02083","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"57PJXYZ5V54Q","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"57PJXYZ5V54QDA7F","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"57PJXYZ5","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:2cf6f08e67d9d6602329b6d52f511f7c09a5df804a05653476e58ecb00a4792e","target":"graph","created_at":"2026-05-18T00:08:47Z","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":"Big data problems frequently require processing datasets in a streaming fashion, either because all data are available at once but collectively are larger than available memory or because the data intrinsically arrive one data point at a time and must be processed online. Here, we introduce a computationally efficient version of similarity matching, a framework for online dimensionality reduction that incrementally estimates the top K-dimensional principal subspace of streamed data while keeping in memory only the last sample and the current iterate. To assess the performance of our approach, ","authors_text":"Andrea Giovannucci, Cengiz Pehlevan, Dmitri B. Chklovskii, Victor Minden","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-08-06T19:37:56Z","title":"Efficient Principal Subspace Projection of Streaming Data Through Fast Similarity Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02083","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:66cb16aa0eca01c3d8a8562ee0eed5b7f9e3fe4e533df5315af36e8bd7953c57","target":"record","created_at":"2026-05-18T00:08:47Z","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":"617dd0e0fab45ddd1ca05d96019fc62d9ea56be95bf79149f1cbfa44718fb74f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-08-06T19:37:56Z","title_canon_sha256":"51ee585b914134368776ca99827b2e25eaa1a2e8f3e20c33366cd9b20a5bfeec"},"schema_version":"1.0","source":{"id":"1808.02083","kind":"arxiv","version":1}},"canonical_sha256":"efde9be33daf790183e5135fe6f9581b8ab3dbc3611f4a011c28d46a298beced","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efde9be33daf790183e5135fe6f9581b8ab3dbc3611f4a011c28d46a298beced","first_computed_at":"2026-05-18T00:08:47.672148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:47.672148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uYlv9TVvo1lydSgKHu6wBf84dNCqq5SaGQPF+dASYfmkv+1xNjGyve9ulZ4aTkWqcUuDCVtmXKTvaBN8lfZuCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:47.672714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66cb16aa0eca01c3d8a8562ee0eed5b7f9e3fe4e533df5315af36e8bd7953c57","sha256:2cf6f08e67d9d6602329b6d52f511f7c09a5df804a05653476e58ecb00a4792e"],"state_sha256":"7d7f3b6b92c8ac1147497f73aa229dfa7819c4cecba2bbd69bd0a50f9ec6b210"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Dq5RiPxPMvxiHDVfP4wyTw8ZmX+QhC3s0F5XbrRVxi0OcxA2bql/3YNur2k/I5EfccdYg+D8fpfppdgLHg9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T16:05:47.568639Z","bundle_sha256":"1d32cfe8f2f7b7093ac5874894dfc776fabe3d927a61eb8c3fb3c1f0c8c403df"}}