{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZX5DAOTZHSWSGFPYSJ6YFJDKID","short_pith_number":"pith:ZX5DAOTZ","schema_version":"1.0","canonical_sha256":"cdfa303a793cad2315f8927d82a46a40d86a5c8751adfead6f065ede91b61060","source":{"kind":"arxiv","id":"1402.3631","version":2},"attestation_state":"computed","paper":{"title":"Privately Solving Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Jonathan Ullman, Justin Hsu, Tim Roughgarden","submitted_at":"2014-02-15T00:55:46Z","abstract_excerpt":"In this paper, we initiate the systematic study of solving linear programs under differential privacy. The first step is simply to define the problem: to this end, we introduce several natural classes of private linear programs that capture different ways sensitive data can be incorporated into a linear program. For each class of linear programs we give an efficient, differentially private solver based on the multiplicative weights framework, or we give an impossibility result."},"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":"1402.3631","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-15T00:55:46Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"e415a49a0729135b109472d060b763d604a72e6dd3aebf929dad14a80f6d94fa","abstract_canon_sha256":"ca094c6a215921381da0533454e43a54fc6bc443b650ac2c1021083c2635fee2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:00.941508Z","signature_b64":"f5KB0naQXSp9/Fl57iWLJeoIdlZG0n3UVjbUkJOqS/6iUY7fTgA+VasHOqpb5TwTyflQ5pUhZB2nSXeo6XA6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdfa303a793cad2315f8927d82a46a40d86a5c8751adfead6f065ede91b61060","last_reissued_at":"2026-05-18T00:21:00.940962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:00.940962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privately Solving Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Jonathan Ullman, Justin Hsu, Tim Roughgarden","submitted_at":"2014-02-15T00:55:46Z","abstract_excerpt":"In this paper, we initiate the systematic study of solving linear programs under differential privacy. The first step is simply to define the problem: to this end, we introduce several natural classes of private linear programs that capture different ways sensitive data can be incorporated into a linear program. For each class of linear programs we give an efficient, differentially private solver based on the multiplicative weights framework, or we give an impossibility result."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3631","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":"1402.3631","created_at":"2026-05-18T00:21:00.941065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3631v2","created_at":"2026-05-18T00:21:00.941065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3631","created_at":"2026-05-18T00:21:00.941065+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZX5DAOTZHSWS","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZX5DAOTZHSWSGFPY","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZX5DAOTZ","created_at":"2026-05-18T12:28:59.999130+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/ZX5DAOTZHSWSGFPYSJ6YFJDKID","json":"https://pith.science/pith/ZX5DAOTZHSWSGFPYSJ6YFJDKID.json","graph_json":"https://pith.science/api/pith-number/ZX5DAOTZHSWSGFPYSJ6YFJDKID/graph.json","events_json":"https://pith.science/api/pith-number/ZX5DAOTZHSWSGFPYSJ6YFJDKID/events.json","paper":"https://pith.science/paper/ZX5DAOTZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZX5DAOTZHSWSGFPYSJ6YFJDKID","download_json":"https://pith.science/pith/ZX5DAOTZHSWSGFPYSJ6YFJDKID.json","view_paper":"https://pith.science/paper/ZX5DAOTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3631&json=true","fetch_graph":"https://pith.science/api/pith-number/ZX5DAOTZHSWSGFPYSJ6YFJDKID/graph.json","fetch_events":"https://pith.science/api/pith-number/ZX5DAOTZHSWSGFPYSJ6YFJDKID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZX5DAOTZHSWSGFPYSJ6YFJDKID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZX5DAOTZHSWSGFPYSJ6YFJDKID/action/storage_attestation","attest_author":"https://pith.science/pith/ZX5DAOTZHSWSGFPYSJ6YFJDKID/action/author_attestation","sign_citation":"https://pith.science/pith/ZX5DAOTZHSWSGFPYSJ6YFJDKID/action/citation_signature","submit_replication":"https://pith.science/pith/ZX5DAOTZHSWSGFPYSJ6YFJDKID/action/replication_record"}},"created_at":"2026-05-18T00:21:00.941065+00:00","updated_at":"2026-05-18T00:21:00.941065+00:00"}