{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7HE7P3F66QNX34HI7D5XBMDEC5","short_pith_number":"pith:7HE7P3F6","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"},"canonical_sha256":"f9c9f7ecbef41b7df0e8f8fb70b06417592a02b88ad74bf0f78be98754ef625e","source":{"kind":"arxiv","id":"1905.02354","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02354","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02354v1","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02354","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"7HE7P3F66QNX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7HE7P3F66QNX34HI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7HE7P3F6","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7HE7P3F66QNX34HI7D5XBMDEC5","target":"record","payload":{"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"},"canonical_sha256":"f9c9f7ecbef41b7df0e8f8fb70b06417592a02b88ad74bf0f78be98754ef625e","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"},"source_kind":"arxiv","source_id":"1905.02354","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-17T23:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"atPlJ/5g9QoYTlb2w3LjKcg0ibrO7dbj2ERnxGQWZ5W/5YZ+YOfdLHtfpbDpTRgQ9cRzrIobnx8j8UYFGjoxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:38:42.575981Z"},"content_sha256":"683d3e514014c6288fa4dad801e46e279db1297ca6b730c836f3e6e650bea3c8","schema_version":"1.0","event_id":"sha256:683d3e514014c6288fa4dad801e46e279db1297ca6b730c836f3e6e650bea3c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7HE7P3F66QNX34HI7D5XBMDEC5","target":"graph","payload":{"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"},"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-17T23:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgFJgIAK05sCq5f8/CJHcRQu7oBPUHXDRAfWbzhZCeQoiGJdlWPCFcOmYB8GqG/4PyN7ymIE2B1xoEEc/yYaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:38:42.576545Z"},"content_sha256":"03c26bfa07d713959f3f738567a3e350b186a08cd2ec280a7d961fa06727f403","schema_version":"1.0","event_id":"sha256:03c26bfa07d713959f3f738567a3e350b186a08cd2ec280a7d961fa06727f403"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5/bundle.json","state_url":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HE7P3F66QNX34HI7D5XBMDEC5/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-27T08:38:42Z","links":{"resolver":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5","bundle":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5/bundle.json","state":"https://pith.science/pith/7HE7P3F66QNX34HI7D5XBMDEC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HE7P3F66QNX34HI7D5XBMDEC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7HE7P3F66QNX34HI7D5XBMDEC5","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":"c80f10320c1de5b0ea4320acdf196ee7aeb343d5ca3157b58fade22dcccf57e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T05:00:00Z","title_canon_sha256":"c7fd2afbbc6a51790179a752311ee4d7c02b948d9b78023d7f36af6abdafc604"},"schema_version":"1.0","source":{"id":"1905.02354","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02354","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02354v1","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02354","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"7HE7P3F66QNX","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7HE7P3F66QNX34HI","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7HE7P3F6","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:03c26bfa07d713959f3f738567a3e350b186a08cd2ec280a7d961fa06727f403","target":"graph","created_at":"2026-05-17T23:46:51Z","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":"{\\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","authors_text":"Ji-Rong Wen, Sibo Wang, Xiaodong He, Xiaokui Xiao, Xiaoyong Du, Yu Liu, Zhewei Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T05:00:00Z","title":"PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02354","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:683d3e514014c6288fa4dad801e46e279db1297ca6b730c836f3e6e650bea3c8","target":"record","created_at":"2026-05-17T23:46:51Z","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":"c80f10320c1de5b0ea4320acdf196ee7aeb343d5ca3157b58fade22dcccf57e7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T05:00:00Z","title_canon_sha256":"c7fd2afbbc6a51790179a752311ee4d7c02b948d9b78023d7f36af6abdafc604"},"schema_version":"1.0","source":{"id":"1905.02354","kind":"arxiv","version":1}},"canonical_sha256":"f9c9f7ecbef41b7df0e8f8fb70b06417592a02b88ad74bf0f78be98754ef625e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9c9f7ecbef41b7df0e8f8fb70b06417592a02b88ad74bf0f78be98754ef625e","first_computed_at":"2026-05-17T23:46:51.691264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:51.691264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y3cFaTTFz7c2JgQgLaZRE4JxdHXcfgZPfnj4EHE+rWgOd6LeBPaJc1aw+v5hoH7xMygmACbOVbmhb7gqpUoMCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:51.691940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02354","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:683d3e514014c6288fa4dad801e46e279db1297ca6b730c836f3e6e650bea3c8","sha256:03c26bfa07d713959f3f738567a3e350b186a08cd2ec280a7d961fa06727f403"],"state_sha256":"6f55c6ce36ad6479ccdfe03dde4743035bcb3c472c0726667cd999885df3bd44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PoqBQnQIhJQKWi6sfl4qkDvS9CRICH/55FDeL2yQZ0k35kzGeQC7k344u0JJp8E8ijM46bmIQE1xyi+IufpuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:38:42.579401Z","bundle_sha256":"c6c70c05f453c476ffddc1da474eaabc6fb6fb4a0573bada083f26436557ca67"}}