{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZR6ECMPV54V4KPMBF4ZJXCRL34","short_pith_number":"pith:ZR6ECMPV","schema_version":"1.0","canonical_sha256":"cc7c4131f5ef2bc53d812f329b8a2bdf330425363d1aff66992dd39e0af8ba62","source":{"kind":"arxiv","id":"2506.11954","version":1},"attestation_state":"computed","paper":{"title":"Technical Evaluation of a Disruptive Approach in Homomorphic AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"Eric Filiol","submitted_at":"2025-06-13T17:06:34Z","abstract_excerpt":"We present a technical evaluation of a new, disruptive cryptographic approach to data security, known as HbHAI (Hash-based Homomorphic Artificial Intelligence). HbHAI is based on a novel class of key-dependent hash functions that naturally preserve most similarity properties, most AI algorithms rely on. As a main claim, HbHAI makes now possible to analyze and process data in its cryptographically secure form while using existing native AI algorithms without modification, with unprecedented performances compared to existing homomorphic encryption schemes.\n  We tested various HbHAI-protected dat"},"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":"2506.11954","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CR","submitted_at":"2025-06-13T17:06:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a14fa60f22ec9b34df9c65e0aa23e18e0a8fb1965307853d1d3043ca078659c5","abstract_canon_sha256":"5122aad5812e0ed450ff1fdf6db6bcb85a3b0ae8f0fc795ad1aeffbf70ef080c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:21:13.410296Z","signature_b64":"uTFszQna/Hh537tMtCZcpmQKCzjrXpq1nRyH8jHVI9TrE0jq55pf9qn1gd34f2QwrWGrJ8qDSX7Xk8mtRAW2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc7c4131f5ef2bc53d812f329b8a2bdf330425363d1aff66992dd39e0af8ba62","last_reissued_at":"2026-07-05T11:21:13.409871Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:21:13.409871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Technical Evaluation of a Disruptive Approach in Homomorphic AI","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CR","authors_text":"Eric Filiol","submitted_at":"2025-06-13T17:06:34Z","abstract_excerpt":"We present a technical evaluation of a new, disruptive cryptographic approach to data security, known as HbHAI (Hash-based Homomorphic Artificial Intelligence). HbHAI is based on a novel class of key-dependent hash functions that naturally preserve most similarity properties, most AI algorithms rely on. As a main claim, HbHAI makes now possible to analyze and process data in its cryptographically secure form while using existing native AI algorithms without modification, with unprecedented performances compared to existing homomorphic encryption schemes.\n  We tested various HbHAI-protected dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.11954","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.11954/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":"2506.11954","created_at":"2026-07-05T11:21:13.409928+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.11954v1","created_at":"2026-07-05T11:21:13.409928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.11954","created_at":"2026-07-05T11:21:13.409928+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZR6ECMPV54V4","created_at":"2026-07-05T11:21:13.409928+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZR6ECMPV54V4KPMB","created_at":"2026-07-05T11:21:13.409928+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZR6ECMPV","created_at":"2026-07-05T11:21:13.409928+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28994","citing_title":"Arbitrary Reduction of Validation Error for AI Decision Tests using Homomorphic AI and Repetition Codes","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZR6ECMPV54V4KPMBF4ZJXCRL34","json":"https://pith.science/pith/ZR6ECMPV54V4KPMBF4ZJXCRL34.json","graph_json":"https://pith.science/api/pith-number/ZR6ECMPV54V4KPMBF4ZJXCRL34/graph.json","events_json":"https://pith.science/api/pith-number/ZR6ECMPV54V4KPMBF4ZJXCRL34/events.json","paper":"https://pith.science/paper/ZR6ECMPV"},"agent_actions":{"view_html":"https://pith.science/pith/ZR6ECMPV54V4KPMBF4ZJXCRL34","download_json":"https://pith.science/pith/ZR6ECMPV54V4KPMBF4ZJXCRL34.json","view_paper":"https://pith.science/paper/ZR6ECMPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.11954&json=true","fetch_graph":"https://pith.science/api/pith-number/ZR6ECMPV54V4KPMBF4ZJXCRL34/graph.json","fetch_events":"https://pith.science/api/pith-number/ZR6ECMPV54V4KPMBF4ZJXCRL34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZR6ECMPV54V4KPMBF4ZJXCRL34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZR6ECMPV54V4KPMBF4ZJXCRL34/action/storage_attestation","attest_author":"https://pith.science/pith/ZR6ECMPV54V4KPMBF4ZJXCRL34/action/author_attestation","sign_citation":"https://pith.science/pith/ZR6ECMPV54V4KPMBF4ZJXCRL34/action/citation_signature","submit_replication":"https://pith.science/pith/ZR6ECMPV54V4KPMBF4ZJXCRL34/action/replication_record"}},"created_at":"2026-07-05T11:21:13.409928+00:00","updated_at":"2026-07-05T11:21:13.409928+00:00"}