{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:E72A34PUE7RQ2YWDJDHJ4WIEFW","short_pith_number":"pith:E72A34PU","schema_version":"1.0","canonical_sha256":"27f40df1f427e30d62c348ce9e59042db0cc470ebdc215a5944a37eef7f56b80","source":{"kind":"arxiv","id":"2312.12938","version":1},"attestation_state":"computed","paper":{"title":"CARGO: Crypto-Assisted Differentially Private Triangle Counting without Trusted Servers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CR","authors_text":"Jinfei Liu, Masatoshi Yoshikawa, Shang Liu, Takao Murakami, Yang Cao","submitted_at":"2023-12-20T11:28:20Z","abstract_excerpt":"Differentially private triangle counting in graphs is essential for analyzing connection patterns and calculating clustering coefficients while protecting sensitive individual information. Previous works have relied on either central or local models to enforce differential privacy. However, a significant utility gap exists between the central and local models of differentially private triangle counting, depending on whether or not a trusted server is needed. In particular, the central model provides a high accuracy but necessitates a trusted server. The local model does not require a trusted s"},"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.12938","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-12-20T11:28:20Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"b22490783b76b559f6ad1333f34fd32a449c484b6151e28a611affe67b9a2d8a","abstract_canon_sha256":"938f34bdd66edb452d2cac0a27621bfdd40b455b9c84273a7d73d3eeedc1e0e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:28.528457Z","signature_b64":"SopRQBYrknz+4aW+eJWw+zIQam8mkdaYrQ0vFNAt1E2yJXpTYzoMYDR+rhX8AL6ATf/4rz0bPiMPHpTsSW+XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27f40df1f427e30d62c348ce9e59042db0cc470ebdc215a5944a37eef7f56b80","last_reissued_at":"2026-07-05T07:26:28.528005Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:28.528005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CARGO: Crypto-Assisted Differentially Private Triangle Counting without Trusted Servers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CR","authors_text":"Jinfei Liu, Masatoshi Yoshikawa, Shang Liu, Takao Murakami, Yang Cao","submitted_at":"2023-12-20T11:28:20Z","abstract_excerpt":"Differentially private triangle counting in graphs is essential for analyzing connection patterns and calculating clustering coefficients while protecting sensitive individual information. Previous works have relied on either central or local models to enforce differential privacy. However, a significant utility gap exists between the central and local models of differentially private triangle counting, depending on whether or not a trusted server is needed. In particular, the central model provides a high accuracy but necessitates a trusted server. The local model does not require a trusted s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.12938","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/2312.12938/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.12938","created_at":"2026-07-05T07:26:28.528063+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.12938v1","created_at":"2026-07-05T07:26:28.528063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.12938","created_at":"2026-07-05T07:26:28.528063+00:00"},{"alias_kind":"pith_short_12","alias_value":"E72A34PUE7RQ","created_at":"2026-07-05T07:26:28.528063+00:00"},{"alias_kind":"pith_short_16","alias_value":"E72A34PUE7RQ2YWD","created_at":"2026-07-05T07:26:28.528063+00:00"},{"alias_kind":"pith_short_8","alias_value":"E72A34PU","created_at":"2026-07-05T07:26:28.528063+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":61,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E72A34PUE7RQ2YWDJDHJ4WIEFW","json":"https://pith.science/pith/E72A34PUE7RQ2YWDJDHJ4WIEFW.json","graph_json":"https://pith.science/api/pith-number/E72A34PUE7RQ2YWDJDHJ4WIEFW/graph.json","events_json":"https://pith.science/api/pith-number/E72A34PUE7RQ2YWDJDHJ4WIEFW/events.json","paper":"https://pith.science/paper/E72A34PU"},"agent_actions":{"view_html":"https://pith.science/pith/E72A34PUE7RQ2YWDJDHJ4WIEFW","download_json":"https://pith.science/pith/E72A34PUE7RQ2YWDJDHJ4WIEFW.json","view_paper":"https://pith.science/paper/E72A34PU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.12938&json=true","fetch_graph":"https://pith.science/api/pith-number/E72A34PUE7RQ2YWDJDHJ4WIEFW/graph.json","fetch_events":"https://pith.science/api/pith-number/E72A34PUE7RQ2YWDJDHJ4WIEFW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E72A34PUE7RQ2YWDJDHJ4WIEFW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E72A34PUE7RQ2YWDJDHJ4WIEFW/action/storage_attestation","attest_author":"https://pith.science/pith/E72A34PUE7RQ2YWDJDHJ4WIEFW/action/author_attestation","sign_citation":"https://pith.science/pith/E72A34PUE7RQ2YWDJDHJ4WIEFW/action/citation_signature","submit_replication":"https://pith.science/pith/E72A34PUE7RQ2YWDJDHJ4WIEFW/action/replication_record"}},"created_at":"2026-07-05T07:26:28.528063+00:00","updated_at":"2026-07-05T07:26:28.528063+00:00"}