{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CHZITGV2NHEHLXNRDL7VGTO4KG","short_pith_number":"pith:CHZITGV2","schema_version":"1.0","canonical_sha256":"11f2899aba69c875ddb11aff534ddc51804b7bf0be16ac42c0cbcf885061a3ec","source":{"kind":"arxiv","id":"1908.03080","version":3},"attestation_state":"computed","paper":{"title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.MA"],"primary_cat":"math.OC","authors_text":"Nadia Oudjane, Olivier Beaude, Pascal Benchimol, Paulin Jacquot, St\\'ephane Gaubert","submitted_at":"2019-08-07T07:09:41Z","abstract_excerpt":"We consider a resource allocation problem involving a large number of agents with individual constraints subject to privacy, and a central operator whose objective is to optimize a global, possibly nonconvex, cost while satisfying the agents' constraints, for instance an energy operator in charge of the management of energy consumption flexibilities of many individual consumers. We provide a privacy-preserving algorithm that does compute the optimal allocation of resources, avoiding each agent to reveal her private information (constraints and individual solution profile) neither to the centra"},"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":"1908.03080","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-07T07:09:41Z","cross_cats_sorted":["cs.CR","cs.MA"],"title_canon_sha256":"447f929dd235a20d6186c394af806b6f7ceef9596d198b9d190c8563c94a4074","abstract_canon_sha256":"f9729bc1689af1b9e5b9927a2869621c9368be606bdc18a5e0606059e8309592"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:12:01.882619Z","signature_b64":"k/6yKgPQzySSmyjpd2C2AOxq4Pqxhew1Kk7wAXhvqEZcl4sZf7gxA1ECLPzjK/Pf4yBtS4tFmRYt9UUXYm9eBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11f2899aba69c875ddb11aff534ddc51804b7bf0be16ac42c0cbcf885061a3ec","last_reissued_at":"2026-07-05T01:12:01.882180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:12:01.882180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.MA"],"primary_cat":"math.OC","authors_text":"Nadia Oudjane, Olivier Beaude, Pascal Benchimol, Paulin Jacquot, St\\'ephane Gaubert","submitted_at":"2019-08-07T07:09:41Z","abstract_excerpt":"We consider a resource allocation problem involving a large number of agents with individual constraints subject to privacy, and a central operator whose objective is to optimize a global, possibly nonconvex, cost while satisfying the agents' constraints, for instance an energy operator in charge of the management of energy consumption flexibilities of many individual consumers. We provide a privacy-preserving algorithm that does compute the optimal allocation of resources, avoiding each agent to reveal her private information (constraints and individual solution profile) neither to the centra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03080","kind":"arxiv","version":3},"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/1908.03080/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":"1908.03080","created_at":"2026-07-05T01:12:01.882229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03080v3","created_at":"2026-07-05T01:12:01.882229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03080","created_at":"2026-07-05T01:12:01.882229+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHZITGV2NHEH","created_at":"2026-07-05T01:12:01.882229+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHZITGV2NHEHLXNR","created_at":"2026-07-05T01:12:01.882229+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHZITGV2","created_at":"2026-07-05T01:12:01.882229+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/CHZITGV2NHEHLXNRDL7VGTO4KG","json":"https://pith.science/pith/CHZITGV2NHEHLXNRDL7VGTO4KG.json","graph_json":"https://pith.science/api/pith-number/CHZITGV2NHEHLXNRDL7VGTO4KG/graph.json","events_json":"https://pith.science/api/pith-number/CHZITGV2NHEHLXNRDL7VGTO4KG/events.json","paper":"https://pith.science/paper/CHZITGV2"},"agent_actions":{"view_html":"https://pith.science/pith/CHZITGV2NHEHLXNRDL7VGTO4KG","download_json":"https://pith.science/pith/CHZITGV2NHEHLXNRDL7VGTO4KG.json","view_paper":"https://pith.science/paper/CHZITGV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03080&json=true","fetch_graph":"https://pith.science/api/pith-number/CHZITGV2NHEHLXNRDL7VGTO4KG/graph.json","fetch_events":"https://pith.science/api/pith-number/CHZITGV2NHEHLXNRDL7VGTO4KG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHZITGV2NHEHLXNRDL7VGTO4KG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHZITGV2NHEHLXNRDL7VGTO4KG/action/storage_attestation","attest_author":"https://pith.science/pith/CHZITGV2NHEHLXNRDL7VGTO4KG/action/author_attestation","sign_citation":"https://pith.science/pith/CHZITGV2NHEHLXNRDL7VGTO4KG/action/citation_signature","submit_replication":"https://pith.science/pith/CHZITGV2NHEHLXNRDL7VGTO4KG/action/replication_record"}},"created_at":"2026-07-05T01:12:01.882229+00:00","updated_at":"2026-07-05T01:12:01.882229+00:00"}