{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7AOW7EFIIVQYQUENFBKC473VUH","short_pith_number":"pith:7AOW7EFI","canonical_record":{"source":{"id":"1411.4105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-15T02:33:50Z","cross_cats_sorted":["cs.DS","cs.SY"],"title_canon_sha256":"16d9a80a05010abeef94049ef2e5f3669599c767bff57fd73ff9a9407f6c4a60","abstract_canon_sha256":"9a8eb8ab08a9443346629d3a8fac107dd9685dfc9adc4a1cd9db53006c721619"},"schema_version":"1.0"},"canonical_sha256":"f81d6f90a8456188508d28542e7f75a1ff73d12c292e61af90e0cfde9d0fe635","source":{"kind":"arxiv","id":"1411.4105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4105","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4105v1","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4105","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"7AOW7EFIIVQY","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7AOW7EFIIVQYQUEN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7AOW7EFI","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7AOW7EFIIVQYQUENFBKC473VUH","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-15T02:33:50Z","cross_cats_sorted":["cs.DS","cs.SY"],"title_canon_sha256":"16d9a80a05010abeef94049ef2e5f3669599c767bff57fd73ff9a9407f6c4a60","abstract_canon_sha256":"9a8eb8ab08a9443346629d3a8fac107dd9685dfc9adc4a1cd9db53006c721619"},"schema_version":"1.0"},"canonical_sha256":"f81d6f90a8456188508d28542e7f75a1ff73d12c292e61af90e0cfde9d0fe635","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:36.460438Z","signature_b64":"2MRV37aQzHEYbglw+3KSqXiUWInZeqiuf8aQ5qEhqLDDK9eECssfsShN6b/40RGmhtePGAswJk1Q0csfDaVCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f81d6f90a8456188508d28542e7f75a1ff73d12c292e61af90e0cfde9d0fe635","last_reissued_at":"2026-05-18T00:58:36.459893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:36.459893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4105","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-18T00:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhSshePe6kL1FWjQpovxrHeArMX443L+6GPy/lR2mPx4YKH9mWrw+k1+fyx9Pj5gV7SF5DsqGSvAOsjOYP5EDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:10:38.728114Z"},"content_sha256":"86b4131c5117b05d61c56c955666b3b1c9457cc2730bebe103fb16a26183f87c","schema_version":"1.0","event_id":"sha256:86b4131c5117b05d61c56c955666b3b1c9457cc2730bebe103fb16a26183f87c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7AOW7EFIIVQYQUENFBKC473VUH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Differentially Private Distributed Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SY"],"primary_cat":"math.OC","authors_text":"George J. Pappas, Shuo Han, Ufuk Topcu","submitted_at":"2014-11-15T02:33:50Z","abstract_excerpt":"Many resource allocation problems can be formulated as an optimization problem whose constraints contain sensitive information about participating users. This paper concerns solving this kind of optimization problem in a distributed manner while protecting the privacy of user information. Without privacy considerations, existing distributed algorithms normally consist in a central entity computing and broadcasting certain public coordination signals to participating users. However, the coordination signals often depend on user information, so that an adversary who has access to the coordinatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4105","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-18T00:58:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2qQ3YNSRPIvw3IAOPyvp9+f68WHuazrYB3zr+mHXcV9sy/LdzOETmVc9Wtj2pZoeJRXTtNLTVcFH9mixdn8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:10:38.728476Z"},"content_sha256":"019ac0efecb81660715adf396dcdba904182cf748ed67cae5168095774fadabb","schema_version":"1.0","event_id":"sha256:019ac0efecb81660715adf396dcdba904182cf748ed67cae5168095774fadabb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AOW7EFIIVQYQUENFBKC473VUH/bundle.json","state_url":"https://pith.science/pith/7AOW7EFIIVQYQUENFBKC473VUH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AOW7EFIIVQYQUENFBKC473VUH/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-05T09:10:38Z","links":{"resolver":"https://pith.science/pith/7AOW7EFIIVQYQUENFBKC473VUH","bundle":"https://pith.science/pith/7AOW7EFIIVQYQUENFBKC473VUH/bundle.json","state":"https://pith.science/pith/7AOW7EFIIVQYQUENFBKC473VUH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AOW7EFIIVQYQUENFBKC473VUH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7AOW7EFIIVQYQUENFBKC473VUH","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":"9a8eb8ab08a9443346629d3a8fac107dd9685dfc9adc4a1cd9db53006c721619","cross_cats_sorted":["cs.DS","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-15T02:33:50Z","title_canon_sha256":"16d9a80a05010abeef94049ef2e5f3669599c767bff57fd73ff9a9407f6c4a60"},"schema_version":"1.0","source":{"id":"1411.4105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4105","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4105v1","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4105","created_at":"2026-05-18T00:58:36Z"},{"alias_kind":"pith_short_12","alias_value":"7AOW7EFIIVQY","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7AOW7EFIIVQYQUEN","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7AOW7EFI","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:019ac0efecb81660715adf396dcdba904182cf748ed67cae5168095774fadabb","target":"graph","created_at":"2026-05-18T00:58:36Z","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":"Many resource allocation problems can be formulated as an optimization problem whose constraints contain sensitive information about participating users. This paper concerns solving this kind of optimization problem in a distributed manner while protecting the privacy of user information. Without privacy considerations, existing distributed algorithms normally consist in a central entity computing and broadcasting certain public coordination signals to participating users. However, the coordination signals often depend on user information, so that an adversary who has access to the coordinatio","authors_text":"George J. Pappas, Shuo Han, Ufuk Topcu","cross_cats":["cs.DS","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-15T02:33:50Z","title":"Differentially Private Distributed Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4105","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:86b4131c5117b05d61c56c955666b3b1c9457cc2730bebe103fb16a26183f87c","target":"record","created_at":"2026-05-18T00:58:36Z","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":"9a8eb8ab08a9443346629d3a8fac107dd9685dfc9adc4a1cd9db53006c721619","cross_cats_sorted":["cs.DS","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-11-15T02:33:50Z","title_canon_sha256":"16d9a80a05010abeef94049ef2e5f3669599c767bff57fd73ff9a9407f6c4a60"},"schema_version":"1.0","source":{"id":"1411.4105","kind":"arxiv","version":1}},"canonical_sha256":"f81d6f90a8456188508d28542e7f75a1ff73d12c292e61af90e0cfde9d0fe635","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f81d6f90a8456188508d28542e7f75a1ff73d12c292e61af90e0cfde9d0fe635","first_computed_at":"2026-05-18T00:58:36.459893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:36.459893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2MRV37aQzHEYbglw+3KSqXiUWInZeqiuf8aQ5qEhqLDDK9eECssfsShN6b/40RGmhtePGAswJk1Q0csfDaVCBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:36.460438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86b4131c5117b05d61c56c955666b3b1c9457cc2730bebe103fb16a26183f87c","sha256:019ac0efecb81660715adf396dcdba904182cf748ed67cae5168095774fadabb"],"state_sha256":"8a5cc45e0d713c78ea0efc219ba0d84aa6c4163fa68c21bb429d4df6f35d0183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mj8ruFnGv1G5rBP6Wl9Q8gMeJuUoY+lhbEwOJAJGMPcX1+jf6BGN2eCsIuwyDbGkua5mNkTNASo3XS/8qqmdAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:10:38.730642Z","bundle_sha256":"f0621cee7de05e3ba6f54d56092476c6e9fb18f9d5fd46c89cd35a1257cdb853"}}