{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DO2EYER3KEJAEEIAMH6EJAIWTE","short_pith_number":"pith:DO2EYER3","schema_version":"1.0","canonical_sha256":"1bb44c123b511202110061fc448116990b51162181fd1bd65b6a1be4842194ea","source":{"kind":"arxiv","id":"1512.02714","version":1},"attestation_state":"computed","paper":{"title":"SimRank Computation on Uncertain Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jianzhong Li, Rong Zhu, Zhaonian Zou","submitted_at":"2015-12-09T01:32:04Z","abstract_excerpt":"SimRank is a similarity measure between vertices in a graph, which has become a fundamental technique in graph analytics. Recently, many algorithms have been proposed for efficient evaluation of SimRank similarities. However, the existing SimRank computation algorithms either overlook uncertainty in graph structures or is based on an unreasonable assumption (Du et al). In this paper, we study SimRank similarities on uncertain graphs based on the possible world model of uncertain graphs. Following the random-walk-based formulation of SimRank on deterministic graphs and the possible worlds model"},"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":"1512.02714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-12-09T01:32:04Z","cross_cats_sorted":[],"title_canon_sha256":"5a4af69cb29942742f278d43ca82b71fc525922a5bdff30451dea485e1abaaec","abstract_canon_sha256":"51a30770626eb5eb875a279070122d98ecbfe2af31a283b1fd9a9d6d1fdaba76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:43.280120Z","signature_b64":"QAZBEH+TF4F3rD4SDj/LGLPCmi1TDYjcuvtBPtMk4jx9wIhwVigps4tTw8Opjg1LPJjf2jIpjA9Pzg4oUxsTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bb44c123b511202110061fc448116990b51162181fd1bd65b6a1be4842194ea","last_reissued_at":"2026-05-18T01:24:43.279598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:43.279598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SimRank Computation on Uncertain Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jianzhong Li, Rong Zhu, Zhaonian Zou","submitted_at":"2015-12-09T01:32:04Z","abstract_excerpt":"SimRank is a similarity measure between vertices in a graph, which has become a fundamental technique in graph analytics. Recently, many algorithms have been proposed for efficient evaluation of SimRank similarities. However, the existing SimRank computation algorithms either overlook uncertainty in graph structures or is based on an unreasonable assumption (Du et al). In this paper, we study SimRank similarities on uncertain graphs based on the possible world model of uncertain graphs. Following the random-walk-based formulation of SimRank on deterministic graphs and the possible worlds model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02714","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":"1512.02714","created_at":"2026-05-18T01:24:43.279675+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02714v1","created_at":"2026-05-18T01:24:43.279675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02714","created_at":"2026-05-18T01:24:43.279675+00:00"},{"alias_kind":"pith_short_12","alias_value":"DO2EYER3KEJA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DO2EYER3KEJAEEIA","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DO2EYER3","created_at":"2026-05-18T12:29:17.054201+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/DO2EYER3KEJAEEIAMH6EJAIWTE","json":"https://pith.science/pith/DO2EYER3KEJAEEIAMH6EJAIWTE.json","graph_json":"https://pith.science/api/pith-number/DO2EYER3KEJAEEIAMH6EJAIWTE/graph.json","events_json":"https://pith.science/api/pith-number/DO2EYER3KEJAEEIAMH6EJAIWTE/events.json","paper":"https://pith.science/paper/DO2EYER3"},"agent_actions":{"view_html":"https://pith.science/pith/DO2EYER3KEJAEEIAMH6EJAIWTE","download_json":"https://pith.science/pith/DO2EYER3KEJAEEIAMH6EJAIWTE.json","view_paper":"https://pith.science/paper/DO2EYER3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02714&json=true","fetch_graph":"https://pith.science/api/pith-number/DO2EYER3KEJAEEIAMH6EJAIWTE/graph.json","fetch_events":"https://pith.science/api/pith-number/DO2EYER3KEJAEEIAMH6EJAIWTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DO2EYER3KEJAEEIAMH6EJAIWTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DO2EYER3KEJAEEIAMH6EJAIWTE/action/storage_attestation","attest_author":"https://pith.science/pith/DO2EYER3KEJAEEIAMH6EJAIWTE/action/author_attestation","sign_citation":"https://pith.science/pith/DO2EYER3KEJAEEIAMH6EJAIWTE/action/citation_signature","submit_replication":"https://pith.science/pith/DO2EYER3KEJAEEIAMH6EJAIWTE/action/replication_record"}},"created_at":"2026-05-18T01:24:43.279675+00:00","updated_at":"2026-05-18T01:24:43.279675+00:00"}