{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2IK6X35T6L5ANHXE2MYGP65HIT","short_pith_number":"pith:2IK6X35T","schema_version":"1.0","canonical_sha256":"d215ebefb3f2fa069ee4d33067fba744d36eaa922751fb47ae0681ce9b8e2c4f","source":{"kind":"arxiv","id":"1804.08548","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.08548","created_at":"2026-05-18T00:17:16.232633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08548v2","created_at":"2026-05-18T00:17:16.232633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08548","created_at":"2026-05-18T00:17:16.232633+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IK6X35T6L5A","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IK6X35T6L5ANHXE","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IK6X35T","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT","json":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT.json","graph_json":"https://pith.science/api/pith-number/2IK6X35T6L5ANHXE2MYGP65HIT/graph.json","events_json":"https://pith.science/api/pith-number/2IK6X35T6L5ANHXE2MYGP65HIT/events.json","paper":"https://pith.science/paper/2IK6X35T"},"agent_actions":{"view_html":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT","download_json":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT.json","view_paper":"https://pith.science/paper/2IK6X35T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08548&json=true","fetch_graph":"https://pith.science/api/pith-number/2IK6X35T6L5ANHXE2MYGP65HIT/graph.json","fetch_events":"https://pith.science/api/pith-number/2IK6X35T6L5ANHXE2MYGP65HIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT/action/storage_attestation","attest_author":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT/action/author_attestation","sign_citation":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT/action/citation_signature","submit_replication":"https://pith.science/pith/2IK6X35T6L5ANHXE2MYGP65HIT/action/replication_record"}},"created_at":"2026-05-18T00:17:16.232633+00:00","updated_at":"2026-05-18T00:17:16.232633+00:00"}