{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5RT2WKOFKFJMF2ONTAJJGESOYE","short_pith_number":"pith:5RT2WKOF","schema_version":"1.0","canonical_sha256":"ec67ab29c55152c2e9cd981293124ec1387111ddedaed1d0319cc06d66cd59ae","source":{"kind":"arxiv","id":"2203.06791","version":3},"attestation_state":"computed","paper":{"title":"HDPView: Differentially Private Materialized View for Exploring High Dimensional Relational Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DB","authors_text":"Fumiyuki Kato, Masatoshi Yoshikawa, Seng Pei Liew, Shun Takagi, Tsubasa Takahashi, Yang Cao","submitted_at":"2022-03-14T00:06:04Z","abstract_excerpt":"How can we explore the unknown properties of high-dimensional sensitive relational data while preserving privacy? We study how to construct an explorable privacy-preserving materialized view under differential privacy. No existing state-of-the-art methods simultaneously satisfy the following essential properties in data exploration: workload independence, analytical reliability (i.e., providing error bound for each search query), applicability to high-dimensional data, and space efficiency. To solve the above issues, we propose HDPView, which creates a differentially private materialized view "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2203.06791","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2022-03-14T00:06:04Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"bf367608f1168ed80f28e5fb0979c8ccb5daed9084995ba8fe6aaf1f33fe7645","abstract_canon_sha256":"604be6052995d042a5450f14711e9538e16a35d448ad316b4f8d3006806d25f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:36.821369Z","signature_b64":"ymxsN5VqoNXPH75FbprCS6LaAhw8pdMV19H9nS/sJlG96K5kiv0ZsqBwRuO/wFnZWWyd8lRk8GCVMJk8bWDdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec67ab29c55152c2e9cd981293124ec1387111ddedaed1d0319cc06d66cd59ae","last_reissued_at":"2026-07-05T04:26:36.820934Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:36.820934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HDPView: Differentially Private Materialized View for Exploring High Dimensional Relational Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DB","authors_text":"Fumiyuki Kato, Masatoshi Yoshikawa, Seng Pei Liew, Shun Takagi, Tsubasa Takahashi, Yang Cao","submitted_at":"2022-03-14T00:06:04Z","abstract_excerpt":"How can we explore the unknown properties of high-dimensional sensitive relational data while preserving privacy? We study how to construct an explorable privacy-preserving materialized view under differential privacy. No existing state-of-the-art methods simultaneously satisfy the following essential properties in data exploration: workload independence, analytical reliability (i.e., providing error bound for each search query), applicability to high-dimensional data, and space efficiency. To solve the above issues, we propose HDPView, which creates a differentially private materialized view "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.06791","kind":"arxiv","version":3},"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/2203.06791/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2203.06791","created_at":"2026-07-05T04:26:36.820992+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.06791v3","created_at":"2026-07-05T04:26:36.820992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.06791","created_at":"2026-07-05T04:26:36.820992+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RT2WKOFKFJM","created_at":"2026-07-05T04:26:36.820992+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RT2WKOFKFJMF2ON","created_at":"2026-07-05T04:26:36.820992+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RT2WKOF","created_at":"2026-07-05T04:26:36.820992+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.10207","citing_title":"RIPOST: Two-Phase Private Decomposition for Multidimensional Data","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5RT2WKOFKFJMF2ONTAJJGESOYE","json":"https://pith.science/pith/5RT2WKOFKFJMF2ONTAJJGESOYE.json","graph_json":"https://pith.science/api/pith-number/5RT2WKOFKFJMF2ONTAJJGESOYE/graph.json","events_json":"https://pith.science/api/pith-number/5RT2WKOFKFJMF2ONTAJJGESOYE/events.json","paper":"https://pith.science/paper/5RT2WKOF"},"agent_actions":{"view_html":"https://pith.science/pith/5RT2WKOFKFJMF2ONTAJJGESOYE","download_json":"https://pith.science/pith/5RT2WKOFKFJMF2ONTAJJGESOYE.json","view_paper":"https://pith.science/paper/5RT2WKOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.06791&json=true","fetch_graph":"https://pith.science/api/pith-number/5RT2WKOFKFJMF2ONTAJJGESOYE/graph.json","fetch_events":"https://pith.science/api/pith-number/5RT2WKOFKFJMF2ONTAJJGESOYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RT2WKOFKFJMF2ONTAJJGESOYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RT2WKOFKFJMF2ONTAJJGESOYE/action/storage_attestation","attest_author":"https://pith.science/pith/5RT2WKOFKFJMF2ONTAJJGESOYE/action/author_attestation","sign_citation":"https://pith.science/pith/5RT2WKOFKFJMF2ONTAJJGESOYE/action/citation_signature","submit_replication":"https://pith.science/pith/5RT2WKOFKFJMF2ONTAJJGESOYE/action/replication_record"}},"created_at":"2026-07-05T04:26:36.820992+00:00","updated_at":"2026-07-05T04:26:36.820992+00:00"}