{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GLEXVHUML23SS6NWLKTT6HFS7Q","short_pith_number":"pith:GLEXVHUM","schema_version":"1.0","canonical_sha256":"32c97a9e8c5eb72979b65aa73f1cb2fc165f4476e3db0250c442263cb5d7fae3","source":{"kind":"arxiv","id":"2309.01559","version":1},"attestation_state":"computed","paper":{"title":"Homomorphically encrypted gradient descent algorithms for quadratic programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.CR","authors_text":"Andr\\'e Bertolace, Konstantinos Gatsis, Kostas Margellos","submitted_at":"2023-09-04T12:25:14Z","abstract_excerpt":"In this paper, we evaluate the different fully homomorphic encryption schemes, propose an implementation, and numerically analyze the applicability of gradient descent algorithms to solve quadratic programming in a homomorphic encryption setup. The limit on the multiplication depth of homomorphic encryption circuits is a major challenge for iterative procedures such as gradient descent algorithms. Our analysis not only quantifies these limitations on prototype examples, thus serving as a benchmark for future investigations, but also highlights additional trade-offs like the ones pertaining the"},"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":"2309.01559","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-09-04T12:25:14Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"2e6fe270716e853c717dc801d93aa2a1b997e00a3c17b44f0c0b47f78fc22feb","abstract_canon_sha256":"bfa21bf96c74d112ac85fd5f3d894217fc3bb55b759b1227d78691a1d51bba77"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:47:39.694752Z","signature_b64":"XlXyg/eLQGWXADD2s18KTLiBgZqyVq4kUBu8gWDTIhww3tmMwRvm+6ufVJLh1/bPxomq07kdRJoKrQW3JhhGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32c97a9e8c5eb72979b65aa73f1cb2fc165f4476e3db0250c442263cb5d7fae3","last_reissued_at":"2026-07-05T06:47:39.694288Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:47:39.694288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homomorphically encrypted gradient descent algorithms for quadratic programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.CR","authors_text":"Andr\\'e Bertolace, Konstantinos Gatsis, Kostas Margellos","submitted_at":"2023-09-04T12:25:14Z","abstract_excerpt":"In this paper, we evaluate the different fully homomorphic encryption schemes, propose an implementation, and numerically analyze the applicability of gradient descent algorithms to solve quadratic programming in a homomorphic encryption setup. The limit on the multiplication depth of homomorphic encryption circuits is a major challenge for iterative procedures such as gradient descent algorithms. Our analysis not only quantifies these limitations on prototype examples, thus serving as a benchmark for future investigations, but also highlights additional trade-offs like the ones pertaining the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.01559","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/2309.01559/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":"2309.01559","created_at":"2026-07-05T06:47:39.694375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.01559v1","created_at":"2026-07-05T06:47:39.694375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.01559","created_at":"2026-07-05T06:47:39.694375+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLEXVHUML23S","created_at":"2026-07-05T06:47:39.694375+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLEXVHUML23SS6NW","created_at":"2026-07-05T06:47:39.694375+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLEXVHUM","created_at":"2026-07-05T06:47:39.694375+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/GLEXVHUML23SS6NWLKTT6HFS7Q","json":"https://pith.science/pith/GLEXVHUML23SS6NWLKTT6HFS7Q.json","graph_json":"https://pith.science/api/pith-number/GLEXVHUML23SS6NWLKTT6HFS7Q/graph.json","events_json":"https://pith.science/api/pith-number/GLEXVHUML23SS6NWLKTT6HFS7Q/events.json","paper":"https://pith.science/paper/GLEXVHUM"},"agent_actions":{"view_html":"https://pith.science/pith/GLEXVHUML23SS6NWLKTT6HFS7Q","download_json":"https://pith.science/pith/GLEXVHUML23SS6NWLKTT6HFS7Q.json","view_paper":"https://pith.science/paper/GLEXVHUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.01559&json=true","fetch_graph":"https://pith.science/api/pith-number/GLEXVHUML23SS6NWLKTT6HFS7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/GLEXVHUML23SS6NWLKTT6HFS7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLEXVHUML23SS6NWLKTT6HFS7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLEXVHUML23SS6NWLKTT6HFS7Q/action/storage_attestation","attest_author":"https://pith.science/pith/GLEXVHUML23SS6NWLKTT6HFS7Q/action/author_attestation","sign_citation":"https://pith.science/pith/GLEXVHUML23SS6NWLKTT6HFS7Q/action/citation_signature","submit_replication":"https://pith.science/pith/GLEXVHUML23SS6NWLKTT6HFS7Q/action/replication_record"}},"created_at":"2026-07-05T06:47:39.694375+00:00","updated_at":"2026-07-05T06:47:39.694375+00:00"}