{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XFL4EF53X7EG37SZM7XR4ZAAJO","short_pith_number":"pith:XFL4EF53","canonical_record":{"source":{"id":"1207.0872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-07-04T01:24:57Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"7963d4178d23172a6a7f118cb0723f003dc201f983be4c29351f33236443f39a","abstract_canon_sha256":"18bff59af94f020de35a506d38f90c11f4d1ef994bb0f35fcc670a7b77b8637c"},"schema_version":"1.0"},"canonical_sha256":"b957c217bbbfc86dfe5967ef1e64004bb65e40b72d07b7238edf22f6f369a596","source":{"kind":"arxiv","id":"1207.0872","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0872","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0872v1","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0872","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"XFL4EF53X7EG","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XFL4EF53X7EG37SZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XFL4EF53","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XFL4EF53X7EG37SZM7XR4ZAAJO","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-07-04T01:24:57Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"7963d4178d23172a6a7f118cb0723f003dc201f983be4c29351f33236443f39a","abstract_canon_sha256":"18bff59af94f020de35a506d38f90c11f4d1ef994bb0f35fcc670a7b77b8637c"},"schema_version":"1.0"},"canonical_sha256":"b957c217bbbfc86dfe5967ef1e64004bb65e40b72d07b7238edf22f6f369a596","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:48.148322Z","signature_b64":"RYGIJ/t9Kfq43YoNvpERh9DHfvFE5xzvhBCYDacfK6l1ek3326f5fDZHvkKQ/RKZYjXwXcugWgHuzRxD68faBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b957c217bbbfc86dfe5967ef1e64004bb65e40b72d07b7238edf22f6f369a596","last_reissued_at":"2026-05-18T03:51:48.147777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:48.147777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0872","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-05-18T03:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtqPGXGhrNjGGJI31dQGG3Kbf8Y9qGSByVDUndwduR8XQAixpGlCrRLc8P1u76OPFQO7YUz4ejzwPZP//moODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:15:47.803194Z"},"content_sha256":"1d9d2fc88941e01aaa2d172de746f9d0f80adba8621270740fdba28056e380bc","schema_version":"1.0","event_id":"sha256:1d9d2fc88941e01aaa2d172de746f9d0f80adba8621270740fdba28056e380bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XFL4EF53X7EG37SZM7XR4ZAAJO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differential Privacy for Relational Algebra: Improving the Sensitivity Bounds via Constraint Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.CR","authors_text":"Catuscia Palamidessi (INRIA, Ecole polytechnique, France), Italy), LIX, Marco Stronati (Universit\\`a di Pisa","submitted_at":"2012-07-04T01:24:57Z","abstract_excerpt":"Differential privacy is a modern approach in privacy-preserving data analysis to control the amount of information that can be inferred about an individual by querying a database. The most common techniques are based on the introduction of probabilistic noise, often defined as a Laplacian parametric on the sensitivity of the query. In order to maximize the utility of the query, it is crucial to estimate the sensitivity as precisely as possible. \n  In this paper we consider relational algebra, the classical language for queries in relational databases, and we propose a method for computing a bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0872","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":""},"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:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zt2iFP19rSdqGEdZU0OcmWmL8W7IIeBim2rDI3dwX+Lh4xMJTvChMP00GApQXe12SZm+RwPA89XJyvGhaw9OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:15:47.803568Z"},"content_sha256":"4599c6c38105b58ba9679a9dd4f3f96ced7674e6ef22c7006243680d42466a48","schema_version":"1.0","event_id":"sha256:4599c6c38105b58ba9679a9dd4f3f96ced7674e6ef22c7006243680d42466a48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFL4EF53X7EG37SZM7XR4ZAAJO/bundle.json","state_url":"https://pith.science/pith/XFL4EF53X7EG37SZM7XR4ZAAJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFL4EF53X7EG37SZM7XR4ZAAJO/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-06-26T02:15:47Z","links":{"resolver":"https://pith.science/pith/XFL4EF53X7EG37SZM7XR4ZAAJO","bundle":"https://pith.science/pith/XFL4EF53X7EG37SZM7XR4ZAAJO/bundle.json","state":"https://pith.science/pith/XFL4EF53X7EG37SZM7XR4ZAAJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFL4EF53X7EG37SZM7XR4ZAAJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XFL4EF53X7EG37SZM7XR4ZAAJO","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":"18bff59af94f020de35a506d38f90c11f4d1ef994bb0f35fcc670a7b77b8637c","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-07-04T01:24:57Z","title_canon_sha256":"7963d4178d23172a6a7f118cb0723f003dc201f983be4c29351f33236443f39a"},"schema_version":"1.0","source":{"id":"1207.0872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0872","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0872v1","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0872","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"XFL4EF53X7EG","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XFL4EF53X7EG37SZ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XFL4EF53","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:4599c6c38105b58ba9679a9dd4f3f96ced7674e6ef22c7006243680d42466a48","target":"graph","created_at":"2026-05-18T03:51:48Z","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":"Differential privacy is a modern approach in privacy-preserving data analysis to control the amount of information that can be inferred about an individual by querying a database. The most common techniques are based on the introduction of probabilistic noise, often defined as a Laplacian parametric on the sensitivity of the query. In order to maximize the utility of the query, it is crucial to estimate the sensitivity as precisely as possible. \n  In this paper we consider relational algebra, the classical language for queries in relational databases, and we propose a method for computing a bo","authors_text":"Catuscia Palamidessi (INRIA, Ecole polytechnique, France), Italy), LIX, Marco Stronati (Universit\\`a di Pisa","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-07-04T01:24:57Z","title":"Differential Privacy for Relational Algebra: Improving the Sensitivity Bounds via Constraint Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0872","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:1d9d2fc88941e01aaa2d172de746f9d0f80adba8621270740fdba28056e380bc","target":"record","created_at":"2026-05-18T03:51:48Z","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":"18bff59af94f020de35a506d38f90c11f4d1ef994bb0f35fcc670a7b77b8637c","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-07-04T01:24:57Z","title_canon_sha256":"7963d4178d23172a6a7f118cb0723f003dc201f983be4c29351f33236443f39a"},"schema_version":"1.0","source":{"id":"1207.0872","kind":"arxiv","version":1}},"canonical_sha256":"b957c217bbbfc86dfe5967ef1e64004bb65e40b72d07b7238edf22f6f369a596","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b957c217bbbfc86dfe5967ef1e64004bb65e40b72d07b7238edf22f6f369a596","first_computed_at":"2026-05-18T03:51:48.147777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:48.147777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RYGIJ/t9Kfq43YoNvpERh9DHfvFE5xzvhBCYDacfK6l1ek3326f5fDZHvkKQ/RKZYjXwXcugWgHuzRxD68faBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:48.148322Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d9d2fc88941e01aaa2d172de746f9d0f80adba8621270740fdba28056e380bc","sha256:4599c6c38105b58ba9679a9dd4f3f96ced7674e6ef22c7006243680d42466a48"],"state_sha256":"0c6c0baa5bd813f086ca73b2730c0cca8a360b06d0f06d9b9e8b472829e35b56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTYxKWqeZhwioriqL/bmJr1MYNHd44Ctzj6lu3N45Lq7IlfYVTnn9sZafx9WaVnrYj2M79KszZ7vJW4I5/SGBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:15:47.805796Z","bundle_sha256":"4bf1ed8420d28800736165fa11d940a8aeeb2ac9e85c5128545e8707daa9bcae"}}