{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:N3XUFSRMFXGNDSKWGHSOMYSQMS","short_pith_number":"pith:N3XUFSRM","schema_version":"1.0","canonical_sha256":"6eef42ca2c2dccd1c95631e4e6625064b1cf1d18b511ef527fb156abe064f700","source":{"kind":"arxiv","id":"2506.20828","version":3},"attestation_state":"computed","paper":{"title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DB"],"primary_cat":"cs.DS","authors_text":"Charalampos Papamanthou, Julian Shun, Pranay Mundra, Quanquan C. Liu","submitted_at":"2025-06-25T20:54:07Z","abstract_excerpt":"The rise of massive networks across diverse domains necessitates sophisticated graph analytics, often involving sensitive data and raising privacy concerns. This paper addresses these challenges using local differential privacy (LDP), which enforces privacy at the individual level, where no third-party entity is trusted, unlike centralized models that assume a trusted curator. We introduce novel LDP algorithms for two fundamental graph statistics: k-core decomposition and triangle counting. Our approach leverages input-dependent private graph properties, specifically the degeneracy and maximum"},"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":"2506.20828","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-25T20:54:07Z","cross_cats_sorted":["cs.CR","cs.DB"],"title_canon_sha256":"7120c573e0f7c60398cdfdf43db3cb05b7e7742e7af919c33ead8db97e6da7ae","abstract_canon_sha256":"c66ba1e0e8edcdfdade6dd78f2d97ac57c5c50fc7b0b6c6296f7cd791093f7cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:03.227806Z","signature_b64":"KCB+hkNGBZP4PVf5URH949EqJupMfxkhL3c1jhtLE2eQy5eZc/zhQp6KVxNmvP2YnTDmeUWuUfiiV3r635cACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eef42ca2c2dccd1c95631e4e6625064b1cf1d18b511ef527fb156abe064f700","last_reissued_at":"2026-07-05T12:00:03.227338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:03.227338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Practical and Accurate Local Edge Differentially Private Graph Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR","cs.DB"],"primary_cat":"cs.DS","authors_text":"Charalampos Papamanthou, Julian Shun, Pranay Mundra, Quanquan C. Liu","submitted_at":"2025-06-25T20:54:07Z","abstract_excerpt":"The rise of massive networks across diverse domains necessitates sophisticated graph analytics, often involving sensitive data and raising privacy concerns. This paper addresses these challenges using local differential privacy (LDP), which enforces privacy at the individual level, where no third-party entity is trusted, unlike centralized models that assume a trusted curator. We introduce novel LDP algorithms for two fundamental graph statistics: k-core decomposition and triangle counting. Our approach leverages input-dependent private graph properties, specifically the degeneracy and maximum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20828","kind":"arxiv","version":3},"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/2506.20828/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":"2506.20828","created_at":"2026-07-05T12:00:03.227401+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20828v3","created_at":"2026-07-05T12:00:03.227401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20828","created_at":"2026-07-05T12:00:03.227401+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3XUFSRMFXGN","created_at":"2026-07-05T12:00:03.227401+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3XUFSRMFXGNDSKW","created_at":"2026-07-05T12:00:03.227401+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3XUFSRM","created_at":"2026-07-05T12:00:03.227401+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23887","citing_title":"CHRONOS: Temporally-Aware Multi-Agent Coordination for Evolving Data Marketplaces","ref_index":56,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N3XUFSRMFXGNDSKWGHSOMYSQMS","json":"https://pith.science/pith/N3XUFSRMFXGNDSKWGHSOMYSQMS.json","graph_json":"https://pith.science/api/pith-number/N3XUFSRMFXGNDSKWGHSOMYSQMS/graph.json","events_json":"https://pith.science/api/pith-number/N3XUFSRMFXGNDSKWGHSOMYSQMS/events.json","paper":"https://pith.science/paper/N3XUFSRM"},"agent_actions":{"view_html":"https://pith.science/pith/N3XUFSRMFXGNDSKWGHSOMYSQMS","download_json":"https://pith.science/pith/N3XUFSRMFXGNDSKWGHSOMYSQMS.json","view_paper":"https://pith.science/paper/N3XUFSRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20828&json=true","fetch_graph":"https://pith.science/api/pith-number/N3XUFSRMFXGNDSKWGHSOMYSQMS/graph.json","fetch_events":"https://pith.science/api/pith-number/N3XUFSRMFXGNDSKWGHSOMYSQMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3XUFSRMFXGNDSKWGHSOMYSQMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3XUFSRMFXGNDSKWGHSOMYSQMS/action/storage_attestation","attest_author":"https://pith.science/pith/N3XUFSRMFXGNDSKWGHSOMYSQMS/action/author_attestation","sign_citation":"https://pith.science/pith/N3XUFSRMFXGNDSKWGHSOMYSQMS/action/citation_signature","submit_replication":"https://pith.science/pith/N3XUFSRMFXGNDSKWGHSOMYSQMS/action/replication_record"}},"created_at":"2026-07-05T12:00:03.227401+00:00","updated_at":"2026-07-05T12:00:03.227401+00:00"}