{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WLPOIE5JLKW4IXTWDRDA5GQMVL","short_pith_number":"pith:WLPOIE5J","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"},"canonical_sha256":"b2dee413a95aadc45e761c460e9a0caaf38c6886a9025f54f4b6fe233a7944bc","source":{"kind":"arxiv","id":"1604.04185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04185","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04185v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04185","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"WLPOIE5JLKW4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WLPOIE5JLKW4IXTW","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WLPOIE5J","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WLPOIE5JLKW4IXTWDRDA5GQMVL","target":"record","payload":{"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"},"canonical_sha256":"b2dee413a95aadc45e761c460e9a0caaf38c6886a9025f54f4b6fe233a7944bc","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"},"source_kind":"arxiv","source_id":"1604.04185","source_version":1,"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-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWHUF1XaaLuWNMDZaCNuCPyjkwHvQx0pED7r+nqeGdpimlo4rSdQgZw6jidDsav3eGwUtwzjV6CJ7pELcRFvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:30:34.080762Z"},"content_sha256":"6152164d781107b2615eee75bd539e73e97f7dd317c70f2c99837ee3d40d9a31","schema_version":"1.0","event_id":"sha256:6152164d781107b2615eee75bd539e73e97f7dd317c70f2c99837ee3d40d9a31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WLPOIE5JLKW4IXTWDRDA5GQMVL","target":"graph","payload":{"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"},"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-18T01:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zIG0OJdlmEBnFboJyP4seurL1IOSDrqtqSQqrJITfKbExlT3tn2nagNS/dnaHh8LvUlH9gt0p9ObeBUAJ73KBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:30:34.081104Z"},"content_sha256":"cb0d595b3ee7b0fbc9728f4042bbce8ab159bb54e72bf5f324baef4352098c86","schema_version":"1.0","event_id":"sha256:cb0d595b3ee7b0fbc9728f4042bbce8ab159bb54e72bf5f324baef4352098c86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/bundle.json","state_url":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/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-28T07:30:34Z","links":{"resolver":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL","bundle":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/bundle.json","state":"https://pith.science/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLPOIE5JLKW4IXTWDRDA5GQMVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WLPOIE5JLKW4IXTWDRDA5GQMVL","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":"0f3d78984890900cfa8cf2bad9106ff726c3540249ead8065e21c03467a7e966","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-14T15:17:01Z","title_canon_sha256":"05eb09f56d26c95ec4de530982ff817a38c4d9792e3dba64a729e847ad5cfc96"},"schema_version":"1.0","source":{"id":"1604.04185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04185","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04185v1","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04185","created_at":"2026-05-18T01:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"WLPOIE5JLKW4","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"WLPOIE5JLKW4IXTW","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"WLPOIE5J","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:cb0d595b3ee7b0fbc9728f4042bbce8ab159bb54e72bf5f324baef4352098c86","target":"graph","created_at":"2026-05-18T01:17:06Z","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":"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","authors_text":"Boyu Tian, Xiaokui Xiao","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-14T15:17:01Z","title":"SLING: A Near-Optimal Index Structure for SimRank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04185","kind":"arxiv","version":1},"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:6152164d781107b2615eee75bd539e73e97f7dd317c70f2c99837ee3d40d9a31","target":"record","created_at":"2026-05-18T01:17:06Z","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":"0f3d78984890900cfa8cf2bad9106ff726c3540249ead8065e21c03467a7e966","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-04-14T15:17:01Z","title_canon_sha256":"05eb09f56d26c95ec4de530982ff817a38c4d9792e3dba64a729e847ad5cfc96"},"schema_version":"1.0","source":{"id":"1604.04185","kind":"arxiv","version":1}},"canonical_sha256":"b2dee413a95aadc45e761c460e9a0caaf38c6886a9025f54f4b6fe233a7944bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2dee413a95aadc45e761c460e9a0caaf38c6886a9025f54f4b6fe233a7944bc","first_computed_at":"2026-05-18T01:17:06.287235Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:06.287235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o/fy6+cfxrJnM0rE1jbfxV7zuUEx5Rp3r+iKvwtSiNGwpN2cQhe2vIBUa6byTGo2qSRcErRcABftRHIVfrJ/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:06.287951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6152164d781107b2615eee75bd539e73e97f7dd317c70f2c99837ee3d40d9a31","sha256:cb0d595b3ee7b0fbc9728f4042bbce8ab159bb54e72bf5f324baef4352098c86"],"state_sha256":"f89217686d42dc58e2a7bad0aa018dd0040981e17fc82db03155fa12897fab1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtDVVlK0Xdne1yZG8mi1O9rgpgeqEI0rhUQ7IJW2mczem8hfw9gYDE0PW2kC0Ys4jiraIYGR8ryPwyCvb0E1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:30:34.083060Z","bundle_sha256":"29df4fcd36e2c2f569798babca809dd12e758447d491b0209714a95a774b2bc6"}}