{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GI2UXTANG5XLC6NMIIQTUOOGFA","short_pith_number":"pith:GI2UXTAN","schema_version":"1.0","canonical_sha256":"32354bcc0d376eb179ac42213a39c628014b1d77c4cb8e99343face88239ca3a","source":{"kind":"arxiv","id":"1507.08967","version":3},"attestation_state":"computed","paper":{"title":"Distributed Algorithms for Finding Local Clusters Using Heat Kernel Pagerank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fan Chung, Olivia Simpson","submitted_at":"2015-07-31T18:12:27Z","abstract_excerpt":"A distributed algorithm performs local computations on pieces of input and communicates the results through given communication links. When processing a massive graph in a distributed algorithm, local outputs must be configured as a solution to a graph problem without shared memory and with few rounds of communication. In this paper we consider the problem of computing a local cluster in a massive graph in the distributed setting. Computing local clusters are of certain application-specific interests, such as detecting communities in social networks or groups of interacting proteins in biologi"},"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":"1507.08967","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-31T18:12:27Z","cross_cats_sorted":[],"title_canon_sha256":"e27863fb33662dbfee8b13c84cd69f156f6261e703c1d825e3dd7b98d4290fa3","abstract_canon_sha256":"b2752ef396ec6f33d9d943da09e8e023ca42855e585cf459a29ef5630a356d94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:58.522001Z","signature_b64":"BKsJWAtxEPfaD+r2IduGTa3oi256QKc9tw0YnJzGmpDRTrUTtZEWrC+Ia1KldyEoK84n2eJUuOLt4Df3vav7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32354bcc0d376eb179ac42213a39c628014b1d77c4cb8e99343face88239ca3a","last_reissued_at":"2026-05-18T00:55:58.521496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:58.521496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Algorithms for Finding Local Clusters Using Heat Kernel Pagerank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fan Chung, Olivia Simpson","submitted_at":"2015-07-31T18:12:27Z","abstract_excerpt":"A distributed algorithm performs local computations on pieces of input and communicates the results through given communication links. When processing a massive graph in a distributed algorithm, local outputs must be configured as a solution to a graph problem without shared memory and with few rounds of communication. In this paper we consider the problem of computing a local cluster in a massive graph in the distributed setting. Computing local clusters are of certain application-specific interests, such as detecting communities in social networks or groups of interacting proteins in biologi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08967","kind":"arxiv","version":3},"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":"1507.08967","created_at":"2026-05-18T00:55:58.521584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.08967v3","created_at":"2026-05-18T00:55:58.521584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08967","created_at":"2026-05-18T00:55:58.521584+00:00"},{"alias_kind":"pith_short_12","alias_value":"GI2UXTANG5XL","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GI2UXTANG5XLC6NM","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GI2UXTAN","created_at":"2026-05-18T12:29:22.688609+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/GI2UXTANG5XLC6NMIIQTUOOGFA","json":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA.json","graph_json":"https://pith.science/api/pith-number/GI2UXTANG5XLC6NMIIQTUOOGFA/graph.json","events_json":"https://pith.science/api/pith-number/GI2UXTANG5XLC6NMIIQTUOOGFA/events.json","paper":"https://pith.science/paper/GI2UXTAN"},"agent_actions":{"view_html":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA","download_json":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA.json","view_paper":"https://pith.science/paper/GI2UXTAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.08967&json=true","fetch_graph":"https://pith.science/api/pith-number/GI2UXTANG5XLC6NMIIQTUOOGFA/graph.json","fetch_events":"https://pith.science/api/pith-number/GI2UXTANG5XLC6NMIIQTUOOGFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/action/storage_attestation","attest_author":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/action/author_attestation","sign_citation":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/action/citation_signature","submit_replication":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/action/replication_record"}},"created_at":"2026-05-18T00:55:58.521584+00:00","updated_at":"2026-05-18T00:55:58.521584+00:00"}