{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LSNESN4JMVI6T7KV4Z54OQY7WR","short_pith_number":"pith:LSNESN4J","schema_version":"1.0","canonical_sha256":"5c9a4937896551e9fd55e67bc7431fb47a59172391549e5923608ded986f15cc","source":{"kind":"arxiv","id":"2502.01904","version":1},"attestation_state":"computed","paper":{"title":"Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Yizhang He","submitted_at":"2025-02-04T00:33:18Z","abstract_excerpt":"Bipartite graphs, formed by two vertex layers, arise as a natural fit for modeling the relationships between two groups of entities. In bipartite graphs, common neighborhood computation between two vertices on the same vertex layer is a basic operator, which is easily solvable in general settings. However, it inevitably involves releasing the neighborhood information of vertices, posing a significant privacy risk for users in real-world applications. To protect edge privacy in bipartite graphs, in this paper, we study the problem of estimating the number of common neighbors of two vertices on "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.01904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-02-04T00:33:18Z","cross_cats_sorted":[],"title_canon_sha256":"099e076fed01dfb94a44a208e2d4b0cd66c7aab98901066f5d4fabedbb11f084","abstract_canon_sha256":"867d3419639e137bab6f10a70f344566d4d4c5cc06b1fe41d31f6e54910f1f6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:09:20.985232Z","signature_b64":"s4UsYxdQDx1Bb4Bg4FHBNpluDQ6jSli99IyvQv8aRK2RRmgSpEciC+jpgTgfuRGD4XDcrHczEcsUq5OEKMnJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c9a4937896551e9fd55e67bc7431fb47a59172391549e5923608ded986f15cc","last_reissued_at":"2026-07-05T10:09:20.984768Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:09:20.984768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Yizhang He","submitted_at":"2025-02-04T00:33:18Z","abstract_excerpt":"Bipartite graphs, formed by two vertex layers, arise as a natural fit for modeling the relationships between two groups of entities. In bipartite graphs, common neighborhood computation between two vertices on the same vertex layer is a basic operator, which is easily solvable in general settings. However, it inevitably involves releasing the neighborhood information of vertices, posing a significant privacy risk for users in real-world applications. To protect edge privacy in bipartite graphs, in this paper, we study the problem of estimating the number of common neighbors of two vertices on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01904","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.01904/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.01904","created_at":"2026-07-05T10:09:20.984827+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01904v1","created_at":"2026-07-05T10:09:20.984827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01904","created_at":"2026-07-05T10:09:20.984827+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSNESN4JMVI6","created_at":"2026-07-05T10:09:20.984827+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSNESN4JMVI6T7KV","created_at":"2026-07-05T10:09:20.984827+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSNESN4J","created_at":"2026-07-05T10:09:20.984827+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSNESN4JMVI6T7KV4Z54OQY7WR","json":"https://pith.science/pith/LSNESN4JMVI6T7KV4Z54OQY7WR.json","graph_json":"https://pith.science/api/pith-number/LSNESN4JMVI6T7KV4Z54OQY7WR/graph.json","events_json":"https://pith.science/api/pith-number/LSNESN4JMVI6T7KV4Z54OQY7WR/events.json","paper":"https://pith.science/paper/LSNESN4J"},"agent_actions":{"view_html":"https://pith.science/pith/LSNESN4JMVI6T7KV4Z54OQY7WR","download_json":"https://pith.science/pith/LSNESN4JMVI6T7KV4Z54OQY7WR.json","view_paper":"https://pith.science/paper/LSNESN4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01904&json=true","fetch_graph":"https://pith.science/api/pith-number/LSNESN4JMVI6T7KV4Z54OQY7WR/graph.json","fetch_events":"https://pith.science/api/pith-number/LSNESN4JMVI6T7KV4Z54OQY7WR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSNESN4JMVI6T7KV4Z54OQY7WR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSNESN4JMVI6T7KV4Z54OQY7WR/action/storage_attestation","attest_author":"https://pith.science/pith/LSNESN4JMVI6T7KV4Z54OQY7WR/action/author_attestation","sign_citation":"https://pith.science/pith/LSNESN4JMVI6T7KV4Z54OQY7WR/action/citation_signature","submit_replication":"https://pith.science/pith/LSNESN4JMVI6T7KV4Z54OQY7WR/action/replication_record"}},"created_at":"2026-07-05T10:09:20.984827+00:00","updated_at":"2026-07-05T10:09:20.984827+00:00"}