{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7HE7P3F66QNX34HI7D5XBMDEC5","short_pith_number":"pith:7HE7P3F6","schema_version":"1.0","canonical_sha256":"f9c9f7ecbef41b7df0e8f8fb70b06417592a02b88ad74bf0f78be98754ef625e","source":{"kind":"arxiv","id":"1905.02354","version":1},"attestation_state":"computed","paper":{"title":"PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ji-Rong Wen, Sibo Wang, Xiaodong He, Xiaokui Xiao, Xiaoyong Du, Yu Liu, Zhewei Wei","submitted_at":"2019-05-07T05:00:00Z","abstract_excerpt":"{\\it SimRank} is a classic measure of the similarities of nodes in a graph. Given a node $u$ in graph $G =(V, E)$, a {\\em single-source SimRank query} returns the SimRank similarities $s(u, v)$ between node $u$ and each node $v \\in V$. This type of queries has numerous applications in web search and social networks analysis, such as link prediction, web mining, and spam detection. Existing methods for single-source SimRank queries, however, incur query cost at least linear to the number of nodes $n$, which renders them inapplicable for real-time and interactive analysis.\n  { This paper propose"},"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":"1905.02354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T05:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"c7fd2afbbc6a51790179a752311ee4d7c02b948d9b78023d7f36af6abdafc604","abstract_canon_sha256":"c80f10320c1de5b0ea4320acdf196ee7aeb343d5ca3157b58fade22dcccf57e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:51.691940Z","signature_b64":"Y3cFaTTFz7c2JgQgLaZRE4JxdHXcfgZPfnj4EHE+rWgOd6LeBPaJc1aw+v5hoH7xMygmACbOVbmhb7gqpUoMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9c9f7ecbef41b7df0e8f8fb70b06417592a02b88ad74bf0f78be98754ef625e","last_reissued_at":"2026-05-17T23:46:51.691264Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:51.691264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ji-Rong Wen, Sibo Wang, Xiaodong He, Xiaokui Xiao, Xiaoyong Du, Yu Liu, Zhewei Wei","submitted_at":"2019-05-07T05:00:00Z","abstract_excerpt":"{\\it SimRank} is a classic measure of the similarities of nodes in a graph. Given a node $u$ in graph $G =(V, E)$, a {\\em single-source SimRank query} returns the SimRank similarities $s(u, v)$ between node $u$ and each node $v \\in V$. This type of queries has numerous applications in web search and social networks analysis, such as link prediction, web mining, and spam detection. Existing methods for single-source SimRank queries, however, incur query cost at least linear to the number of nodes $n$, which renders them inapplicable for real-time and interactive analysis.\n  { This paper propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02354","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":"1905.02354","created_at":"2026-05-17T23:46:51.691381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02354v1","created_at":"2026-05-17T23:46:51.691381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02354","created_at":"2026-05-17T23:46:51.691381+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HE7P3F66QNX","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HE7P3F66QNX34HI","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HE7P3F6","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/7HE7P3F66QNX34HI7D5XBMDEC5","json":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5.json","graph_json":"https://pith.science/api/pith-number/7HE7P3F66QNX34HI7D5XBMDEC5/graph.json","events_json":"https://pith.science/api/pith-number/7HE7P3F66QNX34HI7D5XBMDEC5/events.json","paper":"https://pith.science/paper/7HE7P3F6"},"agent_actions":{"view_html":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5","download_json":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5.json","view_paper":"https://pith.science/paper/7HE7P3F6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02354&json=true","fetch_graph":"https://pith.science/api/pith-number/7HE7P3F66QNX34HI7D5XBMDEC5/graph.json","fetch_events":"https://pith.science/api/pith-number/7HE7P3F66QNX34HI7D5XBMDEC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5/action/storage_attestation","attest_author":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5/action/author_attestation","sign_citation":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5/action/citation_signature","submit_replication":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5/action/replication_record"}},"created_at":"2026-05-17T23:46:51.691381+00:00","updated_at":"2026-05-17T23:46:51.691381+00:00"}