{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QZAN27RPPYWVBTYZF4AV4S5LJM","short_pith_number":"pith:QZAN27RP","schema_version":"1.0","canonical_sha256":"8640dd7e2f7e2d50cf192f015e4bab4b098dd11a536a9a97f5ec8332362b46e7","source":{"kind":"arxiv","id":"1710.07214","version":1},"attestation_state":"computed","paper":{"title":"On Using Linear Diophantine Equations to Tune the extent of Look Ahead while Hiding Decision Tree Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dimitris Kalles, Georgios Feretzakis, Vassilios S. Verykios","submitted_at":"2017-10-18T04:12:59Z","abstract_excerpt":"This paper focuses on preserving the privacy of sensitive pat-terns when inducing decision trees. We adopt a record aug-mentation approach for hiding sensitive classification rules in binary datasets. Such a hiding methodology is preferred over other heuristic solutions like output perturbation or crypto-graphic techniques - which restrict the usability of the data - since the raw data itself is readily available for public use. In this paper, we propose a look ahead approach using linear Diophantine equations in order to add the appropriate number of instances while minimally disturbing the i"},"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":"1710.07214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-18T04:12:59Z","cross_cats_sorted":[],"title_canon_sha256":"84dce4a2dfdb1c05e77832effdfcdaa3a7e0856ab806bd20601d12d1da7425a7","abstract_canon_sha256":"c3a82619f360d7579214fbbe63fe1b44114c5a28c8c7bc303eb2a2cdc7fc09a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:26.568711Z","signature_b64":"A54EfGu0LSoiFGG2dZpWNfbu2/NgGCS5Vwfc8TRqSRFvuswMb6ofpAUTax/zCId4+zR24GEeWocqlXEW77x6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8640dd7e2f7e2d50cf192f015e4bab4b098dd11a536a9a97f5ec8332362b46e7","last_reissued_at":"2026-05-18T00:32:26.567981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:26.567981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Using Linear Diophantine Equations to Tune the extent of Look Ahead while Hiding Decision Tree Rules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dimitris Kalles, Georgios Feretzakis, Vassilios S. Verykios","submitted_at":"2017-10-18T04:12:59Z","abstract_excerpt":"This paper focuses on preserving the privacy of sensitive pat-terns when inducing decision trees. We adopt a record aug-mentation approach for hiding sensitive classification rules in binary datasets. Such a hiding methodology is preferred over other heuristic solutions like output perturbation or crypto-graphic techniques - which restrict the usability of the data - since the raw data itself is readily available for public use. In this paper, we propose a look ahead approach using linear Diophantine equations in order to add the appropriate number of instances while minimally disturbing the i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07214","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":"1710.07214","created_at":"2026-05-18T00:32:26.568092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07214v1","created_at":"2026-05-18T00:32:26.568092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07214","created_at":"2026-05-18T00:32:26.568092+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZAN27RPPYWV","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZAN27RPPYWVBTYZ","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZAN27RP","created_at":"2026-05-18T12:31:39.905425+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/QZAN27RPPYWVBTYZF4AV4S5LJM","json":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM.json","graph_json":"https://pith.science/api/pith-number/QZAN27RPPYWVBTYZF4AV4S5LJM/graph.json","events_json":"https://pith.science/api/pith-number/QZAN27RPPYWVBTYZF4AV4S5LJM/events.json","paper":"https://pith.science/paper/QZAN27RP"},"agent_actions":{"view_html":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM","download_json":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM.json","view_paper":"https://pith.science/paper/QZAN27RP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07214&json=true","fetch_graph":"https://pith.science/api/pith-number/QZAN27RPPYWVBTYZF4AV4S5LJM/graph.json","fetch_events":"https://pith.science/api/pith-number/QZAN27RPPYWVBTYZF4AV4S5LJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/action/storage_attestation","attest_author":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/action/author_attestation","sign_citation":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/action/citation_signature","submit_replication":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/action/replication_record"}},"created_at":"2026-05-18T00:32:26.568092+00:00","updated_at":"2026-05-18T00:32:26.568092+00:00"}