{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DRO2LJ6LTIWC6XA34JCB4BDR7U","short_pith_number":"pith:DRO2LJ6L","schema_version":"1.0","canonical_sha256":"1c5da5a7cb9a2c2f5c1be2441e0471fd13ecfbd8797db66811b16000c6e4bc82","source":{"kind":"arxiv","id":"1411.0998","version":2},"attestation_state":"computed","paper":{"title":"Jointly Private Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Justin Hsu, Zhiwei Steven Wu, Zhiyi Huang","submitted_at":"2014-11-04T18:46:50Z","abstract_excerpt":"In this paper we present an extremely general method for approximately solving a large family of convex programs where the solution can be divided between different agents, subject to joint differential privacy. This class includes multi-commodity flow problems, general allocation problems, and multi-dimensional knapsack problems, among other examples. The accuracy of our algorithm depends on the \\emph{number} of constraints that bind between individuals, but crucially, is \\emph{nearly independent} of the number of primal variables and hence the number of agents who make up the problem. As the"},"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":"1411.0998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T18:46:50Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"1726c6bb2f334df728adc39735ae823c5baafdce347a59bbcb990105e41906e0","abstract_canon_sha256":"a79ecadde2fb0cf1ebaea1b2d67653f34371e248ae2f367aa8bd4f44f76548c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:00.783026Z","signature_b64":"SnD7v97+nv/LavjURO4CAL9cYxlIvHNK4fW6q9eTI5/SND+LByuelt9+YTk08s7kJFJLuZQjbRmRih/S+i1aDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c5da5a7cb9a2c2f5c1be2441e0471fd13ecfbd8797db66811b16000c6e4bc82","last_reissued_at":"2026-05-18T00:21:00.782541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:00.782541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jointly Private Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Justin Hsu, Zhiwei Steven Wu, Zhiyi Huang","submitted_at":"2014-11-04T18:46:50Z","abstract_excerpt":"In this paper we present an extremely general method for approximately solving a large family of convex programs where the solution can be divided between different agents, subject to joint differential privacy. This class includes multi-commodity flow problems, general allocation problems, and multi-dimensional knapsack problems, among other examples. The accuracy of our algorithm depends on the \\emph{number} of constraints that bind between individuals, but crucially, is \\emph{nearly independent} of the number of primal variables and hence the number of agents who make up the problem. As the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0998","kind":"arxiv","version":2},"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":"1411.0998","created_at":"2026-05-18T00:21:00.782629+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0998v2","created_at":"2026-05-18T00:21:00.782629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0998","created_at":"2026-05-18T00:21:00.782629+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRO2LJ6LTIWC","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRO2LJ6LTIWC6XA3","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRO2LJ6L","created_at":"2026-05-18T12:28:25.294606+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/DRO2LJ6LTIWC6XA34JCB4BDR7U","json":"https://pith.science/pith/DRO2LJ6LTIWC6XA34JCB4BDR7U.json","graph_json":"https://pith.science/api/pith-number/DRO2LJ6LTIWC6XA34JCB4BDR7U/graph.json","events_json":"https://pith.science/api/pith-number/DRO2LJ6LTIWC6XA34JCB4BDR7U/events.json","paper":"https://pith.science/paper/DRO2LJ6L"},"agent_actions":{"view_html":"https://pith.science/pith/DRO2LJ6LTIWC6XA34JCB4BDR7U","download_json":"https://pith.science/pith/DRO2LJ6LTIWC6XA34JCB4BDR7U.json","view_paper":"https://pith.science/paper/DRO2LJ6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0998&json=true","fetch_graph":"https://pith.science/api/pith-number/DRO2LJ6LTIWC6XA34JCB4BDR7U/graph.json","fetch_events":"https://pith.science/api/pith-number/DRO2LJ6LTIWC6XA34JCB4BDR7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRO2LJ6LTIWC6XA34JCB4BDR7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRO2LJ6LTIWC6XA34JCB4BDR7U/action/storage_attestation","attest_author":"https://pith.science/pith/DRO2LJ6LTIWC6XA34JCB4BDR7U/action/author_attestation","sign_citation":"https://pith.science/pith/DRO2LJ6LTIWC6XA34JCB4BDR7U/action/citation_signature","submit_replication":"https://pith.science/pith/DRO2LJ6LTIWC6XA34JCB4BDR7U/action/replication_record"}},"created_at":"2026-05-18T00:21:00.782629+00:00","updated_at":"2026-05-18T00:21:00.782629+00:00"}