{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:O3QUWCKL3CMU2ZTDVEJ4NWQDPG","short_pith_number":"pith:O3QUWCKL","schema_version":"1.0","canonical_sha256":"76e14b094bd8994d6663a913c6da037998b553ff9ceddd941c94733f6f4c3925","source":{"kind":"arxiv","id":"1111.0623","version":1},"attestation_state":"computed","paper":{"title":"Beating Randomized Response on Incoherent Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Moritz Hardt","submitted_at":"2011-11-02T19:49:50Z","abstract_excerpt":"Computing accurate low rank approximations of large matrices is a fundamental data mining task. In many applications however the matrix contains sensitive information about individuals. In such case we would like to release a low rank approximation that satisfies a strong privacy guarantee such as differential privacy. Unfortunately, to date the best known algorithm for this task that satisfies differential privacy is based on naive input perturbation or randomized response: Each entry of the matrix is perturbed independently by a sufficiently large random noise variable, a low rank approximat"},"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":"1111.0623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-02T19:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"4b2ac7298c2bfbb1b4b46ab8ac0d597327ca970670440e2e981bdeaa978fecdb","abstract_canon_sha256":"8794428df433818f5091f5c6d452a36230f35df259ed9b29fc189025b3df9d9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:32.285354Z","signature_b64":"LWjxFExevr9lbUzKVZ7dttuNtHBZ2QxtlHGFZeNPO8CkwD2cGRWM9N/AAFtl9X4UMFfxjwgtPLS9837UzxaoDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76e14b094bd8994d6663a913c6da037998b553ff9ceddd941c94733f6f4c3925","last_reissued_at":"2026-05-18T03:41:32.284564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:32.284564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beating Randomized Response on Incoherent Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Roth, Moritz Hardt","submitted_at":"2011-11-02T19:49:50Z","abstract_excerpt":"Computing accurate low rank approximations of large matrices is a fundamental data mining task. In many applications however the matrix contains sensitive information about individuals. In such case we would like to release a low rank approximation that satisfies a strong privacy guarantee such as differential privacy. Unfortunately, to date the best known algorithm for this task that satisfies differential privacy is based on naive input perturbation or randomized response: Each entry of the matrix is perturbed independently by a sufficiently large random noise variable, a low rank approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0623","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.0623","created_at":"2026-05-18T03:41:32.284702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0623v1","created_at":"2026-05-18T03:41:32.284702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0623","created_at":"2026-05-18T03:41:32.284702+00:00"},{"alias_kind":"pith_short_12","alias_value":"O3QUWCKL3CMU","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"O3QUWCKL3CMU2ZTD","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"O3QUWCKL","created_at":"2026-05-18T12:26:37.096874+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/O3QUWCKL3CMU2ZTDVEJ4NWQDPG","json":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG.json","graph_json":"https://pith.science/api/pith-number/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/graph.json","events_json":"https://pith.science/api/pith-number/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/events.json","paper":"https://pith.science/paper/O3QUWCKL"},"agent_actions":{"view_html":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG","download_json":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG.json","view_paper":"https://pith.science/paper/O3QUWCKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0623&json=true","fetch_graph":"https://pith.science/api/pith-number/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/graph.json","fetch_events":"https://pith.science/api/pith-number/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/action/storage_attestation","attest_author":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/action/author_attestation","sign_citation":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/action/citation_signature","submit_replication":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/action/replication_record"}},"created_at":"2026-05-18T03:41:32.284702+00:00","updated_at":"2026-05-18T03:41:32.284702+00:00"}