{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KHY3MLBZWORRH4ETSL3NLB3VCB","short_pith_number":"pith:KHY3MLBZ","schema_version":"1.0","canonical_sha256":"51f1b62c39b3a313f09392f6d58775106a1590b2d2a3d1e00e38edda6968cbe7","source":{"kind":"arxiv","id":"1605.06143","version":1},"attestation_state":"computed","paper":{"title":"Efficient and Private Approximations of Distributed Databases Calculations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ehud Gudes, Jeffrey D. Ullman, Philip Derbeko, Shlomi Dolev","submitted_at":"2016-05-19T21:11:01Z","abstract_excerpt":"In recent years, an increasing amount of data is collected in different and often, not cooperative, databases. The problem of privacy-preserving, distributed calculations over separated databases and, a relative to it, issue of private data release were intensively investigated. However, despite a considerable progress, computational complexity, due to an increasing size of data, remains a limiting factor in real-world deployments, especially in case of privacy-preserving computations.\n  In this paper, we present a general method for trade off between performance and accuracy of distributed ca"},"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":"1605.06143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-19T21:11:01Z","cross_cats_sorted":[],"title_canon_sha256":"5dd3718754db9a516d49d31d224fdd0ea7fd59b77b69126adb5819e7ad4ed330","abstract_canon_sha256":"a113206fbcffee113a568f2e18a37c593034b3e7f4038b44da40ed4e684b6496"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:19.878978Z","signature_b64":"lfNvludFu6p0xjoArBb3s4jg4yjyvSOb8AlSl9LMjRXsMOW3WZB9uRRgwuy+0wXMLccFP+2cayQdw4/ctQ9tDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f1b62c39b3a313f09392f6d58775106a1590b2d2a3d1e00e38edda6968cbe7","last_reissued_at":"2026-05-18T01:14:19.878282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:19.878282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Private Approximations of Distributed Databases Calculations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ehud Gudes, Jeffrey D. Ullman, Philip Derbeko, Shlomi Dolev","submitted_at":"2016-05-19T21:11:01Z","abstract_excerpt":"In recent years, an increasing amount of data is collected in different and often, not cooperative, databases. The problem of privacy-preserving, distributed calculations over separated databases and, a relative to it, issue of private data release were intensively investigated. However, despite a considerable progress, computational complexity, due to an increasing size of data, remains a limiting factor in real-world deployments, especially in case of privacy-preserving computations.\n  In this paper, we present a general method for trade off between performance and accuracy of distributed ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06143","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.06143","created_at":"2026-05-18T01:14:19.878409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.06143v1","created_at":"2026-05-18T01:14:19.878409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06143","created_at":"2026-05-18T01:14:19.878409+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHY3MLBZWORR","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHY3MLBZWORRH4ET","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHY3MLBZ","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KHY3MLBZWORRH4ETSL3NLB3VCB","json":"https://pith.science/pith/KHY3MLBZWORRH4ETSL3NLB3VCB.json","graph_json":"https://pith.science/api/pith-number/KHY3MLBZWORRH4ETSL3NLB3VCB/graph.json","events_json":"https://pith.science/api/pith-number/KHY3MLBZWORRH4ETSL3NLB3VCB/events.json","paper":"https://pith.science/paper/KHY3MLBZ"},"agent_actions":{"view_html":"https://pith.science/pith/KHY3MLBZWORRH4ETSL3NLB3VCB","download_json":"https://pith.science/pith/KHY3MLBZWORRH4ETSL3NLB3VCB.json","view_paper":"https://pith.science/paper/KHY3MLBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.06143&json=true","fetch_graph":"https://pith.science/api/pith-number/KHY3MLBZWORRH4ETSL3NLB3VCB/graph.json","fetch_events":"https://pith.science/api/pith-number/KHY3MLBZWORRH4ETSL3NLB3VCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHY3MLBZWORRH4ETSL3NLB3VCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHY3MLBZWORRH4ETSL3NLB3VCB/action/storage_attestation","attest_author":"https://pith.science/pith/KHY3MLBZWORRH4ETSL3NLB3VCB/action/author_attestation","sign_citation":"https://pith.science/pith/KHY3MLBZWORRH4ETSL3NLB3VCB/action/citation_signature","submit_replication":"https://pith.science/pith/KHY3MLBZWORRH4ETSL3NLB3VCB/action/replication_record"}},"created_at":"2026-05-18T01:14:19.878409+00:00","updated_at":"2026-05-18T01:14:19.878409+00:00"}