{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GI2UXTANG5XLC6NMIIQTUOOGFA","short_pith_number":"pith:GI2UXTAN","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"},"canonical_sha256":"32354bcc0d376eb179ac42213a39c628014b1d77c4cb8e99343face88239ca3a","source":{"kind":"arxiv","id":"1507.08967","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08967","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08967v3","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08967","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"GI2UXTANG5XL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GI2UXTANG5XLC6NM","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GI2UXTAN","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GI2UXTANG5XLC6NMIIQTUOOGFA","target":"record","payload":{"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"},"canonical_sha256":"32354bcc0d376eb179ac42213a39c628014b1d77c4cb8e99343face88239ca3a","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"},"source_kind":"arxiv","source_id":"1507.08967","source_version":3,"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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bki2uooK8n8fzYDry1rqLUaDkuE+1pK8YJzDFeGJmKG1zk9rIp48yJlS5NBxHqXPHAV2kLZBtQ6xdQg1pLtCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:21:35.013063Z"},"content_sha256":"5cf222963c00315e27ecf0abfac1ee4b3065e2e6b764f5d3908b1971765fae31","schema_version":"1.0","event_id":"sha256:5cf222963c00315e27ecf0abfac1ee4b3065e2e6b764f5d3908b1971765fae31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GI2UXTANG5XLC6NMIIQTUOOGFA","target":"graph","payload":{"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"},"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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uBc56kcwfQBR6EWzDLhK7onnERoGpCh2hdFOtjOWsjpexsSCzAvBfkcNJw1wCpWO8DdLVHf8M0Mf0/2CVVpGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:21:35.013444Z"},"content_sha256":"3722c9771f419e8f02ec3c882d0610386408ed9766816006d146018006161615","schema_version":"1.0","event_id":"sha256:3722c9771f419e8f02ec3c882d0610386408ed9766816006d146018006161615"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/bundle.json","state_url":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/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-05-31T03:21:35Z","links":{"resolver":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA","bundle":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/bundle.json","state":"https://pith.science/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GI2UXTANG5XLC6NMIIQTUOOGFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GI2UXTANG5XLC6NMIIQTUOOGFA","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":"b2752ef396ec6f33d9d943da09e8e023ca42855e585cf459a29ef5630a356d94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-31T18:12:27Z","title_canon_sha256":"e27863fb33662dbfee8b13c84cd69f156f6261e703c1d825e3dd7b98d4290fa3"},"schema_version":"1.0","source":{"id":"1507.08967","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.08967","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1507.08967v3","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.08967","created_at":"2026-05-18T00:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"GI2UXTANG5XL","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GI2UXTANG5XLC6NM","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GI2UXTAN","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:3722c9771f419e8f02ec3c882d0610386408ed9766816006d146018006161615","target":"graph","created_at":"2026-05-18T00:55:58Z","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":"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","authors_text":"Fan Chung, Olivia Simpson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-31T18:12:27Z","title":"Distributed Algorithms for Finding Local Clusters Using Heat Kernel Pagerank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.08967","kind":"arxiv","version":3},"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:5cf222963c00315e27ecf0abfac1ee4b3065e2e6b764f5d3908b1971765fae31","target":"record","created_at":"2026-05-18T00:55:58Z","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":"b2752ef396ec6f33d9d943da09e8e023ca42855e585cf459a29ef5630a356d94","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-31T18:12:27Z","title_canon_sha256":"e27863fb33662dbfee8b13c84cd69f156f6261e703c1d825e3dd7b98d4290fa3"},"schema_version":"1.0","source":{"id":"1507.08967","kind":"arxiv","version":3}},"canonical_sha256":"32354bcc0d376eb179ac42213a39c628014b1d77c4cb8e99343face88239ca3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32354bcc0d376eb179ac42213a39c628014b1d77c4cb8e99343face88239ca3a","first_computed_at":"2026-05-18T00:55:58.521496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:58.521496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BKsJWAtxEPfaD+r2IduGTa3oi256QKc9tw0YnJzGmpDRTrUTtZEWrC+Ia1KldyEoK84n2eJUuOLt4Df3vav7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:58.522001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.08967","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cf222963c00315e27ecf0abfac1ee4b3065e2e6b764f5d3908b1971765fae31","sha256:3722c9771f419e8f02ec3c882d0610386408ed9766816006d146018006161615"],"state_sha256":"71daaba86a6175d9b7e8f70c76ae3a8d0352d06c9e719d99e24f9a0880a1c395"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xO23BgK3l63qkxx3NlE+GJHkXBkH0dnqE4eTx2Xmtm0Fa529LlLY07y7SPuM8qCLfkYvucy20K1cnT7HY6V1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:21:35.015681Z","bundle_sha256":"27a35fa995ac6a147b0cdbd31ce9ca2ed821c01025b16280719e926a6415e98f"}}