{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PQODDNQPFD4HIMEMKKKC2HQSFR","short_pith_number":"pith:PQODDNQP","canonical_record":{"source":{"id":"1210.0151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-09-29T21:16:36Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"6592c4225f370035d027b235f8120828179605d651c1ca9f8af21804b034f96e","abstract_canon_sha256":"ba8fa3963845b5b00d5ec6e2f14018fe0826547a50837c22664b4470beccd203"},"schema_version":"1.0"},"canonical_sha256":"7c1c31b60f28f874308c52942d1e122c73bf3579f1ac597b86f2db4f27767366","source":{"kind":"arxiv","id":"1210.0151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0151","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0151v1","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0151","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"PQODDNQPFD4H","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PQODDNQPFD4HIMEM","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PQODDNQP","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PQODDNQPFD4HIMEMKKKC2HQSFR","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-09-29T21:16:36Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"6592c4225f370035d027b235f8120828179605d651c1ca9f8af21804b034f96e","abstract_canon_sha256":"ba8fa3963845b5b00d5ec6e2f14018fe0826547a50837c22664b4470beccd203"},"schema_version":"1.0"},"canonical_sha256":"7c1c31b60f28f874308c52942d1e122c73bf3579f1ac597b86f2db4f27767366","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:23.175884Z","signature_b64":"uMIX01gjRfLoWuYerxdHXfil3HANIi2z9cl/2ksDLI+gDi97Oo/BMTe8uD1AC1b3kXcCfZU6FQfKe64L33dKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c1c31b60f28f874308c52942d1e122c73bf3579f1ac597b86f2db4f27767366","last_reissued_at":"2026-05-18T03:44:23.175223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:23.175223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0151","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-18T03:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQ07+6Tn0H8PocKulxi22Mf2AtK2zm/v93GPrBKJSVdSlQIAE2PjP4Dz5vXoVbHhh4PoWbnXEOhG8TvJlQAACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:04:59.123205Z"},"content_sha256":"3e9edf34808fe74995d23037a4230b5fb76601ac207740abacb1e85530da0daa","schema_version":"1.0","event_id":"sha256:3e9edf34808fe74995d23037a4230b5fb76601ac207740abacb1e85530da0daa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PQODDNQPFD4HIMEMKKKC2HQSFR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementation of Privacy-preserving SimRank over Distributed Information Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.CR","authors_text":"Chih-Hua Tai, Ming-Syan Chen, Philip S. Yu, Yu-Wei Chu","submitted_at":"2012-09-29T21:16:36Z","abstract_excerpt":"Information network analysis has drawn a lot attention in recent years. Among all the aspects of network analysis, similarity measure of nodes has been shown useful in many applications, such as clustering, link prediction and community identification, to name a few. As linkage data in a large network is inherently sparse, it is noted that collecting more data can improve the quality of similarity measure. This gives different parties a motivation to cooperate. In this paper, we address the problem of link-based similarity measure of nodes in an information network distributed over different p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0151","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-18T03:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O1Ru03YDBqtAyHPst4Voxaw6Gm/ld4DvV/DBAmmsV3LtB8B3dFcY4dMkwmPhMNwUXUL1u3OW0jigPxPjG6WMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T09:04:59.123567Z"},"content_sha256":"ccead46b7853e058e0a456cda829001b403015e5400e0b2537a1b5242f3206ff","schema_version":"1.0","event_id":"sha256:ccead46b7853e058e0a456cda829001b403015e5400e0b2537a1b5242f3206ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQODDNQPFD4HIMEMKKKC2HQSFR/bundle.json","state_url":"https://pith.science/pith/PQODDNQPFD4HIMEMKKKC2HQSFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQODDNQPFD4HIMEMKKKC2HQSFR/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-07-05T09:04:59Z","links":{"resolver":"https://pith.science/pith/PQODDNQPFD4HIMEMKKKC2HQSFR","bundle":"https://pith.science/pith/PQODDNQPFD4HIMEMKKKC2HQSFR/bundle.json","state":"https://pith.science/pith/PQODDNQPFD4HIMEMKKKC2HQSFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQODDNQPFD4HIMEMKKKC2HQSFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PQODDNQPFD4HIMEMKKKC2HQSFR","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":"ba8fa3963845b5b00d5ec6e2f14018fe0826547a50837c22664b4470beccd203","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-09-29T21:16:36Z","title_canon_sha256":"6592c4225f370035d027b235f8120828179605d651c1ca9f8af21804b034f96e"},"schema_version":"1.0","source":{"id":"1210.0151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0151","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0151v1","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0151","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"PQODDNQPFD4H","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PQODDNQPFD4HIMEM","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PQODDNQP","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:ccead46b7853e058e0a456cda829001b403015e5400e0b2537a1b5242f3206ff","target":"graph","created_at":"2026-05-18T03:44:23Z","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":"Information network analysis has drawn a lot attention in recent years. Among all the aspects of network analysis, similarity measure of nodes has been shown useful in many applications, such as clustering, link prediction and community identification, to name a few. As linkage data in a large network is inherently sparse, it is noted that collecting more data can improve the quality of similarity measure. This gives different parties a motivation to cooperate. In this paper, we address the problem of link-based similarity measure of nodes in an information network distributed over different p","authors_text":"Chih-Hua Tai, Ming-Syan Chen, Philip S. Yu, Yu-Wei Chu","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-09-29T21:16:36Z","title":"Implementation of Privacy-preserving SimRank over Distributed Information Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0151","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:3e9edf34808fe74995d23037a4230b5fb76601ac207740abacb1e85530da0daa","target":"record","created_at":"2026-05-18T03:44:23Z","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":"ba8fa3963845b5b00d5ec6e2f14018fe0826547a50837c22664b4470beccd203","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-09-29T21:16:36Z","title_canon_sha256":"6592c4225f370035d027b235f8120828179605d651c1ca9f8af21804b034f96e"},"schema_version":"1.0","source":{"id":"1210.0151","kind":"arxiv","version":1}},"canonical_sha256":"7c1c31b60f28f874308c52942d1e122c73bf3579f1ac597b86f2db4f27767366","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c1c31b60f28f874308c52942d1e122c73bf3579f1ac597b86f2db4f27767366","first_computed_at":"2026-05-18T03:44:23.175223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:23.175223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uMIX01gjRfLoWuYerxdHXfil3HANIi2z9cl/2ksDLI+gDi97Oo/BMTe8uD1AC1b3kXcCfZU6FQfKe64L33dKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:23.175884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e9edf34808fe74995d23037a4230b5fb76601ac207740abacb1e85530da0daa","sha256:ccead46b7853e058e0a456cda829001b403015e5400e0b2537a1b5242f3206ff"],"state_sha256":"9489e051d0652743eba3ad8806a768b9512c4503c11be1566df77d6067dc28da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RiEcLt2R6vMThKPkimBiVAmpgE1+oZQGzV8m+H+c1MjaZhX9AoY5Jk7TSZmkCwicVj0o89406illREOQorHKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T09:04:59.125391Z","bundle_sha256":"181e9d748609158cd06ad26504383f79df236e388812d4a02c2e96336a42d8d0"}}