{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2IK6X35T6L5ANHXE2MYGP65HIT","short_pith_number":"pith:2IK6X35T","canonical_record":{"source":{"id":"1804.08548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-23T16:39:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0543b4c79d97ca86a1a6f379303f5fc29955c38057e37c82fa79fc559db505bf","abstract_canon_sha256":"4adb39fcad36bca041e9270ec3fc2d9b6fe2d7a8c61f1fba1fae81cb78e11b62"},"schema_version":"1.0"},"canonical_sha256":"d215ebefb3f2fa069ee4d33067fba744d36eaa922751fb47ae0681ce9b8e2c4f","source":{"kind":"arxiv","id":"1804.08548","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08548","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08548v2","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08548","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"2IK6X35T6L5A","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2IK6X35T6L5ANHXE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2IK6X35T","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2IK6X35T6L5ANHXE2MYGP65HIT","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-23T16:39:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0543b4c79d97ca86a1a6f379303f5fc29955c38057e37c82fa79fc559db505bf","abstract_canon_sha256":"4adb39fcad36bca041e9270ec3fc2d9b6fe2d7a8c61f1fba1fae81cb78e11b62"},"schema_version":"1.0"},"canonical_sha256":"d215ebefb3f2fa069ee4d33067fba744d36eaa922751fb47ae0681ce9b8e2c4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:16.233009Z","signature_b64":"Rb2M1RCStkftVcB5rC6lGJfy+dM0pSYsnJ0JO2YMS8uVV57rTuGUUdz2mgkX+lLpi0QWrM4p85vEUNjjX8wfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d215ebefb3f2fa069ee4d33067fba744d36eaa922751fb47ae0681ce9b8e2c4f","last_reissued_at":"2026-05-18T00:17:16.232564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:16.232564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08548","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-18T00:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOIHjqL771ptJfNpPH+X8TAFFuoNH9fNmK8XZOuBltirCZae89RvODYoQsI62OwMLVbsR5Tr69RnRG7mELnlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:26:20.502297Z"},"content_sha256":"e8634e8c94138b53a9c016e878301fe60d07ca4101e54229f324ab1d2bd30408","schema_version":"1.0","event_id":"sha256:e8634e8c94138b53a9c016e878301fe60d07ca4101e54229f324ab1d2bd30408"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2IK6X35T6L5ANHXE2MYGP65HIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Eigenvector Computation and Community Detection in Asynchronous Gossip Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Cameron Musco, Christopher Musco, Frederik Mallmann-Trenn","submitted_at":"2018-04-23T16:39:39Z","abstract_excerpt":"We give a simple distributed algorithm for computing adjacency matrix eigenvectors for the communication graph in an asynchronous gossip model. We show how to use this algorithm to give state-of-the-art asynchronous community detection algorithms when the communication graph is drawn from the well-studied stochastic block model. Our methods also apply to a natural alternative model of randomized communication, where nodes within a community communicate more frequently than nodes in different communities. Our analysis simplifies and generalizes prior work by forging a connection between asynchr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08548","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-18T00:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YLFqPBy7Dy4+OovmTpLoEc/8nj0jjDcdtBVPcOqWuPVo0zHaL8CNmEZLK+yNnMeMqe/lSO5eeGTRuWRpKo26AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:26:20.502659Z"},"content_sha256":"707a999ef9e3d7c170b0636dec19ca10b4d7fe64a57cefd8510d7a4da41c26d1","schema_version":"1.0","event_id":"sha256:707a999ef9e3d7c170b0636dec19ca10b4d7fe64a57cefd8510d7a4da41c26d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT/bundle.json","state_url":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2IK6X35T6L5ANHXE2MYGP65HIT/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-01T16:26:20Z","links":{"resolver":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT","bundle":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT/bundle.json","state":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2IK6X35T6L5ANHXE2MYGP65HIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2IK6X35T6L5ANHXE2MYGP65HIT","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":"4adb39fcad36bca041e9270ec3fc2d9b6fe2d7a8c61f1fba1fae81cb78e11b62","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-23T16:39:39Z","title_canon_sha256":"0543b4c79d97ca86a1a6f379303f5fc29955c38057e37c82fa79fc559db505bf"},"schema_version":"1.0","source":{"id":"1804.08548","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08548","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08548v2","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08548","created_at":"2026-05-18T00:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"2IK6X35T6L5A","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2IK6X35T6L5ANHXE","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2IK6X35T","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:707a999ef9e3d7c170b0636dec19ca10b4d7fe64a57cefd8510d7a4da41c26d1","target":"graph","created_at":"2026-05-18T00:17:16Z","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 give a simple distributed algorithm for computing adjacency matrix eigenvectors for the communication graph in an asynchronous gossip model. We show how to use this algorithm to give state-of-the-art asynchronous community detection algorithms when the communication graph is drawn from the well-studied stochastic block model. Our methods also apply to a natural alternative model of randomized communication, where nodes within a community communicate more frequently than nodes in different communities. Our analysis simplifies and generalizes prior work by forging a connection between asynchr","authors_text":"Cameron Musco, Christopher Musco, Frederik Mallmann-Trenn","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-23T16:39:39Z","title":"Eigenvector Computation and Community Detection in Asynchronous Gossip Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08548","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:e8634e8c94138b53a9c016e878301fe60d07ca4101e54229f324ab1d2bd30408","target":"record","created_at":"2026-05-18T00:17:16Z","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":"4adb39fcad36bca041e9270ec3fc2d9b6fe2d7a8c61f1fba1fae81cb78e11b62","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-23T16:39:39Z","title_canon_sha256":"0543b4c79d97ca86a1a6f379303f5fc29955c38057e37c82fa79fc559db505bf"},"schema_version":"1.0","source":{"id":"1804.08548","kind":"arxiv","version":2}},"canonical_sha256":"d215ebefb3f2fa069ee4d33067fba744d36eaa922751fb47ae0681ce9b8e2c4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d215ebefb3f2fa069ee4d33067fba744d36eaa922751fb47ae0681ce9b8e2c4f","first_computed_at":"2026-05-18T00:17:16.232564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:16.232564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rb2M1RCStkftVcB5rC6lGJfy+dM0pSYsnJ0JO2YMS8uVV57rTuGUUdz2mgkX+lLpi0QWrM4p85vEUNjjX8wfCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:16.233009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08548","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8634e8c94138b53a9c016e878301fe60d07ca4101e54229f324ab1d2bd30408","sha256:707a999ef9e3d7c170b0636dec19ca10b4d7fe64a57cefd8510d7a4da41c26d1"],"state_sha256":"9b2a64c977d932b521efb5c19abab61c1ae8ebc134c7dbc7d8f87321955fae5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnPpjT0PTggEOqQw4VBrQtm0HJmvufkNe7ogscS8Vsk9ymN0PXjkDrnY/3FFmqSXsPfnu2ONnKdBvKxoJxQuBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:26:20.504500Z","bundle_sha256":"10bedad95883a5e4c82ed11f58c5b6f1c6b1f67326c4e34e31e8ed56f2703355"}}