{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VTRU6FWCD3ZNH4IVNIYM767S5C","short_pith_number":"pith:VTRU6FWC","canonical_record":{"source":{"id":"1608.05346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-18T17:45:45Z","cross_cats_sorted":[],"title_canon_sha256":"2146612aec5398dd463dc166ef045131e8fadd3f6d2f9884482afaafa2fed6f3","abstract_canon_sha256":"5afef2d8608920ef32d03744e00fa5449cc8737a7586a86aa5b666aac73d728f"},"schema_version":"1.0"},"canonical_sha256":"ace34f16c21ef2d3f1156a30cffbf2e88aacf6b6c83d033d8ee4d012d9bda657","source":{"kind":"arxiv","id":"1608.05346","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05346","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05346v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05346","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"VTRU6FWCD3ZN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VTRU6FWCD3ZNH4IV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VTRU6FWC","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VTRU6FWCD3ZNH4IVNIYM767S5C","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-18T17:45:45Z","cross_cats_sorted":[],"title_canon_sha256":"2146612aec5398dd463dc166ef045131e8fadd3f6d2f9884482afaafa2fed6f3","abstract_canon_sha256":"5afef2d8608920ef32d03744e00fa5449cc8737a7586a86aa5b666aac73d728f"},"schema_version":"1.0"},"canonical_sha256":"ace34f16c21ef2d3f1156a30cffbf2e88aacf6b6c83d033d8ee4d012d9bda657","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:31.336995Z","signature_b64":"kBwBXjmsxi6Esg8LrEbSkz5c0+LlZDoRDfxZ7lnlZcYXg6+jrUjj03JX+0ivZLY2vQFRE/C5fGnDDXo//pv8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ace34f16c21ef2d3f1156a30cffbf2e88aacf6b6c83d033d8ee4d012d9bda657","last_reissued_at":"2026-05-18T01:08:31.336486Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:31.336486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05346","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-18T01:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gTPA2uhy+uBJF7coN20EGmhWzZMR8eQwo7kk0f6wGXYA53zWKAU2AaE6/rtAVFyjYA2nhqiSVASQfGT2+Ha1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:28:10.491761Z"},"content_sha256":"dd42e4401be4bab702a46dec2db7913f3e3116b14e198e6f440b0a73f7af2463","schema_version":"1.0","event_id":"sha256:dd42e4401be4bab702a46dec2db7913f3e3116b14e198e6f440b0a73f7af2463"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VTRU6FWCD3ZNH4IVNIYM767S5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diversified Top-k Similarity Search in Large Attributed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Hong Shen, Zaiqiao Meng","submitted_at":"2016-08-18T17:45:45Z","abstract_excerpt":"Given a large network and a query node, finding its top-k similar nodes is a primitive operation in many graph-based applications. Recently enhancing search results with diversification have received much attention. In this paper, we explore an novel problem of searching for top-k diversified similar nodes in attributed networks, with the motivation that modeling diversification in an attributed network should consider both the emergence of network links and the attribute features of nodes such as user profile information. We formulate this practical problem as two optimization problems: the A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05346","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-18T01:08:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdeaUsRgq2HMgb3YBba8pW4sbQCQ19ls6HXW2RNdCwZacc81bMkDiwGtoITbeQnqt72baE3xr7sQnldum3M9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:28:10.492479Z"},"content_sha256":"faa17b43e47c7f74ca8ea92486be61a3fe3ccce15e11770e9e9a8ce7ff2cdfac","schema_version":"1.0","event_id":"sha256:faa17b43e47c7f74ca8ea92486be61a3fe3ccce15e11770e9e9a8ce7ff2cdfac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTRU6FWCD3ZNH4IVNIYM767S5C/bundle.json","state_url":"https://pith.science/pith/VTRU6FWCD3ZNH4IVNIYM767S5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTRU6FWCD3ZNH4IVNIYM767S5C/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-20T04:28:10Z","links":{"resolver":"https://pith.science/pith/VTRU6FWCD3ZNH4IVNIYM767S5C","bundle":"https://pith.science/pith/VTRU6FWCD3ZNH4IVNIYM767S5C/bundle.json","state":"https://pith.science/pith/VTRU6FWCD3ZNH4IVNIYM767S5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTRU6FWCD3ZNH4IVNIYM767S5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VTRU6FWCD3ZNH4IVNIYM767S5C","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":"5afef2d8608920ef32d03744e00fa5449cc8737a7586a86aa5b666aac73d728f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-18T17:45:45Z","title_canon_sha256":"2146612aec5398dd463dc166ef045131e8fadd3f6d2f9884482afaafa2fed6f3"},"schema_version":"1.0","source":{"id":"1608.05346","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05346","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05346v1","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05346","created_at":"2026-05-18T01:08:31Z"},{"alias_kind":"pith_short_12","alias_value":"VTRU6FWCD3ZN","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VTRU6FWCD3ZNH4IV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VTRU6FWC","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:faa17b43e47c7f74ca8ea92486be61a3fe3ccce15e11770e9e9a8ce7ff2cdfac","target":"graph","created_at":"2026-05-18T01:08:31Z","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":"Given a large network and a query node, finding its top-k similar nodes is a primitive operation in many graph-based applications. Recently enhancing search results with diversification have received much attention. In this paper, we explore an novel problem of searching for top-k diversified similar nodes in attributed networks, with the motivation that modeling diversification in an attributed network should consider both the emergence of network links and the attribute features of nodes such as user profile information. We formulate this practical problem as two optimization problems: the A","authors_text":"Hong Shen, Zaiqiao Meng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-18T17:45:45Z","title":"Diversified Top-k Similarity Search in Large Attributed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05346","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:dd42e4401be4bab702a46dec2db7913f3e3116b14e198e6f440b0a73f7af2463","target":"record","created_at":"2026-05-18T01:08:31Z","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":"5afef2d8608920ef32d03744e00fa5449cc8737a7586a86aa5b666aac73d728f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-08-18T17:45:45Z","title_canon_sha256":"2146612aec5398dd463dc166ef045131e8fadd3f6d2f9884482afaafa2fed6f3"},"schema_version":"1.0","source":{"id":"1608.05346","kind":"arxiv","version":1}},"canonical_sha256":"ace34f16c21ef2d3f1156a30cffbf2e88aacf6b6c83d033d8ee4d012d9bda657","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ace34f16c21ef2d3f1156a30cffbf2e88aacf6b6c83d033d8ee4d012d9bda657","first_computed_at":"2026-05-18T01:08:31.336486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:31.336486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kBwBXjmsxi6Esg8LrEbSkz5c0+LlZDoRDfxZ7lnlZcYXg6+jrUjj03JX+0ivZLY2vQFRE/C5fGnDDXo//pv8CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:31.336995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05346","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd42e4401be4bab702a46dec2db7913f3e3116b14e198e6f440b0a73f7af2463","sha256:faa17b43e47c7f74ca8ea92486be61a3fe3ccce15e11770e9e9a8ce7ff2cdfac"],"state_sha256":"820e5418f20665f42ec4c39ce61615f72c9e79595920de12a33add04775ff38a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfyGkUa9tekdpXuwY2ptfIJHB8QvbXuHv7ZX51ai8ll36OtiX5arbrIrkT1F5T2A2RwSpnHEhPjUl8TJE7yCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T04:28:10.497612Z","bundle_sha256":"357ca38be74eac9c067f20d8da9812256517c9f8483d12d1528caf651d04aac6"}}