{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Z3JIFHVH4JC5MJIHGUN2ZXIHZL","short_pith_number":"pith:Z3JIFHVH","schema_version":"1.0","canonical_sha256":"ced2829ea7e245d62507351bacdd07cae85de645d7cb0dda6c33d2c965b7cbe2","source":{"kind":"arxiv","id":"2403.01788","version":1},"attestation_state":"computed","paper":{"title":"K-stars LDP: A Novel Framework for (p, q)-clique Enumeration under Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.DS"],"primary_cat":"cs.CR","authors_text":"Guoren Wang, Henan Sun, Rong-Hua Li, Zening Li, Zhengyu Wu","submitted_at":"2024-03-04T07:30:10Z","abstract_excerpt":"(p,q)-clique enumeration on a bipartite graph is critical for calculating clustering coefficient and detecting densest subgraph. It is necessary to carry out subgraph enumeration while protecting users' privacy from any potential attacker as the count of subgraph may contain sensitive information. Most recent studies focus on the privacy protection algorithms based on edge LDP (Local Differential Privacy). However, these algorithms suffer a large estimation error due to the great amount of required noise. In this paper, we propose a novel idea of k-stars LDP and a novel k-stars LDP algorithm f"},"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":"2403.01788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-03-04T07:30:10Z","cross_cats_sorted":["cs.CY","cs.DS"],"title_canon_sha256":"8e3760d2680d96c1748794a255ad460b8a249c76811d24b419683f28408845e4","abstract_canon_sha256":"b1ccb84f2dd6ebffc3d4c1b55e8482e7b6253b903dc59b7603f1c6d35f0e0c37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:51:51.714598Z","signature_b64":"dflyc69MnoxehphSddzx21BcLX6rWsW0kYGWa+HvQiwfGqhy+3wzogW9aRQpbt2ibbNsReXwl1oJ2drPWaepAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ced2829ea7e245d62507351bacdd07cae85de645d7cb0dda6c33d2c965b7cbe2","last_reissued_at":"2026-07-05T07:51:51.714123Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:51:51.714123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"K-stars LDP: A Novel Framework for (p, q)-clique Enumeration under Local Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.DS"],"primary_cat":"cs.CR","authors_text":"Guoren Wang, Henan Sun, Rong-Hua Li, Zening Li, Zhengyu Wu","submitted_at":"2024-03-04T07:30:10Z","abstract_excerpt":"(p,q)-clique enumeration on a bipartite graph is critical for calculating clustering coefficient and detecting densest subgraph. It is necessary to carry out subgraph enumeration while protecting users' privacy from any potential attacker as the count of subgraph may contain sensitive information. Most recent studies focus on the privacy protection algorithms based on edge LDP (Local Differential Privacy). However, these algorithms suffer a large estimation error due to the great amount of required noise. In this paper, we propose a novel idea of k-stars LDP and a novel k-stars LDP algorithm f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.01788","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/2403.01788/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":"2403.01788","created_at":"2026-07-05T07:51:51.714188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.01788v1","created_at":"2026-07-05T07:51:51.714188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.01788","created_at":"2026-07-05T07:51:51.714188+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3JIFHVH4JC5","created_at":"2026-07-05T07:51:51.714188+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3JIFHVH4JC5MJIH","created_at":"2026-07-05T07:51:51.714188+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3JIFHVH","created_at":"2026-07-05T07:51:51.714188+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.01904","citing_title":"Common Neighborhood Estimation over Bipartite Graphs under Local Differential Privacy","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z3JIFHVH4JC5MJIHGUN2ZXIHZL","json":"https://pith.science/pith/Z3JIFHVH4JC5MJIHGUN2ZXIHZL.json","graph_json":"https://pith.science/api/pith-number/Z3JIFHVH4JC5MJIHGUN2ZXIHZL/graph.json","events_json":"https://pith.science/api/pith-number/Z3JIFHVH4JC5MJIHGUN2ZXIHZL/events.json","paper":"https://pith.science/paper/Z3JIFHVH"},"agent_actions":{"view_html":"https://pith.science/pith/Z3JIFHVH4JC5MJIHGUN2ZXIHZL","download_json":"https://pith.science/pith/Z3JIFHVH4JC5MJIHGUN2ZXIHZL.json","view_paper":"https://pith.science/paper/Z3JIFHVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.01788&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3JIFHVH4JC5MJIHGUN2ZXIHZL/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3JIFHVH4JC5MJIHGUN2ZXIHZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3JIFHVH4JC5MJIHGUN2ZXIHZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3JIFHVH4JC5MJIHGUN2ZXIHZL/action/storage_attestation","attest_author":"https://pith.science/pith/Z3JIFHVH4JC5MJIHGUN2ZXIHZL/action/author_attestation","sign_citation":"https://pith.science/pith/Z3JIFHVH4JC5MJIHGUN2ZXIHZL/action/citation_signature","submit_replication":"https://pith.science/pith/Z3JIFHVH4JC5MJIHGUN2ZXIHZL/action/replication_record"}},"created_at":"2026-07-05T07:51:51.714188+00:00","updated_at":"2026-07-05T07:51:51.714188+00:00"}