{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QZAN27RPPYWVBTYZF4AV4S5LJM","short_pith_number":"pith:QZAN27RP","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"},"canonical_sha256":"8640dd7e2f7e2d50cf192f015e4bab4b098dd11a536a9a97f5ec8332362b46e7","source":{"kind":"arxiv","id":"1710.07214","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07214","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07214v1","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07214","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"pith_short_12","alias_value":"QZAN27RPPYWV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZAN27RPPYWVBTYZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZAN27RP","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QZAN27RPPYWVBTYZF4AV4S5LJM","target":"record","payload":{"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"},"canonical_sha256":"8640dd7e2f7e2d50cf192f015e4bab4b098dd11a536a9a97f5ec8332362b46e7","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"},"source_kind":"arxiv","source_id":"1710.07214","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:32:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifPRjOxlp4TgLbRx5eRGibxi8rfLbWICElJgLSdqKZsVqqAyTqAyxyn0hKZlWTXa5QI4bc6lREmRlkXI5/EZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:52:28.438886Z"},"content_sha256":"2274a7e1c26390e91443c001e216efc1b0005bfa32eaf4460998db6f8643e844","schema_version":"1.0","event_id":"sha256:2274a7e1c26390e91443c001e216efc1b0005bfa32eaf4460998db6f8643e844"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QZAN27RPPYWVBTYZF4AV4S5LJM","target":"graph","payload":{"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"},"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:32:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eyJbxQVkHWfg0j0vXhE/9iRjncZHL74mRPu5WAu5dySV1aiiz9sJFgpwMAi7nQBeHmyf73ZpmdaZGX3O8nnkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:52:28.439229Z"},"content_sha256":"c34b182fdfc3c977de76a613a43eca81539432a412ebd91d18fb75fd74d792b9","schema_version":"1.0","event_id":"sha256:c34b182fdfc3c977de76a613a43eca81539432a412ebd91d18fb75fd74d792b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/bundle.json","state_url":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/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-09T14:52:28Z","links":{"resolver":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM","bundle":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/bundle.json","state":"https://pith.science/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QZAN27RPPYWVBTYZF4AV4S5LJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QZAN27RPPYWVBTYZF4AV4S5LJM","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":"c3a82619f360d7579214fbbe63fe1b44114c5a28c8c7bc303eb2a2cdc7fc09a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-18T04:12:59Z","title_canon_sha256":"84dce4a2dfdb1c05e77832effdfcdaa3a7e0856ab806bd20601d12d1da7425a7"},"schema_version":"1.0","source":{"id":"1710.07214","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07214","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07214v1","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07214","created_at":"2026-05-18T00:32:26Z"},{"alias_kind":"pith_short_12","alias_value":"QZAN27RPPYWV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QZAN27RPPYWVBTYZ","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QZAN27RP","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:c34b182fdfc3c977de76a613a43eca81539432a412ebd91d18fb75fd74d792b9","target":"graph","created_at":"2026-05-18T00:32:26Z","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":"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","authors_text":"Dimitris Kalles, Georgios Feretzakis, Vassilios S. Verykios","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-18T04:12:59Z","title":"On Using Linear Diophantine Equations to Tune the extent of Look Ahead while Hiding Decision Tree Rules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07214","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:2274a7e1c26390e91443c001e216efc1b0005bfa32eaf4460998db6f8643e844","target":"record","created_at":"2026-05-18T00:32:26Z","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":"c3a82619f360d7579214fbbe63fe1b44114c5a28c8c7bc303eb2a2cdc7fc09a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-10-18T04:12:59Z","title_canon_sha256":"84dce4a2dfdb1c05e77832effdfcdaa3a7e0856ab806bd20601d12d1da7425a7"},"schema_version":"1.0","source":{"id":"1710.07214","kind":"arxiv","version":1}},"canonical_sha256":"8640dd7e2f7e2d50cf192f015e4bab4b098dd11a536a9a97f5ec8332362b46e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8640dd7e2f7e2d50cf192f015e4bab4b098dd11a536a9a97f5ec8332362b46e7","first_computed_at":"2026-05-18T00:32:26.567981Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:26.567981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A54EfGu0LSoiFGG2dZpWNfbu2/NgGCS5Vwfc8TRqSRFvuswMb6ofpAUTax/zCId4+zR24GEeWocqlXEW77x6Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:26.568711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07214","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2274a7e1c26390e91443c001e216efc1b0005bfa32eaf4460998db6f8643e844","sha256:c34b182fdfc3c977de76a613a43eca81539432a412ebd91d18fb75fd74d792b9"],"state_sha256":"bde3e12e413376fb387ab5c2826450af10761550e4bb758eab4e981f6818c854"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZ3gOCuUZAeKRLAplct4XNXXnSz7JzrtnWqzjbkERzmo5Eyu0oZc+tTBj7LVRRdRKNjZdzS94fyFg1qFKU3EAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:52:28.441153Z","bundle_sha256":"249d8f78527797d17f0b544dcdb8bcbce5e2916b88ddd009a13f334fcd768c6d"}}