{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BGJIX4R2UMJHQQNPA63AFB6RQE","short_pith_number":"pith:BGJIX4R2","canonical_record":{"source":{"id":"1709.06955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-20T16:32:29Z","cross_cats_sorted":[],"title_canon_sha256":"c3f1b91581219ceae69adf0a5460c66be2c5e05cadab40f9da8a52c67729b135","abstract_canon_sha256":"929253c9209f39961f8a55619aa79edd61cf639b7146db020cdae41f8b04f94d"},"schema_version":"1.0"},"canonical_sha256":"09928bf23aa3127841af07b60287d1812641b56cc308d2c8f9f34c772e45e439","source":{"kind":"arxiv","id":"1709.06955","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06955","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06955v2","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06955","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"BGJIX4R2UMJH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BGJIX4R2UMJHQQNP","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BGJIX4R2","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BGJIX4R2UMJHQQNPA63AFB6RQE","target":"record","payload":{"canonical_record":{"source":{"id":"1709.06955","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-20T16:32:29Z","cross_cats_sorted":[],"title_canon_sha256":"c3f1b91581219ceae69adf0a5460c66be2c5e05cadab40f9da8a52c67729b135","abstract_canon_sha256":"929253c9209f39961f8a55619aa79edd61cf639b7146db020cdae41f8b04f94d"},"schema_version":"1.0"},"canonical_sha256":"09928bf23aa3127841af07b60287d1812641b56cc308d2c8f9f34c772e45e439","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:13.316648Z","signature_b64":"sq597jQ4C5Ytc1HItDCidmehoF0EQd5LsMSRsQ7YDm8IRPBiOI3D1T6eAwVLEP0lKok3yiKjX2FLrgiSM09FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09928bf23aa3127841af07b60287d1812641b56cc308d2c8f9f34c772e45e439","last_reissued_at":"2026-05-18T00:02:13.316043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:13.316043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.06955","source_version":2,"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-18T00:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPwTXdFFhYw+h+RArE2MDgH7S3N3IpNFQKlNfgtt3n8sbU8zxC1qVcX/2y/mp52T06/krJn6QrUBp2EyIxBYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:52:32.583849Z"},"content_sha256":"4baf67f249a5e95b3292ef8cffe75ddbe213d26ad650a70cef4a22a1f4b58a6c","schema_version":"1.0","event_id":"sha256:4baf67f249a5e95b3292ef8cffe75ddbe213d26ad650a70cef4a22a1f4b58a6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BGJIX4R2UMJHQQNPA63AFB6RQE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bolong Zheng, Jiaheng Lu, Kai Zheng, Xiaodong He, Xiaokui Xiao, Yu Liu, Zhewei Wei","submitted_at":"2017-09-20T16:32:29Z","abstract_excerpt":"Single-source and top-$k$ SimRank queries are two important types of similarity search in graphs with numerous applications in web mining, social network analysis, spam detection, etc. A plethora of techniques have been proposed for these two types of queries, but very few can efficiently support similarity search over large dynamic graphs, due to either significant preprocessing time or large space overheads.\n  This paper presents ProbeSim, an index-free algorithm for single-source and top-$k$ SimRank queries that provides a non-trivial theoretical guarantee in the absolute error of query res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06955","kind":"arxiv","version":2},"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-18T00:02:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xzhknQ8hxZgG6hwY1zCgu9xoIvRnPvCvFe3Vyyly2o9uWlDO2Tc/ULzZHihL8/FmFTyXcV32onb832U50/K4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:52:32.584201Z"},"content_sha256":"c8d8d4f9059723724ec1161caa3c5e943b43076f0f7acf618c1ecc8f841eb01a","schema_version":"1.0","event_id":"sha256:c8d8d4f9059723724ec1161caa3c5e943b43076f0f7acf618c1ecc8f841eb01a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGJIX4R2UMJHQQNPA63AFB6RQE/bundle.json","state_url":"https://pith.science/pith/BGJIX4R2UMJHQQNPA63AFB6RQE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGJIX4R2UMJHQQNPA63AFB6RQE/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-28T10:52:32Z","links":{"resolver":"https://pith.science/pith/BGJIX4R2UMJHQQNPA63AFB6RQE","bundle":"https://pith.science/pith/BGJIX4R2UMJHQQNPA63AFB6RQE/bundle.json","state":"https://pith.science/pith/BGJIX4R2UMJHQQNPA63AFB6RQE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGJIX4R2UMJHQQNPA63AFB6RQE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BGJIX4R2UMJHQQNPA63AFB6RQE","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":"929253c9209f39961f8a55619aa79edd61cf639b7146db020cdae41f8b04f94d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-20T16:32:29Z","title_canon_sha256":"c3f1b91581219ceae69adf0a5460c66be2c5e05cadab40f9da8a52c67729b135"},"schema_version":"1.0","source":{"id":"1709.06955","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.06955","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"arxiv_version","alias_value":"1709.06955v2","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06955","created_at":"2026-05-18T00:02:13Z"},{"alias_kind":"pith_short_12","alias_value":"BGJIX4R2UMJH","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BGJIX4R2UMJHQQNP","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BGJIX4R2","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:c8d8d4f9059723724ec1161caa3c5e943b43076f0f7acf618c1ecc8f841eb01a","target":"graph","created_at":"2026-05-18T00:02:13Z","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":"Single-source and top-$k$ SimRank queries are two important types of similarity search in graphs with numerous applications in web mining, social network analysis, spam detection, etc. A plethora of techniques have been proposed for these two types of queries, but very few can efficiently support similarity search over large dynamic graphs, due to either significant preprocessing time or large space overheads.\n  This paper presents ProbeSim, an index-free algorithm for single-source and top-$k$ SimRank queries that provides a non-trivial theoretical guarantee in the absolute error of query res","authors_text":"Bolong Zheng, Jiaheng Lu, Kai Zheng, Xiaodong He, Xiaokui Xiao, Yu Liu, Zhewei Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-20T16:32:29Z","title":"ProbeSim: Scalable Single-Source and Top-k SimRank Computations on Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06955","kind":"arxiv","version":2},"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:4baf67f249a5e95b3292ef8cffe75ddbe213d26ad650a70cef4a22a1f4b58a6c","target":"record","created_at":"2026-05-18T00:02:13Z","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":"929253c9209f39961f8a55619aa79edd61cf639b7146db020cdae41f8b04f94d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-20T16:32:29Z","title_canon_sha256":"c3f1b91581219ceae69adf0a5460c66be2c5e05cadab40f9da8a52c67729b135"},"schema_version":"1.0","source":{"id":"1709.06955","kind":"arxiv","version":2}},"canonical_sha256":"09928bf23aa3127841af07b60287d1812641b56cc308d2c8f9f34c772e45e439","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09928bf23aa3127841af07b60287d1812641b56cc308d2c8f9f34c772e45e439","first_computed_at":"2026-05-18T00:02:13.316043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:13.316043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sq597jQ4C5Ytc1HItDCidmehoF0EQd5LsMSRsQ7YDm8IRPBiOI3D1T6eAwVLEP0lKok3yiKjX2FLrgiSM09FCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:13.316648Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.06955","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4baf67f249a5e95b3292ef8cffe75ddbe213d26ad650a70cef4a22a1f4b58a6c","sha256:c8d8d4f9059723724ec1161caa3c5e943b43076f0f7acf618c1ecc8f841eb01a"],"state_sha256":"82ac61d397b9913db2e9ecaf1a5e8fd8f86b7b264aeba0f54023ec2dc7fbbd0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCdwrt56BYckngz0+8bnFCx4D3NiECl1TcwbjZI1ygP/FNsicyNMJ8qzlcdkA3TtlVHaBi7YQrAPELGy9R6nDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:52:32.586186Z","bundle_sha256":"6441e48cf70551ac4a15e9de0c354bdaeab3f0bb73b754c460012a2cc14e9ec9"}}