{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3TV5AGHZ5HDLTXIBDCUWCHN7EA","short_pith_number":"pith:3TV5AGHZ","canonical_record":{"source":{"id":"2312.07055","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-12-12T08:12:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"35a8af618efa45649a79ba23b17d94bfe59805a050b3066ab509cdc698dcad92","abstract_canon_sha256":"885c918bb2820b85c4a80aad5f383f3acfb931929b2e78a482ec635147b0a5e3"},"schema_version":"1.0"},"canonical_sha256":"dcebd018f9e9c6b9dd0118a9611dbf2022f702ceb95ae28c3898bb5ed9a3e3ac","source":{"kind":"arxiv","id":"2312.07055","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07055","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07055v2","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07055","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"3TV5AGHZ5HDL","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"pith_short_16","alias_value":"3TV5AGHZ5HDLTXIB","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"pith_short_8","alias_value":"3TV5AGHZ","created_at":"2026-07-05T11:53:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3TV5AGHZ5HDLTXIBDCUWCHN7EA","target":"record","payload":{"canonical_record":{"source":{"id":"2312.07055","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-12-12T08:12:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"35a8af618efa45649a79ba23b17d94bfe59805a050b3066ab509cdc698dcad92","abstract_canon_sha256":"885c918bb2820b85c4a80aad5f383f3acfb931929b2e78a482ec635147b0a5e3"},"schema_version":"1.0"},"canonical_sha256":"dcebd018f9e9c6b9dd0118a9611dbf2022f702ceb95ae28c3898bb5ed9a3e3ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:39.786547Z","signature_b64":"+mj6+rZKB2UoUjvJ6qXNlgfDFeSR73SuARs695vMsm+VJkyqoUvrl6S8XYO87GhVZnk6tTw3k2maTzypb8i+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcebd018f9e9c6b9dd0118a9611dbf2022f702ceb95ae28c3898bb5ed9a3e3ac","last_reissued_at":"2026-07-05T11:53:39.786061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:39.786061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.07055","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zC641N/Zrn325zOBQCkdlxXFrnwhoP2vxAcPv15HEjVyQ8K83MEMkVvcZ3xVAvz2/qGT1FD1PLop1BiS/kMcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:23:04.288732Z"},"content_sha256":"1fd572f9be93409e2f5d73006b75e819866d61b273730015f34a537651439d4b","schema_version":"1.0","event_id":"sha256:1fd572f9be93409e2f5d73006b75e819866d61b273730015f34a537651439d4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3TV5AGHZ5HDLTXIBDCUWCHN7EA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"Quentin Hillebrand, Tetsuo Shibuya, Vorapong Suppakitpaisarn","submitted_at":"2023-12-12T08:12:18Z","abstract_excerpt":"We suggest the use of hash functions to cut down the communication costs when counting subgraphs under edge local differential privacy. While various algorithms exist for computing graph statistics, including the count of subgraphs, under the edge local differential privacy, many suffer with high communication costs, making them less efficient for large graphs. Though data compression is a typical approach in differential privacy, its application in local differential privacy requires a form of compression that every node can reproduce. In our study, we introduce linear congruence hashing. Wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07055","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.07055/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+TW7Ak9rPu/btOVCmsmgEhSkVa1NmGyjZV2XTVWh+aHX6OTvZVJc1OR88PfprV61IH+8Ub1LnT1wJo4PqD1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T16:23:04.289663Z"},"content_sha256":"b92b58d47d7e9a5145dcb13de65452b47c6a7cec8c6ee69f525f0d522d536a5d","schema_version":"1.0","event_id":"sha256:b92b58d47d7e9a5145dcb13de65452b47c6a7cec8c6ee69f525f0d522d536a5d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TV5AGHZ5HDLTXIBDCUWCHN7EA/bundle.json","state_url":"https://pith.science/pith/3TV5AGHZ5HDLTXIBDCUWCHN7EA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TV5AGHZ5HDLTXIBDCUWCHN7EA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T16:23:04Z","links":{"resolver":"https://pith.science/pith/3TV5AGHZ5HDLTXIBDCUWCHN7EA","bundle":"https://pith.science/pith/3TV5AGHZ5HDLTXIBDCUWCHN7EA/bundle.json","state":"https://pith.science/pith/3TV5AGHZ5HDLTXIBDCUWCHN7EA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TV5AGHZ5HDLTXIBDCUWCHN7EA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3TV5AGHZ5HDLTXIBDCUWCHN7EA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"885c918bb2820b85c4a80aad5f383f3acfb931929b2e78a482ec635147b0a5e3","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-12-12T08:12:18Z","title_canon_sha256":"35a8af618efa45649a79ba23b17d94bfe59805a050b3066ab509cdc698dcad92"},"schema_version":"1.0","source":{"id":"2312.07055","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.07055","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"2312.07055v2","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.07055","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"3TV5AGHZ5HDL","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"pith_short_16","alias_value":"3TV5AGHZ5HDLTXIB","created_at":"2026-07-05T11:53:39Z"},{"alias_kind":"pith_short_8","alias_value":"3TV5AGHZ","created_at":"2026-07-05T11:53:39Z"}],"graph_snapshots":[{"event_id":"sha256:b92b58d47d7e9a5145dcb13de65452b47c6a7cec8c6ee69f525f0d522d536a5d","target":"graph","created_at":"2026-07-05T11:53:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.07055/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We suggest the use of hash functions to cut down the communication costs when counting subgraphs under edge local differential privacy. While various algorithms exist for computing graph statistics, including the count of subgraphs, under the edge local differential privacy, many suffer with high communication costs, making them less efficient for large graphs. Though data compression is a typical approach in differential privacy, its application in local differential privacy requires a form of compression that every node can reproduce. In our study, we introduce linear congruence hashing. Wit","authors_text":"Quentin Hillebrand, Tetsuo Shibuya, Vorapong Suppakitpaisarn","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-12-12T08:12:18Z","title":"Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.07055","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1fd572f9be93409e2f5d73006b75e819866d61b273730015f34a537651439d4b","target":"record","created_at":"2026-07-05T11:53:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"885c918bb2820b85c4a80aad5f383f3acfb931929b2e78a482ec635147b0a5e3","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-12-12T08:12:18Z","title_canon_sha256":"35a8af618efa45649a79ba23b17d94bfe59805a050b3066ab509cdc698dcad92"},"schema_version":"1.0","source":{"id":"2312.07055","kind":"arxiv","version":2}},"canonical_sha256":"dcebd018f9e9c6b9dd0118a9611dbf2022f702ceb95ae28c3898bb5ed9a3e3ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcebd018f9e9c6b9dd0118a9611dbf2022f702ceb95ae28c3898bb5ed9a3e3ac","first_computed_at":"2026-07-05T11:53:39.786061Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:53:39.786061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mj6+rZKB2UoUjvJ6qXNlgfDFeSR73SuARs695vMsm+VJkyqoUvrl6S8XYO87GhVZnk6tTw3k2maTzypb8i+Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:53:39.786547Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.07055","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fd572f9be93409e2f5d73006b75e819866d61b273730015f34a537651439d4b","sha256:b92b58d47d7e9a5145dcb13de65452b47c6a7cec8c6ee69f525f0d522d536a5d"],"state_sha256":"a631f18fe94f1c99e51b6e8441f699ce22d6bef5d788d76af2090196ddf13e6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKsHpiB1ePkPTInzvB83Tq+TFX9MCMLxeAYITc5KcPYtjNggnwEL6M2BADblki54gjWylwscvaSfq1cWlVzjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T16:23:04.296751Z","bundle_sha256":"3519b57ac98726440014e5c7eae79672d7783eaf617e3575679b6dff9b437438"}}