{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WLPOIE5JLKW4IXTWDRDA5GQMVL","short_pith_number":"pith:WLPOIE5J","schema_version":"1.0","canonical_sha256":"b2dee413a95aadc45e761c460e9a0caaf38c6886a9025f54f4b6fe233a7944bc","source":{"kind":"arxiv","id":"1604.04185","version":1},"attestation_state":"computed","paper":{"title":"SLING: A Near-Optimal Index Structure for SimRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Boyu Tian, Xiaokui Xiao","submitted_at":"2016-04-14T15:17:01Z","abstract_excerpt":"SimRank is a similarity measure for graph nodes that has numerous applications in practice. Scalable SimRank computation has been the subject of extensive research for more than a decade, and yet, none of the existing solutions can efficiently derive SimRank scores on large graphs with provable accuracy guarantees. In particular, the state-of-the-art solution requires up to a few seconds to compute a SimRank score in million-node graphs, and does not offer any worst-case assurance in terms of the query error.\n  This paper presents SLING, an efficient index structure for SimRank computation. SL"},"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":"1604.04185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-14T15:17:01Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"05eb09f56d26c95ec4de530982ff817a38c4d9792e3dba64a729e847ad5cfc96","abstract_canon_sha256":"0f3d78984890900cfa8cf2bad9106ff726c3540249ead8065e21c03467a7e966"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:06.287951Z","signature_b64":"o/fy6+cfxrJnM0rE1jbfxV7zuUEx5Rp3r+iKvwtSiNGwpN2cQhe2vIBUa6byTGo2qSRcErRcABftRHIVfrJ/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2dee413a95aadc45e761c460e9a0caaf38c6886a9025f54f4b6fe233a7944bc","last_reissued_at":"2026-05-18T01:17:06.287235Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:06.287235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SLING: A Near-Optimal Index Structure for SimRank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Boyu Tian, Xiaokui Xiao","submitted_at":"2016-04-14T15:17:01Z","abstract_excerpt":"SimRank is a similarity measure for graph nodes that has numerous applications in practice. Scalable SimRank computation has been the subject of extensive research for more than a decade, and yet, none of the existing solutions can efficiently derive SimRank scores on large graphs with provable accuracy guarantees. In particular, the state-of-the-art solution requires up to a few seconds to compute a SimRank score in million-node graphs, and does not offer any worst-case assurance in terms of the query error.\n  This paper presents SLING, an efficient index structure for SimRank computation. SL"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04185","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":"1604.04185","created_at":"2026-05-18T01:17:06.287364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04185v1","created_at":"2026-05-18T01:17:06.287364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04185","created_at":"2026-05-18T01:17:06.287364+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLPOIE5JLKW4","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLPOIE5JLKW4IXTW","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLPOIE5J","created_at":"2026-05-18T12:30:48.956258+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/WLPOIE5JLKW4IXTWDRDA5GQMVL","json":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL.json","graph_json":"https://pith.science/api/pith-number/WLPOIE5JLKW4IXTWDRDA5GQMVL/graph.json","events_json":"https://pith.science/api/pith-number/WLPOIE5JLKW4IXTWDRDA5GQMVL/events.json","paper":"https://pith.science/paper/WLPOIE5J"},"agent_actions":{"view_html":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL","download_json":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL.json","view_paper":"https://pith.science/paper/WLPOIE5J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04185&json=true","fetch_graph":"https://pith.science/api/pith-number/WLPOIE5JLKW4IXTWDRDA5GQMVL/graph.json","fetch_events":"https://pith.science/api/pith-number/WLPOIE5JLKW4IXTWDRDA5GQMVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/action/storage_attestation","attest_author":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/action/author_attestation","sign_citation":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/action/citation_signature","submit_replication":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/action/replication_record"}},"created_at":"2026-05-18T01:17:06.287364+00:00","updated_at":"2026-05-18T01:17:06.287364+00:00"}