{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VKES3GDTBG3XHDQNZ6GIQ6XEPK","short_pith_number":"pith:VKES3GDT","schema_version":"1.0","canonical_sha256":"aa892d987309b7738e0dcf8c887ae47ab650acc73308ad580c9bb64fc712a541","source":{"kind":"arxiv","id":"1903.03053","version":1},"attestation_state":"computed","paper":{"title":"A Privacy-preserving Disaggregation Algorithm for Non-intrusive Management of Flexible Energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.MA","authors_text":"Nadia Oudjane, Olivier Beaude, Pascal Benchimol, Paulin Jacquot, St\\'ephane Gaubert","submitted_at":"2019-03-07T17:17:23Z","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 optimizing a global, possibly non-convex, cost while satisfying the agents'c onstraints. We focus on the practical case of the management of energy consumption flexibilities by the operator of a microgrid. This paper provides 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 cen"},"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":"1903.03053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-07T17:17:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"80aac95c83f6fafbb68b1602d560fe9ad0d6c637a6ca428c59d63b5d4b320a17","abstract_canon_sha256":"b4b904168d9975f55242e07b0c8ca61a50bdbc32f77bc5ef64fad8a108318a1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:50.303396Z","signature_b64":"G+7ie5zZZ8Nfz0BKxKw9hsGgvYx3v0hxYDG/ntjZgtUx1SpMbDODM9HcbTVgZ5o+D82x6d/GuWgDiWt5/gqzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa892d987309b7738e0dcf8c887ae47ab650acc73308ad580c9bb64fc712a541","last_reissued_at":"2026-05-17T23:51:50.302674Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:50.302674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Privacy-preserving Disaggregation Algorithm for Non-intrusive Management of Flexible Energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.MA","authors_text":"Nadia Oudjane, Olivier Beaude, Pascal Benchimol, Paulin Jacquot, St\\'ephane Gaubert","submitted_at":"2019-03-07T17:17:23Z","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 optimizing a global, possibly non-convex, cost while satisfying the agents'c onstraints. We focus on the practical case of the management of energy consumption flexibilities by the operator of a microgrid. This paper provides 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 cen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03053","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.03053","created_at":"2026-05-17T23:51:50.302777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03053v1","created_at":"2026-05-17T23:51:50.302777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03053","created_at":"2026-05-17T23:51:50.302777+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKES3GDTBG3X","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKES3GDTBG3XHDQN","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKES3GDT","created_at":"2026-05-18T12:33:30.264802+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/VKES3GDTBG3XHDQNZ6GIQ6XEPK","json":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK.json","graph_json":"https://pith.science/api/pith-number/VKES3GDTBG3XHDQNZ6GIQ6XEPK/graph.json","events_json":"https://pith.science/api/pith-number/VKES3GDTBG3XHDQNZ6GIQ6XEPK/events.json","paper":"https://pith.science/paper/VKES3GDT"},"agent_actions":{"view_html":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK","download_json":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK.json","view_paper":"https://pith.science/paper/VKES3GDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03053&json=true","fetch_graph":"https://pith.science/api/pith-number/VKES3GDTBG3XHDQNZ6GIQ6XEPK/graph.json","fetch_events":"https://pith.science/api/pith-number/VKES3GDTBG3XHDQNZ6GIQ6XEPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/action/storage_attestation","attest_author":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/action/author_attestation","sign_citation":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/action/citation_signature","submit_replication":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/action/replication_record"}},"created_at":"2026-05-17T23:51:50.302777+00:00","updated_at":"2026-05-17T23:51:50.302777+00:00"}