{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:2GE4VRYQ3OYZYC3WKZOQ534CGJ","short_pith_number":"pith:2GE4VRYQ","canonical_record":{"source":{"id":"2302.02137","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-04T09:28:36Z","cross_cats_sorted":[],"title_canon_sha256":"1e563c9e94ecbba68fb8d95b8b05dd4e6e51826b738ec7d6d5944d317c18f29b","abstract_canon_sha256":"54970d69a0b412e3b24d8d9a243389be5c017bcfedc5bbac08e06f06f4e9ecc1"},"schema_version":"1.0"},"canonical_sha256":"d189cac710dbb19c0b76565d0eef823272ef65232d5cd3a23db9f9abc260ff81","source":{"kind":"arxiv","id":"2302.02137","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.02137","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"arxiv_version","alias_value":"2302.02137v1","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02137","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"pith_short_12","alias_value":"2GE4VRYQ3OYZ","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"pith_short_16","alias_value":"2GE4VRYQ3OYZYC3W","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"pith_short_8","alias_value":"2GE4VRYQ","created_at":"2026-07-05T05:38:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:2GE4VRYQ3OYZYC3WKZOQ534CGJ","target":"record","payload":{"canonical_record":{"source":{"id":"2302.02137","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-04T09:28:36Z","cross_cats_sorted":[],"title_canon_sha256":"1e563c9e94ecbba68fb8d95b8b05dd4e6e51826b738ec7d6d5944d317c18f29b","abstract_canon_sha256":"54970d69a0b412e3b24d8d9a243389be5c017bcfedc5bbac08e06f06f4e9ecc1"},"schema_version":"1.0"},"canonical_sha256":"d189cac710dbb19c0b76565d0eef823272ef65232d5cd3a23db9f9abc260ff81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:49.268638Z","signature_b64":"eJ5CAZST5aFBSjUo/NEVfPXSYf5aiMTeCvQN+SOd5zkuRSSHS1tEwt6TEcJquT70e4siCL+Qa98E7CPbz55cCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d189cac710dbb19c0b76565d0eef823272ef65232d5cd3a23db9f9abc260ff81","last_reissued_at":"2026-07-05T05:38:49.268156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:49.268156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.02137","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-05T05:38:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PeJBoVJLsBunSa3pRBNcsmseGUJkId+IvDRmzHI7xwSHsjMzjjhFxv34aX1aC+YzbKjbonOvMxZCki/zS+oLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:42:23.158406Z"},"content_sha256":"f40a0fbf3a9c17796d14ac9cb62509d57b043627f09704f856a8cdea3c6b91eb","schema_version":"1.0","event_id":"sha256:f40a0fbf3a9c17796d14ac9cb62509d57b043627f09704f856a8cdea3c6b91eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:2GE4VRYQ3OYZYC3WKZOQ534CGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FedSpectral+: Spectral Clustering using Federated Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Devvrat Joshi, Janvi Thakkar","submitted_at":"2023-02-04T09:28:36Z","abstract_excerpt":"Clustering in graphs has been a well-known research problem, particularly because most Internet and social network data is in the form of graphs. Organizations widely use spectral clustering algorithms to find clustering in graph datasets. However, applying spectral clustering to a large dataset is challenging due to computational overhead. While the distributed spectral clustering algorithm exists, they face the problem of data privacy and increased communication costs between the clients. Thus, in this paper, we propose a spectral clustering algorithm using federated learning (FL) to overcom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02137","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/2302.02137/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-05T05:38:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PI978sniLPLPmzFOi8JWDBVMwEuYltXf58oplywXVTe739P8kbBoGyD+kodnDP0toLOdRLs3C23BBLUDh+hbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:42:23.159033Z"},"content_sha256":"aad882d3fa6837b34065685de2b68f64b4abd1be6e12d1a2a84127b689d41738","schema_version":"1.0","event_id":"sha256:aad882d3fa6837b34065685de2b68f64b4abd1be6e12d1a2a84127b689d41738"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GE4VRYQ3OYZYC3WKZOQ534CGJ/bundle.json","state_url":"https://pith.science/pith/2GE4VRYQ3OYZYC3WKZOQ534CGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GE4VRYQ3OYZYC3WKZOQ534CGJ/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-08-04T09:42:23Z","links":{"resolver":"https://pith.science/pith/2GE4VRYQ3OYZYC3WKZOQ534CGJ","bundle":"https://pith.science/pith/2GE4VRYQ3OYZYC3WKZOQ534CGJ/bundle.json","state":"https://pith.science/pith/2GE4VRYQ3OYZYC3WKZOQ534CGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GE4VRYQ3OYZYC3WKZOQ534CGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2GE4VRYQ3OYZYC3WKZOQ534CGJ","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":"54970d69a0b412e3b24d8d9a243389be5c017bcfedc5bbac08e06f06f4e9ecc1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-04T09:28:36Z","title_canon_sha256":"1e563c9e94ecbba68fb8d95b8b05dd4e6e51826b738ec7d6d5944d317c18f29b"},"schema_version":"1.0","source":{"id":"2302.02137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.02137","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"arxiv_version","alias_value":"2302.02137v1","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02137","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"pith_short_12","alias_value":"2GE4VRYQ3OYZ","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"pith_short_16","alias_value":"2GE4VRYQ3OYZYC3W","created_at":"2026-07-05T05:38:49Z"},{"alias_kind":"pith_short_8","alias_value":"2GE4VRYQ","created_at":"2026-07-05T05:38:49Z"}],"graph_snapshots":[{"event_id":"sha256:aad882d3fa6837b34065685de2b68f64b4abd1be6e12d1a2a84127b689d41738","target":"graph","created_at":"2026-07-05T05:38:49Z","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/2302.02137/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Clustering in graphs has been a well-known research problem, particularly because most Internet and social network data is in the form of graphs. Organizations widely use spectral clustering algorithms to find clustering in graph datasets. However, applying spectral clustering to a large dataset is challenging due to computational overhead. While the distributed spectral clustering algorithm exists, they face the problem of data privacy and increased communication costs between the clients. Thus, in this paper, we propose a spectral clustering algorithm using federated learning (FL) to overcom","authors_text":"Devvrat Joshi, Janvi Thakkar","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-04T09:28:36Z","title":"FedSpectral+: Spectral Clustering using Federated Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02137","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:f40a0fbf3a9c17796d14ac9cb62509d57b043627f09704f856a8cdea3c6b91eb","target":"record","created_at":"2026-07-05T05:38:49Z","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":"54970d69a0b412e3b24d8d9a243389be5c017bcfedc5bbac08e06f06f4e9ecc1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-04T09:28:36Z","title_canon_sha256":"1e563c9e94ecbba68fb8d95b8b05dd4e6e51826b738ec7d6d5944d317c18f29b"},"schema_version":"1.0","source":{"id":"2302.02137","kind":"arxiv","version":1}},"canonical_sha256":"d189cac710dbb19c0b76565d0eef823272ef65232d5cd3a23db9f9abc260ff81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d189cac710dbb19c0b76565d0eef823272ef65232d5cd3a23db9f9abc260ff81","first_computed_at":"2026-07-05T05:38:49.268156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:38:49.268156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eJ5CAZST5aFBSjUo/NEVfPXSYf5aiMTeCvQN+SOd5zkuRSSHS1tEwt6TEcJquT70e4siCL+Qa98E7CPbz55cCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:38:49.268638Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.02137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f40a0fbf3a9c17796d14ac9cb62509d57b043627f09704f856a8cdea3c6b91eb","sha256:aad882d3fa6837b34065685de2b68f64b4abd1be6e12d1a2a84127b689d41738"],"state_sha256":"ae93107db3925a0e59aa756653c2d20f225725efa42b42e25f2e8543d3fdb46e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGnNePWv0W7KGN6mJcUGOG17XWA9WB3XBjborEQSQGrkt24F92qknjcupF3oGznkAH4c79Yxez9zgBx4zBo2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T09:42:23.162082Z","bundle_sha256":"c36f26c02b7cae32a550504fd93270eb2601659165a4644916c567eb0b5d5f5a"}}