{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N6IMKDE3R5ZGG7YVEU42O2JSTX","short_pith_number":"pith:N6IMKDE3","canonical_record":{"source":{"id":"1812.05721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-13T22:53:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b084e6bb50c2d44d6cf755a14e9790fe35be64d6773011ddc9366d1d69bca4fb","abstract_canon_sha256":"a0f3eee97b6bc89b5adb5ab3c376ec22616bcb5571644866585ac96edd92b084"},"schema_version":"1.0"},"canonical_sha256":"6f90c50c9b8f72637f152539a769329dea064f34117817dbeab21dc870d3555e","source":{"kind":"arxiv","id":"1812.05721","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05721","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05721v2","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05721","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"pith_short_12","alias_value":"N6IMKDE3R5ZG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N6IMKDE3R5ZGG7YV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N6IMKDE3","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N6IMKDE3R5ZGG7YVEU42O2JSTX","target":"record","payload":{"canonical_record":{"source":{"id":"1812.05721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-13T22:53:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b084e6bb50c2d44d6cf755a14e9790fe35be64d6773011ddc9366d1d69bca4fb","abstract_canon_sha256":"a0f3eee97b6bc89b5adb5ab3c376ec22616bcb5571644866585ac96edd92b084"},"schema_version":"1.0"},"canonical_sha256":"6f90c50c9b8f72637f152539a769329dea064f34117817dbeab21dc870d3555e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:50.388095Z","signature_b64":"aM4TGpfhL1b8cbUfcjz36zzX0To2WONoAavgJiD9SRxMKkrzoepGfGFrYbKoIV7YpUFs5qEzx+My2Yd6klX+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f90c50c9b8f72637f152539a769329dea064f34117817dbeab21dc870d3555e","last_reissued_at":"2026-05-17T23:48:50.387450Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:50.387450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.05721","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-17T23:48:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RumTi8JLuwAL8O9o9D0Jl7NF40aHoD/B50RJT2xRGtIabGcDS7t9UGCaOBX64xPCXKPQNmmuAOWIpoXfgT05Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:32:20.414616Z"},"content_sha256":"2e1661d7feed543ea30bb557bb9c59898c5ff6aeefc076b12a984434600b74aa","schema_version":"1.0","event_id":"sha256:2e1661d7feed543ea30bb557bb9c59898c5ff6aeefc076b12a984434600b74aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N6IMKDE3R5ZGG7YVEU42O2JSTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Gradient Descent for Spectral Embedding with Implicit Orthogonality Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Giovanni Chierchia, Mireille El Gheche, Pascal Frossard","submitted_at":"2018-12-13T22:53:23Z","abstract_excerpt":"In this paper, we propose a scalable algorithm for spectral embedding. The latter is a standard tool for graph clustering. However, its computational bottleneck is the eigendecomposition of the graph Laplacian matrix, which prevents its application to large-scale graphs. Our contribution consists of reformulating spectral embedding so that it can be solved via stochastic optimization. The idea is to replace the orthogonality constraint with an orthogonalization matrix injected directly into the criterion. As the gradient can be computed through a Cholesky factorization, our reformulation allow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05721","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-17T23:48:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i9W/8QVoveyUQGW/GN8Dr6MVLP2G6s/aYdLrPwQn8TJxl6DbdWKproHZHn/HvAv4txlv2y3jC69r0+hOMhXKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:32:20.414971Z"},"content_sha256":"b2cb07371b714a3ee619cd4953059a68e97f0077d81e823f657d8caf517a0307","schema_version":"1.0","event_id":"sha256:b2cb07371b714a3ee619cd4953059a68e97f0077d81e823f657d8caf517a0307"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6IMKDE3R5ZGG7YVEU42O2JSTX/bundle.json","state_url":"https://pith.science/pith/N6IMKDE3R5ZGG7YVEU42O2JSTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6IMKDE3R5ZGG7YVEU42O2JSTX/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-20T20:32:20Z","links":{"resolver":"https://pith.science/pith/N6IMKDE3R5ZGG7YVEU42O2JSTX","bundle":"https://pith.science/pith/N6IMKDE3R5ZGG7YVEU42O2JSTX/bundle.json","state":"https://pith.science/pith/N6IMKDE3R5ZGG7YVEU42O2JSTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6IMKDE3R5ZGG7YVEU42O2JSTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N6IMKDE3R5ZGG7YVEU42O2JSTX","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":"a0f3eee97b6bc89b5adb5ab3c376ec22616bcb5571644866585ac96edd92b084","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-13T22:53:23Z","title_canon_sha256":"b084e6bb50c2d44d6cf755a14e9790fe35be64d6773011ddc9366d1d69bca4fb"},"schema_version":"1.0","source":{"id":"1812.05721","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05721","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05721v2","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05721","created_at":"2026-05-17T23:48:50Z"},{"alias_kind":"pith_short_12","alias_value":"N6IMKDE3R5ZG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N6IMKDE3R5ZGG7YV","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N6IMKDE3","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:b2cb07371b714a3ee619cd4953059a68e97f0077d81e823f657d8caf517a0307","target":"graph","created_at":"2026-05-17T23:48:50Z","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 paper, we propose a scalable algorithm for spectral embedding. The latter is a standard tool for graph clustering. However, its computational bottleneck is the eigendecomposition of the graph Laplacian matrix, which prevents its application to large-scale graphs. Our contribution consists of reformulating spectral embedding so that it can be solved via stochastic optimization. The idea is to replace the orthogonality constraint with an orthogonalization matrix injected directly into the criterion. As the gradient can be computed through a Cholesky factorization, our reformulation allow","authors_text":"Giovanni Chierchia, Mireille El Gheche, Pascal Frossard","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-13T22:53:23Z","title":"Stochastic Gradient Descent for Spectral Embedding with Implicit Orthogonality Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05721","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:2e1661d7feed543ea30bb557bb9c59898c5ff6aeefc076b12a984434600b74aa","target":"record","created_at":"2026-05-17T23:48:50Z","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":"a0f3eee97b6bc89b5adb5ab3c376ec22616bcb5571644866585ac96edd92b084","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-13T22:53:23Z","title_canon_sha256":"b084e6bb50c2d44d6cf755a14e9790fe35be64d6773011ddc9366d1d69bca4fb"},"schema_version":"1.0","source":{"id":"1812.05721","kind":"arxiv","version":2}},"canonical_sha256":"6f90c50c9b8f72637f152539a769329dea064f34117817dbeab21dc870d3555e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f90c50c9b8f72637f152539a769329dea064f34117817dbeab21dc870d3555e","first_computed_at":"2026-05-17T23:48:50.387450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:50.387450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aM4TGpfhL1b8cbUfcjz36zzX0To2WONoAavgJiD9SRxMKkrzoepGfGFrYbKoIV7YpUFs5qEzx+My2Yd6klX+Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:50.388095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05721","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e1661d7feed543ea30bb557bb9c59898c5ff6aeefc076b12a984434600b74aa","sha256:b2cb07371b714a3ee619cd4953059a68e97f0077d81e823f657d8caf517a0307"],"state_sha256":"e8cce3bf92feae35ed377866accc4892821852679b8aa8c7733c8adbdbe2ac8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfG+LcS9/zkv0ziPqMN+fnRjkB6Bp3dAwMEKmMCADfrSLBI+SputKpHE69SHgdDmhVTaMUHpGRlsgWsnYfwECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:32:20.416931Z","bundle_sha256":"1f77b26a44c00db1071a3f9a1ae5273f83e60d474040dcf16040c75ddb410df9"}}