{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VKES3GDTBG3XHDQNZ6GIQ6XEPK","short_pith_number":"pith:VKES3GDT","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"},"canonical_sha256":"aa892d987309b7738e0dcf8c887ae47ab650acc73308ad580c9bb64fc712a541","source":{"kind":"arxiv","id":"1903.03053","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03053","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03053v1","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03053","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"VKES3GDTBG3X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VKES3GDTBG3XHDQN","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VKES3GDT","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VKES3GDTBG3XHDQNZ6GIQ6XEPK","target":"record","payload":{"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"},"canonical_sha256":"aa892d987309b7738e0dcf8c887ae47ab650acc73308ad580c9bb64fc712a541","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"},"source_kind":"arxiv","source_id":"1903.03053","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnGbnm29F7oaek1NSD6z9HNNciD2vwAzQX4piti3Ana/c39m23n+yqwng1QHejxU0L0WX8PZIms8VlWotwNGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:46:55.683264Z"},"content_sha256":"c33694855e96db15b016a23d626272707635e3b44b8478aa2439bea06a5d8c9f","schema_version":"1.0","event_id":"sha256:c33694855e96db15b016a23d626272707635e3b44b8478aa2439bea06a5d8c9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VKES3GDTBG3XHDQNZ6GIQ6XEPK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1D+mk9K70jcDbmKCdLAQCtKNCs7smPF/OQmLPoMCKVpkR07U2jIQ8jkxiPWN1lQS6Zr098rrhTU8FiET4rwABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:46:55.683622Z"},"content_sha256":"ad4deaf6b5acd3c6e552976b1591932329d1ae2c9a0de639e1b401aadd77e960","schema_version":"1.0","event_id":"sha256:ad4deaf6b5acd3c6e552976b1591932329d1ae2c9a0de639e1b401aadd77e960"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/bundle.json","state_url":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T18:46:55Z","links":{"resolver":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK","bundle":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/bundle.json","state":"https://pith.science/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKES3GDTBG3XHDQNZ6GIQ6XEPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VKES3GDTBG3XHDQNZ6GIQ6XEPK","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b4b904168d9975f55242e07b0c8ca61a50bdbc32f77bc5ef64fad8a108318a1b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-07T17:17:23Z","title_canon_sha256":"80aac95c83f6fafbb68b1602d560fe9ad0d6c637a6ca428c59d63b5d4b320a17"},"schema_version":"1.0","source":{"id":"1903.03053","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.03053","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"arxiv_version","alias_value":"1903.03053v1","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03053","created_at":"2026-05-17T23:51:50Z"},{"alias_kind":"pith_short_12","alias_value":"VKES3GDTBG3X","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VKES3GDTBG3XHDQN","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VKES3GDT","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:ad4deaf6b5acd3c6e552976b1591932329d1ae2c9a0de639e1b401aadd77e960","target":"graph","created_at":"2026-05-17T23:51:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Nadia Oudjane, Olivier Beaude, Pascal Benchimol, Paulin Jacquot, St\\'ephane Gaubert","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-07T17:17:23Z","title":"A Privacy-preserving Disaggregation Algorithm for Non-intrusive Management of Flexible Energy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03053","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c33694855e96db15b016a23d626272707635e3b44b8478aa2439bea06a5d8c9f","target":"record","created_at":"2026-05-17T23:51:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b4b904168d9975f55242e07b0c8ca61a50bdbc32f77bc5ef64fad8a108318a1b","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-03-07T17:17:23Z","title_canon_sha256":"80aac95c83f6fafbb68b1602d560fe9ad0d6c637a6ca428c59d63b5d4b320a17"},"schema_version":"1.0","source":{"id":"1903.03053","kind":"arxiv","version":1}},"canonical_sha256":"aa892d987309b7738e0dcf8c887ae47ab650acc73308ad580c9bb64fc712a541","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa892d987309b7738e0dcf8c887ae47ab650acc73308ad580c9bb64fc712a541","first_computed_at":"2026-05-17T23:51:50.302674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:50.302674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G+7ie5zZZ8Nfz0BKxKw9hsGgvYx3v0hxYDG/ntjZgtUx1SpMbDODM9HcbTVgZ5o+D82x6d/GuWgDiWt5/gqzCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:50.303396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.03053","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c33694855e96db15b016a23d626272707635e3b44b8478aa2439bea06a5d8c9f","sha256:ad4deaf6b5acd3c6e552976b1591932329d1ae2c9a0de639e1b401aadd77e960"],"state_sha256":"917fbfc9da58cbd7249f47675d4fe275a07126e5e4c7def12c74494325b2f16a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YYdBTriocdSiMGJ1cKlN4P7nUX+a5WMQ72YUQVPj3GMfJHwJ9ziZGpvc2sfXvjux7CQLq8NiurTPs3Um8FMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:46:55.685514Z","bundle_sha256":"fdf673a73dfb8afe1cbc309f88f5c56259197d395dc794018cc9aeaa7f68d70b"}}