{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5E7YAJULNDKQ42FPGPTM2PICL3","short_pith_number":"pith:5E7YAJUL","schema_version":"1.0","canonical_sha256":"e93f80268b68d50e68af33e6cd3d025ec28c7d4bde92264dbd2eeb3ae24ab3fb","source":{"kind":"arxiv","id":"2305.02263","version":3},"attestation_state":"computed","paper":{"title":"Triangle Counting with Local Edge Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Adam Smith, Quanquan C. Liu, Sofya Raskhodnikova, Talya Eden","submitted_at":"2023-05-03T16:50:29Z","abstract_excerpt":"Many deployments of differential privacy in industry are in the local model, where each party releases its private information via a differentially private randomizer. We study triangle counting in the local model with edge differential privacy (that, intuitively, requires that the outputs of the algorithm on graphs that differ in one edge be indistinguishable). In this model, each party's local view consists of the adjacency list of one vertex. We investigate both noninteractive and interactive variants of the model.\n  In the noninteractive model, we prove that additive $\\Omega(n^2)$ error is"},"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":"2305.02263","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-05-03T16:50:29Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"00626e8242850886c0feb35fb679faad300c9d090817c8d689b6cecd3e731550","abstract_canon_sha256":"f1a17ba43ab8db8adeef753d4564ba52b68c635ae83df1638d4e59e7fed27449"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:07.299124Z","signature_b64":"n5J6slCuOeFLIPxdwKD+IPXrmtvK50JEpFKAw/cjfairf9Tk6x1yzifR2dRhYoY9zmqsU9OegSwzCjh78maXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e93f80268b68d50e68af33e6cd3d025ec28c7d4bde92264dbd2eeb3ae24ab3fb","last_reissued_at":"2026-07-05T11:54:07.298620Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:07.298620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle Counting with Local Edge Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Adam Smith, Quanquan C. Liu, Sofya Raskhodnikova, Talya Eden","submitted_at":"2023-05-03T16:50:29Z","abstract_excerpt":"Many deployments of differential privacy in industry are in the local model, where each party releases its private information via a differentially private randomizer. We study triangle counting in the local model with edge differential privacy (that, intuitively, requires that the outputs of the algorithm on graphs that differ in one edge be indistinguishable). In this model, each party's local view consists of the adjacency list of one vertex. We investigate both noninteractive and interactive variants of the model.\n  In the noninteractive model, we prove that additive $\\Omega(n^2)$ error is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02263","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/2305.02263/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":"2305.02263","created_at":"2026-07-05T11:54:07.298688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.02263v3","created_at":"2026-07-05T11:54:07.298688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02263","created_at":"2026-07-05T11:54:07.298688+00:00"},{"alias_kind":"pith_short_12","alias_value":"5E7YAJULNDKQ","created_at":"2026-07-05T11:54:07.298688+00:00"},{"alias_kind":"pith_short_16","alias_value":"5E7YAJULNDKQ42FP","created_at":"2026-07-05T11:54:07.298688+00:00"},{"alias_kind":"pith_short_8","alias_value":"5E7YAJUL","created_at":"2026-07-05T11:54:07.298688+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.06508","citing_title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5E7YAJULNDKQ42FPGPTM2PICL3","json":"https://pith.science/pith/5E7YAJULNDKQ42FPGPTM2PICL3.json","graph_json":"https://pith.science/api/pith-number/5E7YAJULNDKQ42FPGPTM2PICL3/graph.json","events_json":"https://pith.science/api/pith-number/5E7YAJULNDKQ42FPGPTM2PICL3/events.json","paper":"https://pith.science/paper/5E7YAJUL"},"agent_actions":{"view_html":"https://pith.science/pith/5E7YAJULNDKQ42FPGPTM2PICL3","download_json":"https://pith.science/pith/5E7YAJULNDKQ42FPGPTM2PICL3.json","view_paper":"https://pith.science/paper/5E7YAJUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.02263&json=true","fetch_graph":"https://pith.science/api/pith-number/5E7YAJULNDKQ42FPGPTM2PICL3/graph.json","fetch_events":"https://pith.science/api/pith-number/5E7YAJULNDKQ42FPGPTM2PICL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5E7YAJULNDKQ42FPGPTM2PICL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5E7YAJULNDKQ42FPGPTM2PICL3/action/storage_attestation","attest_author":"https://pith.science/pith/5E7YAJULNDKQ42FPGPTM2PICL3/action/author_attestation","sign_citation":"https://pith.science/pith/5E7YAJULNDKQ42FPGPTM2PICL3/action/citation_signature","submit_replication":"https://pith.science/pith/5E7YAJULNDKQ42FPGPTM2PICL3/action/replication_record"}},"created_at":"2026-07-05T11:54:07.298688+00:00","updated_at":"2026-07-05T11:54:07.298688+00:00"}