{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TA4KBNCD4VHRU6HI5RZGJKQLEM","short_pith_number":"pith:TA4KBNCD","canonical_record":{"source":{"id":"2505.12954","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2025-05-19T10:46:21Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"118aed26b749f7c98a997617703dc15d2690cbf0a9530efd6820d8139733de48","abstract_canon_sha256":"47d3741017e53672d24da2e43d03c0d6f61cf90700840b3de63b31bf65fef0f2"},"schema_version":"1.0"},"canonical_sha256":"9838a0b443e54f1a78e8ec7264aa0b23221e68ea9e9eb97a28288656a193f59f","source":{"kind":"arxiv","id":"2505.12954","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12954","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12954v1","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12954","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"TA4KBNCD4VHR","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"TA4KBNCD4VHRU6HI","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"TA4KBNCD","created_at":"2026-07-05T11:05:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TA4KBNCD4VHRU6HI5RZGJKQLEM","target":"record","payload":{"canonical_record":{"source":{"id":"2505.12954","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2025-05-19T10:46:21Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"118aed26b749f7c98a997617703dc15d2690cbf0a9530efd6820d8139733de48","abstract_canon_sha256":"47d3741017e53672d24da2e43d03c0d6f61cf90700840b3de63b31bf65fef0f2"},"schema_version":"1.0"},"canonical_sha256":"9838a0b443e54f1a78e8ec7264aa0b23221e68ea9e9eb97a28288656a193f59f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:12.539115Z","signature_b64":"Y1jU09u79a1lMar0Qs/ZMcQ4izwh/c41NjH6IquvbKeVYEboFJzBx/AJykewfg6BGOrEM+zEs+desgYRZu7QDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9838a0b443e54f1a78e8ec7264aa0b23221e68ea9e9eb97a28288656a193f59f","last_reissued_at":"2026-07-05T11:05:12.538525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:12.538525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.12954","source_version":1,"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:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XrykQ3VqG493x9YinPpeUT5QiRgvqnKeIR4zjraAYDnJOw5XxIsoOV+Tt/aFoHjS0th3IejWUMVhJjaiZ5+FAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:27:20.428807Z"},"content_sha256":"0b9bf15b791175e4fe328601ca0150e34974ad8dd46234336704fb2c756af3c3","schema_version":"1.0","event_id":"sha256:0b9bf15b791175e4fe328601ca0150e34974ad8dd46234336704fb2c756af3c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TA4KBNCD4VHRU6HI5RZGJKQLEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Graphlets of Size $k$ under Local Differential Privacy","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.SI","authors_text":"Donlapark Ponnoprat, Nicha Hirankarn, Quentin Hillebrand, Vorapong Suppakitpaisarn","submitted_at":"2025-05-19T10:46:21Z","abstract_excerpt":"The problem of counting subgraphs or graphlets under local differential privacy is an important challenge that has attracted significant attention from researchers. However, much of the existing work focuses on small graphlets like triangles or $k$-stars. In this paper, we propose a non-interactive, locally differentially private algorithm capable of counting graphlets of any size $k$. When $n$ is the number of nodes in the input graph, we show that the expected $\\ell_2$ error of our algorithm is $O(n^{k - 1})$. Additionally, we prove that there exists a class of input graphs and graphlets of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12954","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/2505.12954/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:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XtXiEMmMKKtuBookSIiElrd0izvk4USKRTwc1CvZY+49KLHjmG2LW++Gilv6aaH6fOcYaP8thB+xnnatzLhGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T05:27:20.429136Z"},"content_sha256":"bc140b994394bd79f22444fdb80ba535270664c688756e464001405227ead85f","schema_version":"1.0","event_id":"sha256:bc140b994394bd79f22444fdb80ba535270664c688756e464001405227ead85f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TA4KBNCD4VHRU6HI5RZGJKQLEM/bundle.json","state_url":"https://pith.science/pith/TA4KBNCD4VHRU6HI5RZGJKQLEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TA4KBNCD4VHRU6HI5RZGJKQLEM/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-01T05:27:20Z","links":{"resolver":"https://pith.science/pith/TA4KBNCD4VHRU6HI5RZGJKQLEM","bundle":"https://pith.science/pith/TA4KBNCD4VHRU6HI5RZGJKQLEM/bundle.json","state":"https://pith.science/pith/TA4KBNCD4VHRU6HI5RZGJKQLEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TA4KBNCD4VHRU6HI5RZGJKQLEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TA4KBNCD4VHRU6HI5RZGJKQLEM","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":"47d3741017e53672d24da2e43d03c0d6f61cf90700840b3de63b31bf65fef0f2","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2025-05-19T10:46:21Z","title_canon_sha256":"118aed26b749f7c98a997617703dc15d2690cbf0a9530efd6820d8139733de48"},"schema_version":"1.0","source":{"id":"2505.12954","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12954","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12954v1","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12954","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"TA4KBNCD4VHR","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"pith_short_16","alias_value":"TA4KBNCD4VHRU6HI","created_at":"2026-07-05T11:05:12Z"},{"alias_kind":"pith_short_8","alias_value":"TA4KBNCD","created_at":"2026-07-05T11:05:12Z"}],"graph_snapshots":[{"event_id":"sha256:bc140b994394bd79f22444fdb80ba535270664c688756e464001405227ead85f","target":"graph","created_at":"2026-07-05T11:05:12Z","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/2505.12954/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The problem of counting subgraphs or graphlets under local differential privacy is an important challenge that has attracted significant attention from researchers. However, much of the existing work focuses on small graphlets like triangles or $k$-stars. In this paper, we propose a non-interactive, locally differentially private algorithm capable of counting graphlets of any size $k$. When $n$ is the number of nodes in the input graph, we show that the expected $\\ell_2$ error of our algorithm is $O(n^{k - 1})$. Additionally, we prove that there exists a class of input graphs and graphlets of ","authors_text":"Donlapark Ponnoprat, Nicha Hirankarn, Quentin Hillebrand, Vorapong Suppakitpaisarn","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2025-05-19T10:46:21Z","title":"Counting Graphlets of Size $k$ under Local Differential Privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12954","kind":"arxiv","version":1},"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:0b9bf15b791175e4fe328601ca0150e34974ad8dd46234336704fb2c756af3c3","target":"record","created_at":"2026-07-05T11:05:12Z","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":"47d3741017e53672d24da2e43d03c0d6f61cf90700840b3de63b31bf65fef0f2","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2025-05-19T10:46:21Z","title_canon_sha256":"118aed26b749f7c98a997617703dc15d2690cbf0a9530efd6820d8139733de48"},"schema_version":"1.0","source":{"id":"2505.12954","kind":"arxiv","version":1}},"canonical_sha256":"9838a0b443e54f1a78e8ec7264aa0b23221e68ea9e9eb97a28288656a193f59f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9838a0b443e54f1a78e8ec7264aa0b23221e68ea9e9eb97a28288656a193f59f","first_computed_at":"2026-07-05T11:05:12.538525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:05:12.538525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y1jU09u79a1lMar0Qs/ZMcQ4izwh/c41NjH6IquvbKeVYEboFJzBx/AJykewfg6BGOrEM+zEs+desgYRZu7QDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:05:12.539115Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.12954","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b9bf15b791175e4fe328601ca0150e34974ad8dd46234336704fb2c756af3c3","sha256:bc140b994394bd79f22444fdb80ba535270664c688756e464001405227ead85f"],"state_sha256":"9360c9329bd87e5361be58c2e29576978e44a8a6c830f0ace9f504f0f4e618d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UqTEPM/zzGl0sIBue7pmkkFVIOJPspMUkpszLq1+UWHTkyk4JtoBC9CVFV9rEbHte3ONYD7+wIJPwIAGK7FIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T05:27:20.431236Z","bundle_sha256":"2847ba0d82447e94291d0a3322756238b546f2a2140735b53c5621d420ef17cc"}}