{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GRQFZ4C5YTHDMMD2KLXHEWKLPQ","short_pith_number":"pith:GRQFZ4C5","canonical_record":{"source":{"id":"1510.03814","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-13T18:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"d27215562ee392cae8c47c7b62860be93f5bf58c4320d40a2c9a2e0c8d8e7cd9","abstract_canon_sha256":"27de41901782146a00d8c6a72a3146174f144a7ee8ce1eeba74b6f6582467c11"},"schema_version":"1.0"},"canonical_sha256":"34605cf05dc4ce36307a52ee72594b7c2ca92087731b9d21b9e2a21199715a8c","source":{"kind":"arxiv","id":"1510.03814","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03814","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03814v2","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03814","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"GRQFZ4C5YTHD","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRQFZ4C5YTHDMMD2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRQFZ4C5","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GRQFZ4C5YTHDMMD2KLXHEWKLPQ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.03814","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-13T18:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"d27215562ee392cae8c47c7b62860be93f5bf58c4320d40a2c9a2e0c8d8e7cd9","abstract_canon_sha256":"27de41901782146a00d8c6a72a3146174f144a7ee8ce1eeba74b6f6582467c11"},"schema_version":"1.0"},"canonical_sha256":"34605cf05dc4ce36307a52ee72594b7c2ca92087731b9d21b9e2a21199715a8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:22.763303Z","signature_b64":"2QVjfOH1BrC0/L17711ud/rRF5zaFYzuaDqC+15csrp5lG9BTMbgvczL6sckzowWocQN7MANYBZVp2hrXp+WBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34605cf05dc4ce36307a52ee72594b7c2ca92087731b9d21b9e2a21199715a8c","last_reissued_at":"2026-05-18T00:31:22.762840Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:22.762840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.03814","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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RSU0XiLD1DWjcUYqrr9b5gilscZzkNXDqxoT7rxkoQuBy0b+Gx9BaedyY/DVlf+JNuvzuS0pvpYpjGZKwE+yAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T09:57:26.538481Z"},"content_sha256":"869a3cb26e64b07cb2dd32b28d4b29700f772f97850deaa965512f88a2f8077c","schema_version":"1.0","event_id":"sha256:869a3cb26e64b07cb2dd32b28d4b29700f772f97850deaa965512f88a2f8077c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GRQFZ4C5YTHDMMD2KLXHEWKLPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"In-Network Neighborhood-Based Node Similarity Measure: A Unified Parametric Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Jian Pei, Yu Yang","submitted_at":"2015-10-13T18:50:32Z","abstract_excerpt":"In many applications, we need to measure similarity between nodes in a large network based on features of their neighborhoods. Although in-network node similarity based on proximity has been well investigated, surprisingly, measuring in-network node similarity based on neighborhoods remains a largely untouched problem in literature. One grand challenge is that in different applications we may need different measurements that manifest different meanings of similarity. In this paper, we investigate the problem in a principled and systematic manner. We develop a unified parametric model and a ser"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03814","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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpX/IvQTqzf3AsK0GK7Vm5YlLsldR79w6S81hxd7VTflnqjd/S5DBsK9UJ83cg4e046agFic0U61XAP5qZAJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T09:57:26.538831Z"},"content_sha256":"6f30f3a9a7f0252b370ba7e298054436ea4849163343e32eca55686bc55e2043","schema_version":"1.0","event_id":"sha256:6f30f3a9a7f0252b370ba7e298054436ea4849163343e32eca55686bc55e2043"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GRQFZ4C5YTHDMMD2KLXHEWKLPQ/bundle.json","state_url":"https://pith.science/pith/GRQFZ4C5YTHDMMD2KLXHEWKLPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GRQFZ4C5YTHDMMD2KLXHEWKLPQ/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-19T09:57:26Z","links":{"resolver":"https://pith.science/pith/GRQFZ4C5YTHDMMD2KLXHEWKLPQ","bundle":"https://pith.science/pith/GRQFZ4C5YTHDMMD2KLXHEWKLPQ/bundle.json","state":"https://pith.science/pith/GRQFZ4C5YTHDMMD2KLXHEWKLPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GRQFZ4C5YTHDMMD2KLXHEWKLPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GRQFZ4C5YTHDMMD2KLXHEWKLPQ","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":"27de41901782146a00d8c6a72a3146174f144a7ee8ce1eeba74b6f6582467c11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-13T18:50:32Z","title_canon_sha256":"d27215562ee392cae8c47c7b62860be93f5bf58c4320d40a2c9a2e0c8d8e7cd9"},"schema_version":"1.0","source":{"id":"1510.03814","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03814","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03814v2","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03814","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"GRQFZ4C5YTHD","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GRQFZ4C5YTHDMMD2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GRQFZ4C5","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:6f30f3a9a7f0252b370ba7e298054436ea4849163343e32eca55686bc55e2043","target":"graph","created_at":"2026-05-18T00:31:22Z","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":"In many applications, we need to measure similarity between nodes in a large network based on features of their neighborhoods. Although in-network node similarity based on proximity has been well investigated, surprisingly, measuring in-network node similarity based on neighborhoods remains a largely untouched problem in literature. One grand challenge is that in different applications we may need different measurements that manifest different meanings of similarity. In this paper, we investigate the problem in a principled and systematic manner. We develop a unified parametric model and a ser","authors_text":"Jian Pei, Yu Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-13T18:50:32Z","title":"In-Network Neighborhood-Based Node Similarity Measure: A Unified Parametric Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03814","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:869a3cb26e64b07cb2dd32b28d4b29700f772f97850deaa965512f88a2f8077c","target":"record","created_at":"2026-05-18T00:31:22Z","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":"27de41901782146a00d8c6a72a3146174f144a7ee8ce1eeba74b6f6582467c11","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-13T18:50:32Z","title_canon_sha256":"d27215562ee392cae8c47c7b62860be93f5bf58c4320d40a2c9a2e0c8d8e7cd9"},"schema_version":"1.0","source":{"id":"1510.03814","kind":"arxiv","version":2}},"canonical_sha256":"34605cf05dc4ce36307a52ee72594b7c2ca92087731b9d21b9e2a21199715a8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34605cf05dc4ce36307a52ee72594b7c2ca92087731b9d21b9e2a21199715a8c","first_computed_at":"2026-05-18T00:31:22.762840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:22.762840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2QVjfOH1BrC0/L17711ud/rRF5zaFYzuaDqC+15csrp5lG9BTMbgvczL6sckzowWocQN7MANYBZVp2hrXp+WBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:22.763303Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03814","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:869a3cb26e64b07cb2dd32b28d4b29700f772f97850deaa965512f88a2f8077c","sha256:6f30f3a9a7f0252b370ba7e298054436ea4849163343e32eca55686bc55e2043"],"state_sha256":"779fa5212e8e1522f7d8ec5815d0284a8e2cb9e4588f272356b2ed095df638c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9130SSS8lBguPN1lWMsrnhjmwxUoMye09o5FcHPGkU3OQrCi84z+CHCjvP/U6hUFgpzpH7L70sLGHvQjwsZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T09:57:26.540691Z","bundle_sha256":"609281f172a89b006ae7c319b96bf684fa7f3f1631c703ec9443f5823332c390"}}