{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FNTLIKIGNDSEWMEY4RGD4X3XNP","short_pith_number":"pith:FNTLIKIG","canonical_record":{"source":{"id":"1301.7015","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-29T18:37:35Z","cross_cats_sorted":[],"title_canon_sha256":"f9aa48978a618e58ca1205225f2cf57e847551ab3376095fc423e33e60d6834b","abstract_canon_sha256":"062bed3ecc5b47e97cd013b2b305bb8047f3388a3b8f0a8c67236746b348e6dd"},"schema_version":"1.0"},"canonical_sha256":"2b66b4290668e44b3098e44c3e5f776bdfc2de4285f6d2b8f7d01fe7670427d3","source":{"kind":"arxiv","id":"1301.7015","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7015","created_at":"2026-05-18T03:32:04Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7015v2","created_at":"2026-05-18T03:32:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7015","created_at":"2026-05-18T03:32:04Z"},{"alias_kind":"pith_short_12","alias_value":"FNTLIKIGNDSE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FNTLIKIGNDSEWMEY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FNTLIKIG","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FNTLIKIGNDSEWMEY4RGD4X3XNP","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7015","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-29T18:37:35Z","cross_cats_sorted":[],"title_canon_sha256":"f9aa48978a618e58ca1205225f2cf57e847551ab3376095fc423e33e60d6834b","abstract_canon_sha256":"062bed3ecc5b47e97cd013b2b305bb8047f3388a3b8f0a8c67236746b348e6dd"},"schema_version":"1.0"},"canonical_sha256":"2b66b4290668e44b3098e44c3e5f776bdfc2de4285f6d2b8f7d01fe7670427d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:04.803607Z","signature_b64":"DOyjpb+7lyxZrUCVlxLsWKrlX+BempJWrAqYDXt4jlTjnnwO6qgnkxT6GSQfOwBebgxNaEeCvpKyswJCNdZQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b66b4290668e44b3098e44c3e5f776bdfc2de4285f6d2b8f7d01fe7670427d3","last_reissued_at":"2026-05-18T03:32:04.803114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:04.803114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7015","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-05-18T03:32:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dt2S7QDz4R7mNzDOZ7aqAPQRF7TccdEKvVNvdJmN2b43VPrx85DxqBO++42QUN3bfGIuJuu838RyiXl233E0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:23:02.319870Z"},"content_sha256":"fd15ed7b3cad2ae90f4289784a1555406bd5a1d9db862b87339bb57956f1cbf2","schema_version":"1.0","event_id":"sha256:fd15ed7b3cad2ae90f4289784a1555406bd5a1d9db862b87339bb57956f1cbf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FNTLIKIGNDSEWMEY4RGD4X3XNP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mining Frequent Graph Patterns with Differential Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Entong Shen, Ting Yu","submitted_at":"2013-01-29T18:37:35Z","abstract_excerpt":"Discovering frequent graph patterns in a graph database offers valuable information in a variety of applications. However, if the graph dataset contains sensitive data of individuals such as mobile phone-call graphs and web-click graphs, releasing discovered frequent patterns may present a threat to the privacy of individuals. {\\em Differential privacy} has recently emerged as the {\\em de facto} standard for private data analysis due to its provable privacy guarantee. In this paper we propose the first differentially private algorithm for mining frequent graph patterns.\n  We first show that pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7015","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":""},"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-05-18T03:32:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/JsHQmdXbO2yQACu4UcWhCZdy+KaDkvfU7/XE61VatYAKRO0RLUy2DLJ+bwZsmTZHRnD2ztKET1qp0um6OnAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:23:02.320266Z"},"content_sha256":"d926c09ef710ab74b13c0dd7800a587ad208a2fbe7e9a147da7f192b7d2dcde9","schema_version":"1.0","event_id":"sha256:d926c09ef710ab74b13c0dd7800a587ad208a2fbe7e9a147da7f192b7d2dcde9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNTLIKIGNDSEWMEY4RGD4X3XNP/bundle.json","state_url":"https://pith.science/pith/FNTLIKIGNDSEWMEY4RGD4X3XNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNTLIKIGNDSEWMEY4RGD4X3XNP/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-05-27T23:23:02Z","links":{"resolver":"https://pith.science/pith/FNTLIKIGNDSEWMEY4RGD4X3XNP","bundle":"https://pith.science/pith/FNTLIKIGNDSEWMEY4RGD4X3XNP/bundle.json","state":"https://pith.science/pith/FNTLIKIGNDSEWMEY4RGD4X3XNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNTLIKIGNDSEWMEY4RGD4X3XNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FNTLIKIGNDSEWMEY4RGD4X3XNP","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":"062bed3ecc5b47e97cd013b2b305bb8047f3388a3b8f0a8c67236746b348e6dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-29T18:37:35Z","title_canon_sha256":"f9aa48978a618e58ca1205225f2cf57e847551ab3376095fc423e33e60d6834b"},"schema_version":"1.0","source":{"id":"1301.7015","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7015","created_at":"2026-05-18T03:32:04Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7015v2","created_at":"2026-05-18T03:32:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7015","created_at":"2026-05-18T03:32:04Z"},{"alias_kind":"pith_short_12","alias_value":"FNTLIKIGNDSE","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FNTLIKIGNDSEWMEY","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FNTLIKIG","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:d926c09ef710ab74b13c0dd7800a587ad208a2fbe7e9a147da7f192b7d2dcde9","target":"graph","created_at":"2026-05-18T03:32:04Z","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"},"paper":{"abstract_excerpt":"Discovering frequent graph patterns in a graph database offers valuable information in a variety of applications. However, if the graph dataset contains sensitive data of individuals such as mobile phone-call graphs and web-click graphs, releasing discovered frequent patterns may present a threat to the privacy of individuals. {\\em Differential privacy} has recently emerged as the {\\em de facto} standard for private data analysis due to its provable privacy guarantee. In this paper we propose the first differentially private algorithm for mining frequent graph patterns.\n  We first show that pr","authors_text":"Entong Shen, Ting Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-29T18:37:35Z","title":"Mining Frequent Graph Patterns with Differential Privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7015","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:fd15ed7b3cad2ae90f4289784a1555406bd5a1d9db862b87339bb57956f1cbf2","target":"record","created_at":"2026-05-18T03:32:04Z","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":"062bed3ecc5b47e97cd013b2b305bb8047f3388a3b8f0a8c67236746b348e6dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2013-01-29T18:37:35Z","title_canon_sha256":"f9aa48978a618e58ca1205225f2cf57e847551ab3376095fc423e33e60d6834b"},"schema_version":"1.0","source":{"id":"1301.7015","kind":"arxiv","version":2}},"canonical_sha256":"2b66b4290668e44b3098e44c3e5f776bdfc2de4285f6d2b8f7d01fe7670427d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b66b4290668e44b3098e44c3e5f776bdfc2de4285f6d2b8f7d01fe7670427d3","first_computed_at":"2026-05-18T03:32:04.803114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:04.803114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DOyjpb+7lyxZrUCVlxLsWKrlX+BempJWrAqYDXt4jlTjnnwO6qgnkxT6GSQfOwBebgxNaEeCvpKyswJCNdZQCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:04.803607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7015","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd15ed7b3cad2ae90f4289784a1555406bd5a1d9db862b87339bb57956f1cbf2","sha256:d926c09ef710ab74b13c0dd7800a587ad208a2fbe7e9a147da7f192b7d2dcde9"],"state_sha256":"b22fa0439c8eb89120e858338572462b52d70cc236343cb3ca85617a87608ca5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9nZCxfWpYgZLVpG4RYIeIWIM2xisWfVZ63HWTI6QjpX+A3pwi5Um9XUVrK1nLlnRPg0wdRhWlPPAcdEozQ1GCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:23:02.322761Z","bundle_sha256":"36574dcaedf10d1b7598c69ac946a33c445fe186c431b68ddcded46cb81979a9"}}