{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SOKMVLFLJUEGEANHFQBJIICEEL","short_pith_number":"pith:SOKMVLFL","canonical_record":{"source":{"id":"1808.09565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-28T22:32:08Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"4e5b10b174217ebbb977800c576592c8bd145346ce1ac5f922cbab0d5bbf226a","abstract_canon_sha256":"60ad92a0739fc05d45f6cdefa37578f82b6b9f4d4cc4ad4375d128183a0a125e"},"schema_version":"1.0"},"canonical_sha256":"9394caacab4d086201a72c0294204422f47e7d52c17b3f121da4f12bc6efb879","source":{"kind":"arxiv","id":"1808.09565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09565","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09565v1","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09565","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"SOKMVLFLJUEG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SOKMVLFLJUEGEANH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SOKMVLFL","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SOKMVLFLJUEGEANHFQBJIICEEL","target":"record","payload":{"canonical_record":{"source":{"id":"1808.09565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-28T22:32:08Z","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"title_canon_sha256":"4e5b10b174217ebbb977800c576592c8bd145346ce1ac5f922cbab0d5bbf226a","abstract_canon_sha256":"60ad92a0739fc05d45f6cdefa37578f82b6b9f4d4cc4ad4375d128183a0a125e"},"schema_version":"1.0"},"canonical_sha256":"9394caacab4d086201a72c0294204422f47e7d52c17b3f121da4f12bc6efb879","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:55.161333Z","signature_b64":"idp5GypFqsMJ+xk667pImUFXdKRGFYvFLIzkQTKL2WFCmTG4V2MIfJ8qXBMV/ISyyPykPACxw6cy9Gh6Bu3mCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9394caacab4d086201a72c0294204422f47e7d52c17b3f121da4f12bc6efb879","last_reissued_at":"2026-05-18T00:06:55.160738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:55.160738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.09565","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-18T00:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BjhGH4jTxQWEN76+7KAPv7Ogw0g3fuCYfhuub35FUHJGbiBISpF3pN2DYypdR6/g1K3SxgDYXpNHRZt9yoQZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:31:25.969019Z"},"content_sha256":"350b76d62320324bb2cde468ee953373cb010032bb1e085bd2a44e9362c2d35a","schema_version":"1.0","event_id":"sha256:350b76d62320324bb2cde468ee953373cb010032bb1e085bd2a44e9362c2d35a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SOKMVLFLJUEGEANHFQBJIICEEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ensuring Privacy with Constrained Additive Noise by Minimizing Fisher Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.SY","math.IT"],"primary_cat":"math.OC","authors_text":"Farhad Farokhi, Henrik Sandberg","submitted_at":"2018-08-28T22:32:08Z","abstract_excerpt":"The problem of preserving the privacy of individual entries of a database when responding to linear or nonlinear queries with constrained additive noise is considered. For privacy protection, the response to the query is systematically corrupted with an additive random noise whose support is a subset or equal to a pre-defined constraint set. A measure of privacy using the inverse of the trace of the Fisher information matrix is developed. The Cramer-Rao bound relates the variance of any estimator of the database entries to the introduced privacy measure. The probability density that minimizes "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09565","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-18T00:06:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2LF5MKXin7VKbeAO7foofTqybThNDE/ho/AKOul2ZW9Tcn0km9QFlqZmFkhoLI5nRxZ6HYlGSVTju3nNh3bfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:31:25.969656Z"},"content_sha256":"bf14eed2e86e7a57ce13f8fcbf335ce1711c4e3e7cb39de98ce8b7585b5fcd7f","schema_version":"1.0","event_id":"sha256:bf14eed2e86e7a57ce13f8fcbf335ce1711c4e3e7cb39de98ce8b7585b5fcd7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOKMVLFLJUEGEANHFQBJIICEEL/bundle.json","state_url":"https://pith.science/pith/SOKMVLFLJUEGEANHFQBJIICEEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOKMVLFLJUEGEANHFQBJIICEEL/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-08T21:31:25Z","links":{"resolver":"https://pith.science/pith/SOKMVLFLJUEGEANHFQBJIICEEL","bundle":"https://pith.science/pith/SOKMVLFLJUEGEANHFQBJIICEEL/bundle.json","state":"https://pith.science/pith/SOKMVLFLJUEGEANHFQBJIICEEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOKMVLFLJUEGEANHFQBJIICEEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SOKMVLFLJUEGEANHFQBJIICEEL","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":"60ad92a0739fc05d45f6cdefa37578f82b6b9f4d4cc4ad4375d128183a0a125e","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-28T22:32:08Z","title_canon_sha256":"4e5b10b174217ebbb977800c576592c8bd145346ce1ac5f922cbab0d5bbf226a"},"schema_version":"1.0","source":{"id":"1808.09565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.09565","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"arxiv_version","alias_value":"1808.09565v1","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.09565","created_at":"2026-05-18T00:06:55Z"},{"alias_kind":"pith_short_12","alias_value":"SOKMVLFLJUEG","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SOKMVLFLJUEGEANH","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SOKMVLFL","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:bf14eed2e86e7a57ce13f8fcbf335ce1711c4e3e7cb39de98ce8b7585b5fcd7f","target":"graph","created_at":"2026-05-18T00:06:55Z","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":"The problem of preserving the privacy of individual entries of a database when responding to linear or nonlinear queries with constrained additive noise is considered. For privacy protection, the response to the query is systematically corrupted with an additive random noise whose support is a subset or equal to a pre-defined constraint set. A measure of privacy using the inverse of the trace of the Fisher information matrix is developed. The Cramer-Rao bound relates the variance of any estimator of the database entries to the introduced privacy measure. The probability density that minimizes ","authors_text":"Farhad Farokhi, Henrik Sandberg","cross_cats":["cs.IT","cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-28T22:32:08Z","title":"Ensuring Privacy with Constrained Additive Noise by Minimizing Fisher Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.09565","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:350b76d62320324bb2cde468ee953373cb010032bb1e085bd2a44e9362c2d35a","target":"record","created_at":"2026-05-18T00:06:55Z","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":"60ad92a0739fc05d45f6cdefa37578f82b6b9f4d4cc4ad4375d128183a0a125e","cross_cats_sorted":["cs.IT","cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-28T22:32:08Z","title_canon_sha256":"4e5b10b174217ebbb977800c576592c8bd145346ce1ac5f922cbab0d5bbf226a"},"schema_version":"1.0","source":{"id":"1808.09565","kind":"arxiv","version":1}},"canonical_sha256":"9394caacab4d086201a72c0294204422f47e7d52c17b3f121da4f12bc6efb879","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9394caacab4d086201a72c0294204422f47e7d52c17b3f121da4f12bc6efb879","first_computed_at":"2026-05-18T00:06:55.160738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:55.160738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"idp5GypFqsMJ+xk667pImUFXdKRGFYvFLIzkQTKL2WFCmTG4V2MIfJ8qXBMV/ISyyPykPACxw6cy9Gh6Bu3mCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:55.161333Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.09565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:350b76d62320324bb2cde468ee953373cb010032bb1e085bd2a44e9362c2d35a","sha256:bf14eed2e86e7a57ce13f8fcbf335ce1711c4e3e7cb39de98ce8b7585b5fcd7f"],"state_sha256":"5799bbd2df2b101f3eeb9284b0d5551113be5ffb5e98f452591420d7053270e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ryUNPPepYPVWZRFI5L5XefB8Agfzi7MuEHcddOI4btUAKOCHyjhNxlKFJeuEbZaOPydXHBEHVhrxhiUUc3NlAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:31:25.973158Z","bundle_sha256":"b276b546c010dde079400d5c211abe52060c11f22f85595eafd49a2dd0df66a3"}}