{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MYD52NAIHVGVPCEDS7VWKX6UPD","short_pith_number":"pith:MYD52NAI","schema_version":"1.0","canonical_sha256":"6607dd34083d4d57888397eb655fd478e18df1a5bd0cb758a348fbf919e70f37","source":{"kind":"arxiv","id":"1801.05974","version":1},"attestation_state":"computed","paper":{"title":"Privacy-preserving Data Splitting: A Combinatorial Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jordi Ribes-Gonz\\'alez, Oriol Farr\\`as, Sara Ricci","submitted_at":"2018-01-18T12:05:13Z","abstract_excerpt":"Privacy-preserving data splitting is a technique that aims to protect data privacy by storing different fragments of data in different locations. In this work we give a new combinatorial formulation to the data splitting problem. We see the data splitting problem as a purely combinatorial problem, in which we have to split data attributes into different fragments in a way that satisfies certain combinatorial properties derived from processing and privacy constraints. Using this formulation, we develop new combinatorial and algebraic techniques to obtain solutions to the data splitting problem."},"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":"1801.05974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-01-18T12:05:13Z","cross_cats_sorted":[],"title_canon_sha256":"ad7f3edad95e9bd650d5bc9e74a32e6e385ed3c4387c8fac91772e16ad89a26f","abstract_canon_sha256":"4e3d3ffe917799815589b33600a8c1d2780c962d653a5a9f2700708901b00d3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:35.943707Z","signature_b64":"FssJi/Mj9KHQz77KF1cQpuZ+xmanZeenLzbzP2ebKy0yAZHg7oNi41e6w74B4i1kcUyk2g9UvfYwaKssLcGfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6607dd34083d4d57888397eb655fd478e18df1a5bd0cb758a348fbf919e70f37","last_reissued_at":"2026-05-18T00:25:35.942995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:35.942995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-preserving Data Splitting: A Combinatorial Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Jordi Ribes-Gonz\\'alez, Oriol Farr\\`as, Sara Ricci","submitted_at":"2018-01-18T12:05:13Z","abstract_excerpt":"Privacy-preserving data splitting is a technique that aims to protect data privacy by storing different fragments of data in different locations. In this work we give a new combinatorial formulation to the data splitting problem. We see the data splitting problem as a purely combinatorial problem, in which we have to split data attributes into different fragments in a way that satisfies certain combinatorial properties derived from processing and privacy constraints. Using this formulation, we develop new combinatorial and algebraic techniques to obtain solutions to the data splitting problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05974","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":"1801.05974","created_at":"2026-05-18T00:25:35.943104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05974v1","created_at":"2026-05-18T00:25:35.943104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05974","created_at":"2026-05-18T00:25:35.943104+00:00"},{"alias_kind":"pith_short_12","alias_value":"MYD52NAIHVGV","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MYD52NAIHVGVPCED","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MYD52NAI","created_at":"2026-05-18T12:32:40.477152+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/MYD52NAIHVGVPCEDS7VWKX6UPD","json":"https://pith.science/pith/MYD52NAIHVGVPCEDS7VWKX6UPD.json","graph_json":"https://pith.science/api/pith-number/MYD52NAIHVGVPCEDS7VWKX6UPD/graph.json","events_json":"https://pith.science/api/pith-number/MYD52NAIHVGVPCEDS7VWKX6UPD/events.json","paper":"https://pith.science/paper/MYD52NAI"},"agent_actions":{"view_html":"https://pith.science/pith/MYD52NAIHVGVPCEDS7VWKX6UPD","download_json":"https://pith.science/pith/MYD52NAIHVGVPCEDS7VWKX6UPD.json","view_paper":"https://pith.science/paper/MYD52NAI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05974&json=true","fetch_graph":"https://pith.science/api/pith-number/MYD52NAIHVGVPCEDS7VWKX6UPD/graph.json","fetch_events":"https://pith.science/api/pith-number/MYD52NAIHVGVPCEDS7VWKX6UPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MYD52NAIHVGVPCEDS7VWKX6UPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MYD52NAIHVGVPCEDS7VWKX6UPD/action/storage_attestation","attest_author":"https://pith.science/pith/MYD52NAIHVGVPCEDS7VWKX6UPD/action/author_attestation","sign_citation":"https://pith.science/pith/MYD52NAIHVGVPCEDS7VWKX6UPD/action/citation_signature","submit_replication":"https://pith.science/pith/MYD52NAIHVGVPCEDS7VWKX6UPD/action/replication_record"}},"created_at":"2026-05-18T00:25:35.943104+00:00","updated_at":"2026-05-18T00:25:35.943104+00:00"}