{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NCDOWZXQXZRBOE3PECKK2CCGLC","short_pith_number":"pith:NCDOWZXQ","canonical_record":{"source":{"id":"1611.00938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T10:08:22Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7dcf083af070d72f434e6e5ee55abe8ab8568aac7b9f912421c51d17155e94bd","abstract_canon_sha256":"aeece137b7df0da375f1496a20dad34f1f7fb5c0b96f3af8e3c06020fc61692e"},"schema_version":"1.0"},"canonical_sha256":"6886eb66f0be6217136f2094ad084658aa68bbcab52907e1d6d941b24b4aa65a","source":{"kind":"arxiv","id":"1611.00938","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00938","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00938v2","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00938","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"NCDOWZXQXZRB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NCDOWZXQXZRBOE3P","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NCDOWZXQ","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NCDOWZXQXZRBOE3PECKK2CCGLC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00938","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T10:08:22Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"7dcf083af070d72f434e6e5ee55abe8ab8568aac7b9f912421c51d17155e94bd","abstract_canon_sha256":"aeece137b7df0da375f1496a20dad34f1f7fb5c0b96f3af8e3c06020fc61692e"},"schema_version":"1.0"},"canonical_sha256":"6886eb66f0be6217136f2094ad084658aa68bbcab52907e1d6d941b24b4aa65a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:11.841636Z","signature_b64":"vhETWDdy1rQDSPCcUnI6/kBWzG3LS9bf+RjZdlNEgfUX0Z0GGKEjU7t1kEtzcwUtviI3dJMMNwK/oe83oqAQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6886eb66f0be6217136f2094ad084658aa68bbcab52907e1d6d941b24b4aa65a","last_reissued_at":"2026-05-18T01:00:11.841015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:11.841015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00938","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-18T01:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZuCGkGuYzEDFLANB+RonGXPGbHQMgJLQUOvTd6skQclDKdEt+EJ79xL1Jf5G33J8KjyIeai3LQknrgPYJYZ3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:24:19.093703Z"},"content_sha256":"af7e4ec9154bb1b4db6c724aaf7cb00339e024fc28cf7e4b55d406ade07c6c68","schema_version":"1.0","event_id":"sha256:af7e4ec9154bb1b4db6c724aaf7cb00339e024fc28cf7e4b55d406ade07c6c68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NCDOWZXQXZRBOE3PECKK2CCGLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Eigenspace Approximation using Random Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Johan Paratte, Lionel Martin","submitted_at":"2016-11-03T10:08:22Z","abstract_excerpt":"We focus in this work on the estimation of the first $k$ eigenvectors of any graph Laplacian using filtering of Gaussian random signals. We prove that we only need $k$ such signals to be able to exactly recover as many of the smallest eigenvectors, regardless of the number of nodes in the graph. In addition, we address key issues in implementing the theoretical concepts in practice using accurate approximated methods. We also propose fast algorithms both for eigenspace approximation and for the determination of the $k$th smallest eigenvalue $\\lambda_k$. The latter proves to be extremely effici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00938","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-18T01:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WraFNBlvd20h+BYKE1ACpmx9ls2MaZO+cyZsqBogHHLQy/2N7Y2W+F19wdXSjraUUQW1CMlXZbqgc7Xv6IGlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T00:24:19.094289Z"},"content_sha256":"1d862084e45dc511da943f53d5529fb6dbaa6a9ddba11fc25290fb1c12725997","schema_version":"1.0","event_id":"sha256:1d862084e45dc511da943f53d5529fb6dbaa6a9ddba11fc25290fb1c12725997"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NCDOWZXQXZRBOE3PECKK2CCGLC/bundle.json","state_url":"https://pith.science/pith/NCDOWZXQXZRBOE3PECKK2CCGLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NCDOWZXQXZRBOE3PECKK2CCGLC/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-22T00:24:19Z","links":{"resolver":"https://pith.science/pith/NCDOWZXQXZRBOE3PECKK2CCGLC","bundle":"https://pith.science/pith/NCDOWZXQXZRBOE3PECKK2CCGLC/bundle.json","state":"https://pith.science/pith/NCDOWZXQXZRBOE3PECKK2CCGLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NCDOWZXQXZRBOE3PECKK2CCGLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NCDOWZXQXZRBOE3PECKK2CCGLC","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":"aeece137b7df0da375f1496a20dad34f1f7fb5c0b96f3af8e3c06020fc61692e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T10:08:22Z","title_canon_sha256":"7dcf083af070d72f434e6e5ee55abe8ab8568aac7b9f912421c51d17155e94bd"},"schema_version":"1.0","source":{"id":"1611.00938","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00938","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00938v2","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00938","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"NCDOWZXQXZRB","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NCDOWZXQXZRBOE3P","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NCDOWZXQ","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:1d862084e45dc511da943f53d5529fb6dbaa6a9ddba11fc25290fb1c12725997","target":"graph","created_at":"2026-05-18T01:00:11Z","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":"We focus in this work on the estimation of the first $k$ eigenvectors of any graph Laplacian using filtering of Gaussian random signals. We prove that we only need $k$ such signals to be able to exactly recover as many of the smallest eigenvectors, regardless of the number of nodes in the graph. In addition, we address key issues in implementing the theoretical concepts in practice using accurate approximated methods. We also propose fast algorithms both for eigenspace approximation and for the determination of the $k$th smallest eigenvalue $\\lambda_k$. The latter proves to be extremely effici","authors_text":"Johan Paratte, Lionel Martin","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T10:08:22Z","title":"Fast Eigenspace Approximation using Random Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00938","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:af7e4ec9154bb1b4db6c724aaf7cb00339e024fc28cf7e4b55d406ade07c6c68","target":"record","created_at":"2026-05-18T01:00:11Z","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":"aeece137b7df0da375f1496a20dad34f1f7fb5c0b96f3af8e3c06020fc61692e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-03T10:08:22Z","title_canon_sha256":"7dcf083af070d72f434e6e5ee55abe8ab8568aac7b9f912421c51d17155e94bd"},"schema_version":"1.0","source":{"id":"1611.00938","kind":"arxiv","version":2}},"canonical_sha256":"6886eb66f0be6217136f2094ad084658aa68bbcab52907e1d6d941b24b4aa65a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6886eb66f0be6217136f2094ad084658aa68bbcab52907e1d6d941b24b4aa65a","first_computed_at":"2026-05-18T01:00:11.841015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:11.841015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vhETWDdy1rQDSPCcUnI6/kBWzG3LS9bf+RjZdlNEgfUX0Z0GGKEjU7t1kEtzcwUtviI3dJMMNwK/oe83oqAQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:11.841636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00938","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af7e4ec9154bb1b4db6c724aaf7cb00339e024fc28cf7e4b55d406ade07c6c68","sha256:1d862084e45dc511da943f53d5529fb6dbaa6a9ddba11fc25290fb1c12725997"],"state_sha256":"2834cb012848b9fcb25d378ab9f83223c5d18a8d80e81947d07e148834c7de6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9hw8kFcRHGZyCAz+vFIMkXs/it8voNWXTDrTfxLtcX+CX2vlmdTqo7aIRCEFBUafA3MaGeRipIIXX1nkqSUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T00:24:19.097992Z","bundle_sha256":"e768821ea63a63b6c272a127da6f8c031b003e703d23e99095e8ffc079381e45"}}