{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X7OJHGWC4K3BMTLKLLSNJDU3S5","short_pith_number":"pith:X7OJHGWC","canonical_record":{"source":{"id":"1905.00733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-01T16:13:07Z","cross_cats_sorted":[],"title_canon_sha256":"7825db6a5960100c3a5232476898d9573a3bf5ef3b2549930909b54d075c3238","abstract_canon_sha256":"6fccc57e218c4c0f5340495637774643b71502868d9083989a25fed6bca09a4e"},"schema_version":"1.0"},"canonical_sha256":"bfdc939ac2e2b6164d6a5ae4d48e9b977ca396fff1c872d1473b5588bd90354b","source":{"kind":"arxiv","id":"1905.00733","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00733","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00733v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00733","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"X7OJHGWC4K3B","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X7OJHGWC4K3BMTLK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X7OJHGWC","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X7OJHGWC4K3BMTLKLLSNJDU3S5","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-01T16:13:07Z","cross_cats_sorted":[],"title_canon_sha256":"7825db6a5960100c3a5232476898d9573a3bf5ef3b2549930909b54d075c3238","abstract_canon_sha256":"6fccc57e218c4c0f5340495637774643b71502868d9083989a25fed6bca09a4e"},"schema_version":"1.0"},"canonical_sha256":"bfdc939ac2e2b6164d6a5ae4d48e9b977ca396fff1c872d1473b5588bd90354b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:09.475664Z","signature_b64":"556sjA/YcM0V3yX4YkCzuO+kFUXnAXGMZt+g6xnivsi6u5oSI2pzOB/5LOjFNg8xk7GrtS0Gf8l9fnG3vi1qBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfdc939ac2e2b6164d6a5ae4d48e9b977ca396fff1c872d1473b5588bd90354b","last_reissued_at":"2026-05-17T23:47:09.474973Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:09.474973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00733","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:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"df9L5NimmbzcN2LhltyKWuJ/STSaASQzsFRrpJxTQw5OSdlqBXQ/Vh2KaXLpbPSB8HslObAzFZAnGB790rRAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:00:55.160671Z"},"content_sha256":"5dca8daef2e97b12f485fa8d9f78f4c9f8e593a313525489156754a311861c7b","schema_version":"1.0","event_id":"sha256:5dca8daef2e97b12f485fa8d9f78f4c9f8e593a313525489156754a311861c7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X7OJHGWC4K3BMTLKLLSNJDU3S5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Privacy of Agents' Costs in Peer-to-Peer Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Nikhil Chopra, Nirupam Gupta","submitted_at":"2019-05-01T16:13:07Z","abstract_excerpt":"In this paper, we propose a protocol that preserves (statistical) privacy of agents' costs in peer-to-peer distributed optimization against a passive adversary that corrupts certain number of agents in the network. The proposed protocol guarantees privacy of the affine parts of the honest agents' costs (agents that are not corrupted by the adversary) if the corrupted agents do not form a vertex cut of the underlying communication topology. Therefore, if the (passive) adversary corrupts at most t arbitrary agents in the network then the proposed protocol can preserve the privacy of the affine p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00733","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:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k6/xBPUymn5ht3zjAHiWI12ZxeMTi3dnR8A50JfLVweuw7RursCQ/bi0kyqpO3bqTeBeeKO+wPUxNMHEzsD7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:00:55.161022Z"},"content_sha256":"19a85202a54bc49c6bc4e03940f1059dd381a3f3100a93e3c4c14d54094be5d6","schema_version":"1.0","event_id":"sha256:19a85202a54bc49c6bc4e03940f1059dd381a3f3100a93e3c4c14d54094be5d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7OJHGWC4K3BMTLKLLSNJDU3S5/bundle.json","state_url":"https://pith.science/pith/X7OJHGWC4K3BMTLKLLSNJDU3S5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7OJHGWC4K3BMTLKLLSNJDU3S5/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-02T08:00:55Z","links":{"resolver":"https://pith.science/pith/X7OJHGWC4K3BMTLKLLSNJDU3S5","bundle":"https://pith.science/pith/X7OJHGWC4K3BMTLKLLSNJDU3S5/bundle.json","state":"https://pith.science/pith/X7OJHGWC4K3BMTLKLLSNJDU3S5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7OJHGWC4K3BMTLKLLSNJDU3S5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X7OJHGWC4K3BMTLKLLSNJDU3S5","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":"6fccc57e218c4c0f5340495637774643b71502868d9083989a25fed6bca09a4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-01T16:13:07Z","title_canon_sha256":"7825db6a5960100c3a5232476898d9573a3bf5ef3b2549930909b54d075c3238"},"schema_version":"1.0","source":{"id":"1905.00733","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00733","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00733v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00733","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"X7OJHGWC4K3B","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"X7OJHGWC4K3BMTLK","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"X7OJHGWC","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:19a85202a54bc49c6bc4e03940f1059dd381a3f3100a93e3c4c14d54094be5d6","target":"graph","created_at":"2026-05-17T23:47:09Z","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":"In this paper, we propose a protocol that preserves (statistical) privacy of agents' costs in peer-to-peer distributed optimization against a passive adversary that corrupts certain number of agents in the network. The proposed protocol guarantees privacy of the affine parts of the honest agents' costs (agents that are not corrupted by the adversary) if the corrupted agents do not form a vertex cut of the underlying communication topology. Therefore, if the (passive) adversary corrupts at most t arbitrary agents in the network then the proposed protocol can preserve the privacy of the affine p","authors_text":"Nikhil Chopra, Nirupam Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-01T16:13:07Z","title":"Privacy of Agents' Costs in Peer-to-Peer Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00733","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:5dca8daef2e97b12f485fa8d9f78f4c9f8e593a313525489156754a311861c7b","target":"record","created_at":"2026-05-17T23:47:09Z","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":"6fccc57e218c4c0f5340495637774643b71502868d9083989a25fed6bca09a4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-01T16:13:07Z","title_canon_sha256":"7825db6a5960100c3a5232476898d9573a3bf5ef3b2549930909b54d075c3238"},"schema_version":"1.0","source":{"id":"1905.00733","kind":"arxiv","version":1}},"canonical_sha256":"bfdc939ac2e2b6164d6a5ae4d48e9b977ca396fff1c872d1473b5588bd90354b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfdc939ac2e2b6164d6a5ae4d48e9b977ca396fff1c872d1473b5588bd90354b","first_computed_at":"2026-05-17T23:47:09.474973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:09.474973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"556sjA/YcM0V3yX4YkCzuO+kFUXnAXGMZt+g6xnivsi6u5oSI2pzOB/5LOjFNg8xk7GrtS0Gf8l9fnG3vi1qBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:09.475664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00733","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5dca8daef2e97b12f485fa8d9f78f4c9f8e593a313525489156754a311861c7b","sha256:19a85202a54bc49c6bc4e03940f1059dd381a3f3100a93e3c4c14d54094be5d6"],"state_sha256":"96c230f082fb2c6fc5f52af08d41955694270055e7979e26f7bdc884b87ec033"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/T6WDdlWdHhOosLWiHwNhfp7cvJvWC8joHa5Ej5+o8+ZNbPrMiVYmsy9wXHhYG//c9owGyJVila3lI4Z68eeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:00:55.163012Z","bundle_sha256":"90b49d5f85a7ef251a188c52bcba608338122e3257636030af808e18a96bd852"}}