{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LJ2AYJEFW2HOKVQBKXHCEH77X7","short_pith_number":"pith:LJ2AYJEF","schema_version":"1.0","canonical_sha256":"5a740c2485b68ee5560155ce221fffbfc7febe770340582f98f7df79a4b8896a","source":{"kind":"arxiv","id":"2312.07706","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Differentially Private k-Core Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.SI"],"primary_cat":"cs.DS","authors_text":"George Z. Li, Laxman Dhulipala, Quanquan C. Liu","submitted_at":"2023-12-12T20:09:07Z","abstract_excerpt":"Recent work by Dhulipala et al. \\cite{DLRSSY22} initiated the study of the $k$-core decomposition problem under differential privacy via a connection between low round/depth distributed/parallel graph algorithms and private algorithms with small error bounds. They showed that one can output differentially private approximate $k$-core numbers, while only incurring a multiplicative error of $(2 +\\eta)$ (for any constant $\\eta >0$) and additive error of $\\poly(\\log(n))/\\eps$. In this paper, we revisit this problem. Our main result is an $\\eps$-edge differentially private algorithm for $k$-core de"},"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":"2312.07706","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-12-12T20:09:07Z","cross_cats_sorted":["cs.CR","cs.SI"],"title_canon_sha256":"867fdaa305df2e345fc2e284f27f3244bdfc1eb9c8d991e2067842af10561a53","abstract_canon_sha256":"24cca25eae87cc2814d235878f6fc3b7e216de1644c4cb777c0020c7b8cb9c2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:22.492595Z","signature_b64":"4vnemQ1TVGIokZG6TyHAQkAZ2+Xe/EWgGNQAWfPsSLtnlDf3WA3+Jf6oA/z763sRLf3Bu2gBKJaGVV7X77fFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a740c2485b68ee5560155ce221fffbfc7febe770340582f98f7df79a4b8896a","last_reissued_at":"2026-07-05T07:50:22.492066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:22.492066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Differentially Private k-Core Decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.SI"],"primary_cat":"cs.DS","authors_text":"George Z. Li, Laxman Dhulipala, Quanquan C. Liu","submitted_at":"2023-12-12T20:09:07Z","abstract_excerpt":"Recent work by Dhulipala et al. \\cite{DLRSSY22} initiated the study of the $k$-core decomposition problem under differential privacy via a connection between low round/depth distributed/parallel graph algorithms and private algorithms with small error bounds. They showed that one can output differentially private approximate $k$-core numbers, while only incurring a multiplicative error of $(2 +\\eta)$ (for any constant $\\eta >0$) and additive error of $\\poly(\\log(n))/\\eps$. In this paper, we revisit this problem. Our main result is an $\\eps$-edge differentially private algorithm for $k$-core de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07706","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.07706/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":"2312.07706","created_at":"2026-07-05T07:50:22.492125+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.07706v2","created_at":"2026-07-05T07:50:22.492125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07706","created_at":"2026-07-05T07:50:22.492125+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ2AYJEFW2HO","created_at":"2026-07-05T07:50:22.492125+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ2AYJEFW2HOKVQB","created_at":"2026-07-05T07:50:22.492125+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ2AYJEF","created_at":"2026-07-05T07:50:22.492125+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20828","citing_title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJ2AYJEFW2HOKVQBKXHCEH77X7","json":"https://pith.science/pith/LJ2AYJEFW2HOKVQBKXHCEH77X7.json","graph_json":"https://pith.science/api/pith-number/LJ2AYJEFW2HOKVQBKXHCEH77X7/graph.json","events_json":"https://pith.science/api/pith-number/LJ2AYJEFW2HOKVQBKXHCEH77X7/events.json","paper":"https://pith.science/paper/LJ2AYJEF"},"agent_actions":{"view_html":"https://pith.science/pith/LJ2AYJEFW2HOKVQBKXHCEH77X7","download_json":"https://pith.science/pith/LJ2AYJEFW2HOKVQBKXHCEH77X7.json","view_paper":"https://pith.science/paper/LJ2AYJEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.07706&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ2AYJEFW2HOKVQBKXHCEH77X7/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ2AYJEFW2HOKVQBKXHCEH77X7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ2AYJEFW2HOKVQBKXHCEH77X7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ2AYJEFW2HOKVQBKXHCEH77X7/action/storage_attestation","attest_author":"https://pith.science/pith/LJ2AYJEFW2HOKVQBKXHCEH77X7/action/author_attestation","sign_citation":"https://pith.science/pith/LJ2AYJEFW2HOKVQBKXHCEH77X7/action/citation_signature","submit_replication":"https://pith.science/pith/LJ2AYJEFW2HOKVQBKXHCEH77X7/action/replication_record"}},"created_at":"2026-07-05T07:50:22.492125+00:00","updated_at":"2026-07-05T07:50:22.492125+00:00"}