{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NXLEVFAPDMSV4XNPEY3M5TANAZ","short_pith_number":"pith:NXLEVFAP","canonical_record":{"source":{"id":"1706.03591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-12T12:12:58Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"64ce51988488ba9b082e04cf5357e4beec5c9a3fd444e4933c228c02016f573d","abstract_canon_sha256":"fe12c1ec2d1125c9187c34c9cc664796be02d38a778cdf2011db08708aec2038"},"schema_version":"1.0"},"canonical_sha256":"6dd64a940f1b255e5daf2636cecc0d064b3d51e0dd39826c096d95ae5e00b34e","source":{"kind":"arxiv","id":"1706.03591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03591","created_at":"2026-05-18T00:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03591v1","created_at":"2026-05-18T00:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03591","created_at":"2026-05-18T00:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"NXLEVFAPDMSV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NXLEVFAPDMSV4XNP","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NXLEVFAP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NXLEVFAPDMSV4XNPEY3M5TANAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-12T12:12:58Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"64ce51988488ba9b082e04cf5357e4beec5c9a3fd444e4933c228c02016f573d","abstract_canon_sha256":"fe12c1ec2d1125c9187c34c9cc664796be02d38a778cdf2011db08708aec2038"},"schema_version":"1.0"},"canonical_sha256":"6dd64a940f1b255e5daf2636cecc0d064b3d51e0dd39826c096d95ae5e00b34e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:34.240377Z","signature_b64":"mld5r/KmIMTc+SSClTCfIni1xjFdiS2r5+DldwEsMGH1xvIGvIRkLoS4PfjoR0lRwlWSPoAuvc3zsgofsbL1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dd64a940f1b255e5daf2636cecc0d064b3d51e0dd39826c096d95ae5e00b34e","last_reissued_at":"2026-05-18T00:42:34.239777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:34.239777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03591","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:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sLKXbjE9ElC1q2jSpvtXpwjE0D2QZ36kzqwO7SzYcctYNkivooleK/ojzPMuxxJhZLLrsv7z6RjR6oxbT6olCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:02:14.419166Z"},"content_sha256":"74b2dcbde5dcfc5301b8ca270e025292401c2fde260a1ecd742325ca01b03e3f","schema_version":"1.0","event_id":"sha256:74b2dcbde5dcfc5301b8ca270e025292401c2fde260a1ecd742325ca01b03e3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NXLEVFAPDMSV4XNPEY3M5TANAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Approximate Spectral Clustering for Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"stat.ML","authors_text":"Andreas Loukas, Lionel Martin, Pierre Vandergheynst","submitted_at":"2017-06-12T12:12:58Z","abstract_excerpt":"Spectral clustering is a widely studied problem, yet its complexity is prohibitive for dynamic graphs of even modest size. We claim that it is possible to reuse information of past cluster assignments to expedite computation. Our approach builds on a recent idea of sidestepping the main bottleneck of spectral clustering, i.e., computing the graph eigenvectors, by using fast Chebyshev graph filtering of random signals. We show that the proposed algorithm achieves clustering assignments with quality approximating that of spectral clustering and that it can yield significant complexity benefits w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03591","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:42:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+6V73+dXDM2mHLFGib9+HkoGQleA8FFWSQn+lG4Lg7FNxlsiUf7690BWx8hQ6qlXZej8gjIiYsv/tNVy+57CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:02:14.422869Z"},"content_sha256":"c2cda0b6628aedc9125336c96f9563a29038881ee3217ebfddf9eff97bcf81a4","schema_version":"1.0","event_id":"sha256:c2cda0b6628aedc9125336c96f9563a29038881ee3217ebfddf9eff97bcf81a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXLEVFAPDMSV4XNPEY3M5TANAZ/bundle.json","state_url":"https://pith.science/pith/NXLEVFAPDMSV4XNPEY3M5TANAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXLEVFAPDMSV4XNPEY3M5TANAZ/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-08T18:02:14Z","links":{"resolver":"https://pith.science/pith/NXLEVFAPDMSV4XNPEY3M5TANAZ","bundle":"https://pith.science/pith/NXLEVFAPDMSV4XNPEY3M5TANAZ/bundle.json","state":"https://pith.science/pith/NXLEVFAPDMSV4XNPEY3M5TANAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXLEVFAPDMSV4XNPEY3M5TANAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NXLEVFAPDMSV4XNPEY3M5TANAZ","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":"fe12c1ec2d1125c9187c34c9cc664796be02d38a778cdf2011db08708aec2038","cross_cats_sorted":["math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-12T12:12:58Z","title_canon_sha256":"64ce51988488ba9b082e04cf5357e4beec5c9a3fd444e4933c228c02016f573d"},"schema_version":"1.0","source":{"id":"1706.03591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03591","created_at":"2026-05-18T00:42:34Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03591v1","created_at":"2026-05-18T00:42:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03591","created_at":"2026-05-18T00:42:34Z"},{"alias_kind":"pith_short_12","alias_value":"NXLEVFAPDMSV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NXLEVFAPDMSV4XNP","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NXLEVFAP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:c2cda0b6628aedc9125336c96f9563a29038881ee3217ebfddf9eff97bcf81a4","target":"graph","created_at":"2026-05-18T00:42:34Z","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":"Spectral clustering is a widely studied problem, yet its complexity is prohibitive for dynamic graphs of even modest size. We claim that it is possible to reuse information of past cluster assignments to expedite computation. Our approach builds on a recent idea of sidestepping the main bottleneck of spectral clustering, i.e., computing the graph eigenvectors, by using fast Chebyshev graph filtering of random signals. We show that the proposed algorithm achieves clustering assignments with quality approximating that of spectral clustering and that it can yield significant complexity benefits w","authors_text":"Andreas Loukas, Lionel Martin, Pierre Vandergheynst","cross_cats":["math.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-12T12:12:58Z","title":"Fast Approximate Spectral Clustering for Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03591","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:74b2dcbde5dcfc5301b8ca270e025292401c2fde260a1ecd742325ca01b03e3f","target":"record","created_at":"2026-05-18T00:42:34Z","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":"fe12c1ec2d1125c9187c34c9cc664796be02d38a778cdf2011db08708aec2038","cross_cats_sorted":["math.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-12T12:12:58Z","title_canon_sha256":"64ce51988488ba9b082e04cf5357e4beec5c9a3fd444e4933c228c02016f573d"},"schema_version":"1.0","source":{"id":"1706.03591","kind":"arxiv","version":1}},"canonical_sha256":"6dd64a940f1b255e5daf2636cecc0d064b3d51e0dd39826c096d95ae5e00b34e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dd64a940f1b255e5daf2636cecc0d064b3d51e0dd39826c096d95ae5e00b34e","first_computed_at":"2026-05-18T00:42:34.239777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:34.239777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mld5r/KmIMTc+SSClTCfIni1xjFdiS2r5+DldwEsMGH1xvIGvIRkLoS4PfjoR0lRwlWSPoAuvc3zsgofsbL1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:34.240377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74b2dcbde5dcfc5301b8ca270e025292401c2fde260a1ecd742325ca01b03e3f","sha256:c2cda0b6628aedc9125336c96f9563a29038881ee3217ebfddf9eff97bcf81a4"],"state_sha256":"135e83c5b609e7d5196220bedf265b172829b07e6e4246682763331f31b5aaf6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Dtom9SeTSu2P4nykX5K52suCEIXF+eeDbUlNFVB3lduJ22Ba5LarUL/GbgcEYU6Y8Krqwpvq2icfAGgLDVIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:02:14.427283Z","bundle_sha256":"c3b46645f5eacfb759ce1f6e87c57e8d602efa776307db671b1a53f476ca8004"}}