{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7EKVF4GDCLQRLLQCT6ZCZ53UIQ","short_pith_number":"pith:7EKVF4GD","canonical_record":{"source":{"id":"1411.7228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T13:57:03Z","cross_cats_sorted":[],"title_canon_sha256":"273901e11661d2c46ae0628a0f362e2b1e89246e4fc4a0b503625aad57196074","abstract_canon_sha256":"45e2d39ce1fdd96630399474f79ccef7d898df21942a70e14dbb477f55070b5d"},"schema_version":"1.0"},"canonical_sha256":"f91552f0c312e115ae029fb22cf7744415cfccf86f5a5266b6454c3e3149a497","source":{"kind":"arxiv","id":"1411.7228","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7228","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7228v1","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7228","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"7EKVF4GDCLQR","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7EKVF4GDCLQRLLQC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7EKVF4GD","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7EKVF4GDCLQRLLQCT6ZCZ53UIQ","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T13:57:03Z","cross_cats_sorted":[],"title_canon_sha256":"273901e11661d2c46ae0628a0f362e2b1e89246e4fc4a0b503625aad57196074","abstract_canon_sha256":"45e2d39ce1fdd96630399474f79ccef7d898df21942a70e14dbb477f55070b5d"},"schema_version":"1.0"},"canonical_sha256":"f91552f0c312e115ae029fb22cf7744415cfccf86f5a5266b6454c3e3149a497","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:44.989111Z","signature_b64":"3r5qcbAs6IVQDzZkuDvpUMC1z/3MJNldaKfyPY/iCkETSoIWqrSPx0Z3LjqE4dmRMOamrkvgsMbLRkKORBbDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f91552f0c312e115ae029fb22cf7744415cfccf86f5a5266b6454c3e3149a497","last_reissued_at":"2026-05-18T02:32:44.988562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:44.988562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7228","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-18T02:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dxPX5v9+lTcMHkWIEsQDbOIGTq+BdaO1RDOtEE02Ae+y7B7/zjadDxzFXF+LFzcmxjU3vaJGUKtSNLHZLlGiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:58:12.895958Z"},"content_sha256":"4dab704e21a7247c64f1cbf8b3b47b49d2051f1c809f64cc069dc2a3f0dadb43","schema_version":"1.0","event_id":"sha256:4dab704e21a7247c64f1cbf8b3b47b49d2051f1c809f64cc069dc2a3f0dadb43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7EKVF4GDCLQRLLQCT6ZCZ53UIQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient SimRank Computation via Linearization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ken-ichi Kawarabayashi, Mitsuru Kusumoto, Takanori Maehara","submitted_at":"2014-11-26T13:57:03Z","abstract_excerpt":"SimRank, proposed by Jeh and Widom, provides a good similarity measure that has been successfully used in numerous applications. While there are many algorithms proposed for computing SimRank, their computational costs are very high. In this paper, we propose a new computational technique, \"SimRank linearization,\" for computing SimRank, which converts the SimRank problem to a linear equation problem. By using this technique, we can solve many SimRank problems, such as single-pair compuation, single-source computation, all-pairs computation, top k searching, and similarity join problems, effici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7228","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-18T02:32:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"trx8ZCON+s8XEdbdYtHksn47+4cbste8NSEO/3t/+juMjq/Ew+KC8VJXlgCYPPZ59mJAVjzoX34NolktOv3DCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:58:12.896301Z"},"content_sha256":"13f6f04571611b1dd29a304a7b295e8ee04846f2435605315409fc0074eee259","schema_version":"1.0","event_id":"sha256:13f6f04571611b1dd29a304a7b295e8ee04846f2435605315409fc0074eee259"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EKVF4GDCLQRLLQCT6ZCZ53UIQ/bundle.json","state_url":"https://pith.science/pith/7EKVF4GDCLQRLLQCT6ZCZ53UIQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EKVF4GDCLQRLLQCT6ZCZ53UIQ/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-06-02T22:58:12Z","links":{"resolver":"https://pith.science/pith/7EKVF4GDCLQRLLQCT6ZCZ53UIQ","bundle":"https://pith.science/pith/7EKVF4GDCLQRLLQCT6ZCZ53UIQ/bundle.json","state":"https://pith.science/pith/7EKVF4GDCLQRLLQCT6ZCZ53UIQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EKVF4GDCLQRLLQCT6ZCZ53UIQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7EKVF4GDCLQRLLQCT6ZCZ53UIQ","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":"45e2d39ce1fdd96630399474f79ccef7d898df21942a70e14dbb477f55070b5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T13:57:03Z","title_canon_sha256":"273901e11661d2c46ae0628a0f362e2b1e89246e4fc4a0b503625aad57196074"},"schema_version":"1.0","source":{"id":"1411.7228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7228","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7228v1","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7228","created_at":"2026-05-18T02:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"7EKVF4GDCLQR","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7EKVF4GDCLQRLLQC","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7EKVF4GD","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:13f6f04571611b1dd29a304a7b295e8ee04846f2435605315409fc0074eee259","target":"graph","created_at":"2026-05-18T02:32:44Z","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, proposed by Jeh and Widom, provides a good similarity measure that has been successfully used in numerous applications. While there are many algorithms proposed for computing SimRank, their computational costs are very high. In this paper, we propose a new computational technique, \"SimRank linearization,\" for computing SimRank, which converts the SimRank problem to a linear equation problem. By using this technique, we can solve many SimRank problems, such as single-pair compuation, single-source computation, all-pairs computation, top k searching, and similarity join problems, effici","authors_text":"Ken-ichi Kawarabayashi, Mitsuru Kusumoto, Takanori Maehara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T13:57:03Z","title":"Efficient SimRank Computation via Linearization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7228","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:4dab704e21a7247c64f1cbf8b3b47b49d2051f1c809f64cc069dc2a3f0dadb43","target":"record","created_at":"2026-05-18T02:32:44Z","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":"45e2d39ce1fdd96630399474f79ccef7d898df21942a70e14dbb477f55070b5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-26T13:57:03Z","title_canon_sha256":"273901e11661d2c46ae0628a0f362e2b1e89246e4fc4a0b503625aad57196074"},"schema_version":"1.0","source":{"id":"1411.7228","kind":"arxiv","version":1}},"canonical_sha256":"f91552f0c312e115ae029fb22cf7744415cfccf86f5a5266b6454c3e3149a497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f91552f0c312e115ae029fb22cf7744415cfccf86f5a5266b6454c3e3149a497","first_computed_at":"2026-05-18T02:32:44.988562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:44.988562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3r5qcbAs6IVQDzZkuDvpUMC1z/3MJNldaKfyPY/iCkETSoIWqrSPx0Z3LjqE4dmRMOamrkvgsMbLRkKORBbDAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:44.989111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dab704e21a7247c64f1cbf8b3b47b49d2051f1c809f64cc069dc2a3f0dadb43","sha256:13f6f04571611b1dd29a304a7b295e8ee04846f2435605315409fc0074eee259"],"state_sha256":"cc06141ef8a8095ab16d1b6c72725e3953fb331a34046d303fec10e4c88edada"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dt3SNvfpawOtH6zpgTBHwwStJ5BWsMOSlw+DhVAywtdaPoF5e0ZEd79M2vO2ng2ezPBeWjvJPzR+oKVUCvU/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:58:12.898240Z","bundle_sha256":"f45ae78c687ed31500307e5d6e86a07ef9c26bd5b0c1937148d942b17798b14d"}}