{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AAVKJY6EILXGAZYDT4AUAQQSM4","short_pith_number":"pith:AAVKJY6E","schema_version":"1.0","canonical_sha256":"002aa4e3c442ee6067039f01404212671440a5aaa6d9ade6e6af7bb5f079c86d","source":{"kind":"arxiv","id":"1904.02707","version":1},"attestation_state":"computed","paper":{"title":"Efficient Estimation of Heat Kernel PageRank for Local Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Jun Zhao, Renchi Yang, Rong-Hua Li, Sourav S Bhowmick, Xiaokui Xiao, Zhewei Wei","submitted_at":"2019-04-03T06:16:50Z","abstract_excerpt":"Given an undirected graph G and a seed node s, the local clustering problem aims to identify a high-quality cluster containing s in time roughly proportional to the size of the cluster, regardless of the size of G. This problem finds numerous applications on large-scale graphs. Recently, heat kernel PageRank (HKPR), which is a measure of the proximity of nodes in graphs, is applied to this problem and found to be more efficient compared with prior methods. However, existing solutions for computing HKPR either are prohibitively expensive or provide unsatisfactory error approximation on HKPR val"},"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":"1904.02707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-03T06:16:50Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"ef1ea58186ae4677b4338cd90d80d9575255138cb18f11d0f8ebcdd245e66d2e","abstract_canon_sha256":"c7001f14449aa289b06d1a47f918ba492fa5af30d8cbf421ea0d1c57ade9f857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:19.991755Z","signature_b64":"W8DdpjxYLEMBzE7LRrFGEc0MKfDXlZKYcPrDwkf/9XrNpAptZJicbKbJ+V7u4aZm6JS25r2X2k78DHDuM3NPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"002aa4e3c442ee6067039f01404212671440a5aaa6d9ade6e6af7bb5f079c86d","last_reissued_at":"2026-05-17T23:49:19.991059Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:19.991059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Estimation of Heat Kernel PageRank for Local Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Jun Zhao, Renchi Yang, Rong-Hua Li, Sourav S Bhowmick, Xiaokui Xiao, Zhewei Wei","submitted_at":"2019-04-03T06:16:50Z","abstract_excerpt":"Given an undirected graph G and a seed node s, the local clustering problem aims to identify a high-quality cluster containing s in time roughly proportional to the size of the cluster, regardless of the size of G. This problem finds numerous applications on large-scale graphs. Recently, heat kernel PageRank (HKPR), which is a measure of the proximity of nodes in graphs, is applied to this problem and found to be more efficient compared with prior methods. However, existing solutions for computing HKPR either are prohibitively expensive or provide unsatisfactory error approximation on HKPR val"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02707","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":""},"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":"1904.02707","created_at":"2026-05-17T23:49:19.991159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02707v1","created_at":"2026-05-17T23:49:19.991159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02707","created_at":"2026-05-17T23:49:19.991159+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAVKJY6EILXG","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAVKJY6EILXGAZYD","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAVKJY6E","created_at":"2026-05-18T12:33:12.712433+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/AAVKJY6EILXGAZYDT4AUAQQSM4","json":"https://pith.science/pith/AAVKJY6EILXGAZYDT4AUAQQSM4.json","graph_json":"https://pith.science/api/pith-number/AAVKJY6EILXGAZYDT4AUAQQSM4/graph.json","events_json":"https://pith.science/api/pith-number/AAVKJY6EILXGAZYDT4AUAQQSM4/events.json","paper":"https://pith.science/paper/AAVKJY6E"},"agent_actions":{"view_html":"https://pith.science/pith/AAVKJY6EILXGAZYDT4AUAQQSM4","download_json":"https://pith.science/pith/AAVKJY6EILXGAZYDT4AUAQQSM4.json","view_paper":"https://pith.science/paper/AAVKJY6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02707&json=true","fetch_graph":"https://pith.science/api/pith-number/AAVKJY6EILXGAZYDT4AUAQQSM4/graph.json","fetch_events":"https://pith.science/api/pith-number/AAVKJY6EILXGAZYDT4AUAQQSM4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAVKJY6EILXGAZYDT4AUAQQSM4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAVKJY6EILXGAZYDT4AUAQQSM4/action/storage_attestation","attest_author":"https://pith.science/pith/AAVKJY6EILXGAZYDT4AUAQQSM4/action/author_attestation","sign_citation":"https://pith.science/pith/AAVKJY6EILXGAZYDT4AUAQQSM4/action/citation_signature","submit_replication":"https://pith.science/pith/AAVKJY6EILXGAZYDT4AUAQQSM4/action/replication_record"}},"created_at":"2026-05-17T23:49:19.991159+00:00","updated_at":"2026-05-17T23:49:19.991159+00:00"}