{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:H6NNXXTBALHM7KF4XBEE6OQSHR","short_pith_number":"pith:H6NNXXTB","schema_version":"1.0","canonical_sha256":"3f9adbde6102cecfa8bcb8484f3a123c56d113b761c30c13f8c985cc3fc582d9","source":{"kind":"arxiv","id":"2605.20944","version":1},"attestation_state":"computed","paper":{"title":"Privacy-Preserving Distributed Optimization Under Time Constraints Using Secure Multi-Party Computation and Evolutionary Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.NE","authors_text":"Christoph G. Schuetz, Florian Wohner, Sebastian Gruber, Thomas Lor\\\"unser, Tobias Harzfeld","submitted_at":"2026-05-20T09:29:50Z","abstract_excerpt":"In distributed optimization, multiple parties collaborate to find an optimal solution to a problem. Privacy-preserving distributed optimization uses techniques, such as secure multi-party computation (MPC), to protect the private inputs of each party. In time-critical settings, the runtime overhead introduced by privacy-preserving computations may prevent the optimization from finishing within the deadline. This paper presents an approach for privacy-preserving distributed optimization in time-critical settings that combines evolutionary algorithms for solution search and MPC for the evaluatio"},"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":"2605.20944","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NE","submitted_at":"2026-05-20T09:29:50Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"3d632ac772b3aeda465cad76389d34a7a1ddc2a995bb2c3ab31fb596cd5487ff","abstract_canon_sha256":"35ae76c5d4b06ad025383a59215486caaba2e4bc9a8e4df82ce7425e6a6598b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:29.229734Z","signature_b64":"7rwpjp9RIg0fHeXEg3n88VyPTqiOu/+WRMa+E8FRa3l4ra0KSjbx6C6IlM3h39RHiCKbyA+Pnp/KdXOahjrnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f9adbde6102cecfa8bcb8484f3a123c56d113b761c30c13f8c985cc3fc582d9","last_reissued_at":"2026-05-21T01:05:29.229060Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:29.229060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy-Preserving Distributed Optimization Under Time Constraints Using Secure Multi-Party Computation and Evolutionary Algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.NE","authors_text":"Christoph G. Schuetz, Florian Wohner, Sebastian Gruber, Thomas Lor\\\"unser, Tobias Harzfeld","submitted_at":"2026-05-20T09:29:50Z","abstract_excerpt":"In distributed optimization, multiple parties collaborate to find an optimal solution to a problem. Privacy-preserving distributed optimization uses techniques, such as secure multi-party computation (MPC), to protect the private inputs of each party. In time-critical settings, the runtime overhead introduced by privacy-preserving computations may prevent the optimization from finishing within the deadline. This paper presents an approach for privacy-preserving distributed optimization in time-critical settings that combines evolutionary algorithms for solution search and MPC for the evaluatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20944","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/2605.20944/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":"2605.20944","created_at":"2026-05-21T01:05:29.229172+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20944v1","created_at":"2026-05-21T01:05:29.229172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20944","created_at":"2026-05-21T01:05:29.229172+00:00"},{"alias_kind":"pith_short_12","alias_value":"H6NNXXTBALHM","created_at":"2026-05-21T01:05:29.229172+00:00"},{"alias_kind":"pith_short_16","alias_value":"H6NNXXTBALHM7KF4","created_at":"2026-05-21T01:05:29.229172+00:00"},{"alias_kind":"pith_short_8","alias_value":"H6NNXXTB","created_at":"2026-05-21T01:05:29.229172+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/H6NNXXTBALHM7KF4XBEE6OQSHR","json":"https://pith.science/pith/H6NNXXTBALHM7KF4XBEE6OQSHR.json","graph_json":"https://pith.science/api/pith-number/H6NNXXTBALHM7KF4XBEE6OQSHR/graph.json","events_json":"https://pith.science/api/pith-number/H6NNXXTBALHM7KF4XBEE6OQSHR/events.json","paper":"https://pith.science/paper/H6NNXXTB"},"agent_actions":{"view_html":"https://pith.science/pith/H6NNXXTBALHM7KF4XBEE6OQSHR","download_json":"https://pith.science/pith/H6NNXXTBALHM7KF4XBEE6OQSHR.json","view_paper":"https://pith.science/paper/H6NNXXTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20944&json=true","fetch_graph":"https://pith.science/api/pith-number/H6NNXXTBALHM7KF4XBEE6OQSHR/graph.json","fetch_events":"https://pith.science/api/pith-number/H6NNXXTBALHM7KF4XBEE6OQSHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H6NNXXTBALHM7KF4XBEE6OQSHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H6NNXXTBALHM7KF4XBEE6OQSHR/action/storage_attestation","attest_author":"https://pith.science/pith/H6NNXXTBALHM7KF4XBEE6OQSHR/action/author_attestation","sign_citation":"https://pith.science/pith/H6NNXXTBALHM7KF4XBEE6OQSHR/action/citation_signature","submit_replication":"https://pith.science/pith/H6NNXXTBALHM7KF4XBEE6OQSHR/action/replication_record"}},"created_at":"2026-05-21T01:05:29.229172+00:00","updated_at":"2026-05-21T01:05:29.229172+00:00"}