{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YL5A3VFOHXYMOBTB7OC5MFB7WP","short_pith_number":"pith:YL5A3VFO","schema_version":"1.0","canonical_sha256":"c2fa0dd4ae3df0c70661fb85d6143fb3e682d362fad7a9c84b8b8fb7ab6c15e9","source":{"kind":"arxiv","id":"2507.06508","version":1},"attestation_state":"computed","paper":{"title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Chao Li, Guixun Luo, Jintao Guo, Ying Zhou","submitted_at":"2025-07-09T03:13:15Z","abstract_excerpt":"When analyzing connection patterns within graphs, subgraph counting serves as an effective and fundamental approach. Edge-local differential privacy (edge-LDP) and shuffle model have been employed to achieve subgraph counting under a privacy-preserving situation. Existing algorithms are plagued by high time complexity, excessive download costs, low accuracy, or dependence on trusted third parties. To address the aforementioned challenges, we propose the Noisy Adjacency Matrix (NAM), which combines differential privacy with the adjacency matrix of the graph. NAM offers strong versatility and sc"},"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":"2507.06508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2025-07-09T03:13:15Z","cross_cats_sorted":[],"title_canon_sha256":"ed31d5a4ec93db6dcc2ff7c6a34bbf8e9fce65127c26f5d5d470dfa300761a62","abstract_canon_sha256":"edf35075b515e09277318816b075aa2b52155ab6e2945d32acd21e28bec61e43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:17.417073Z","signature_b64":"FsonXF3KGd3dSpRBxHRWcLpfnxOgrtgNGw4a1bErjoVfCm9+KyS/LtGbsANBcCKneAn1kRddKYjzYNqpiyDqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2fa0dd4ae3df0c70661fb85d6143fb3e682d362fad7a9c84b8b8fb7ab6c15e9","last_reissued_at":"2026-07-05T11:34:17.416684Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:17.416684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subgraph Counting under Edge Local Differential Privacy Based on Noisy Adjacency Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Chao Li, Guixun Luo, Jintao Guo, Ying Zhou","submitted_at":"2025-07-09T03:13:15Z","abstract_excerpt":"When analyzing connection patterns within graphs, subgraph counting serves as an effective and fundamental approach. Edge-local differential privacy (edge-LDP) and shuffle model have been employed to achieve subgraph counting under a privacy-preserving situation. Existing algorithms are plagued by high time complexity, excessive download costs, low accuracy, or dependence on trusted third parties. To address the aforementioned challenges, we propose the Noisy Adjacency Matrix (NAM), which combines differential privacy with the adjacency matrix of the graph. NAM offers strong versatility and sc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.06508","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/2507.06508/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":"2507.06508","created_at":"2026-07-05T11:34:17.416740+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.06508v1","created_at":"2026-07-05T11:34:17.416740+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.06508","created_at":"2026-07-05T11:34:17.416740+00:00"},{"alias_kind":"pith_short_12","alias_value":"YL5A3VFOHXYM","created_at":"2026-07-05T11:34:17.416740+00:00"},{"alias_kind":"pith_short_16","alias_value":"YL5A3VFOHXYMOBTB","created_at":"2026-07-05T11:34:17.416740+00:00"},{"alias_kind":"pith_short_8","alias_value":"YL5A3VFO","created_at":"2026-07-05T11:34:17.416740+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YL5A3VFOHXYMOBTB7OC5MFB7WP","json":"https://pith.science/pith/YL5A3VFOHXYMOBTB7OC5MFB7WP.json","graph_json":"https://pith.science/api/pith-number/YL5A3VFOHXYMOBTB7OC5MFB7WP/graph.json","events_json":"https://pith.science/api/pith-number/YL5A3VFOHXYMOBTB7OC5MFB7WP/events.json","paper":"https://pith.science/paper/YL5A3VFO"},"agent_actions":{"view_html":"https://pith.science/pith/YL5A3VFOHXYMOBTB7OC5MFB7WP","download_json":"https://pith.science/pith/YL5A3VFOHXYMOBTB7OC5MFB7WP.json","view_paper":"https://pith.science/paper/YL5A3VFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.06508&json=true","fetch_graph":"https://pith.science/api/pith-number/YL5A3VFOHXYMOBTB7OC5MFB7WP/graph.json","fetch_events":"https://pith.science/api/pith-number/YL5A3VFOHXYMOBTB7OC5MFB7WP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YL5A3VFOHXYMOBTB7OC5MFB7WP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YL5A3VFOHXYMOBTB7OC5MFB7WP/action/storage_attestation","attest_author":"https://pith.science/pith/YL5A3VFOHXYMOBTB7OC5MFB7WP/action/author_attestation","sign_citation":"https://pith.science/pith/YL5A3VFOHXYMOBTB7OC5MFB7WP/action/citation_signature","submit_replication":"https://pith.science/pith/YL5A3VFOHXYMOBTB7OC5MFB7WP/action/replication_record"}},"created_at":"2026-07-05T11:34:17.416740+00:00","updated_at":"2026-07-05T11:34:17.416740+00:00"}