{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:O3QUWCKL3CMU2ZTDVEJ4NWQDPG","short_pith_number":"pith:O3QUWCKL","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"},"canonical_sha256":"76e14b094bd8994d6663a913c6da037998b553ff9ceddd941c94733f6f4c3925","source":{"kind":"arxiv","id":"1111.0623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0623","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0623v1","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0623","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"pith_short_12","alias_value":"O3QUWCKL3CMU","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O3QUWCKL3CMU2ZTD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O3QUWCKL","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:O3QUWCKL3CMU2ZTDVEJ4NWQDPG","target":"record","payload":{"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"},"canonical_sha256":"76e14b094bd8994d6663a913c6da037998b553ff9ceddd941c94733f6f4c3925","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"},"source_kind":"arxiv","source_id":"1111.0623","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-18T03:41:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdlmlkGc8ZwtR1GCOg6FXCNRU5p+OR1vkyULx+v/x+L+ETcj7LKIZGnlpWwUJ1hZEcdSoT6zr5OezsD1fB3WDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:31:48.142673Z"},"content_sha256":"eb3ec0b7def9f5d1ee0efe5843b89cff7635dda36d8a93fd9f6feefd08101b51","schema_version":"1.0","event_id":"sha256:eb3ec0b7def9f5d1ee0efe5843b89cff7635dda36d8a93fd9f6feefd08101b51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:O3QUWCKL3CMU2ZTDVEJ4NWQDPG","target":"graph","payload":{"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"},"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-18T03:41:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pG0RpjxFe8NXLYIaPuacjommbTV+946pJfm3+XzOHFvyPfH+AuJG3c47eNSnn26GPB6VXFkH87Xfmi7MoM34AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:31:48.143360Z"},"content_sha256":"affa99b4bf22a196d22eba580eaab872cd533d054cb05c528530e7e3ad4054d4","schema_version":"1.0","event_id":"sha256:affa99b4bf22a196d22eba580eaab872cd533d054cb05c528530e7e3ad4054d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/bundle.json","state_url":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/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-05-30T09:31:48Z","links":{"resolver":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG","bundle":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/bundle.json","state":"https://pith.science/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3QUWCKL3CMU2ZTDVEJ4NWQDPG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:O3QUWCKL3CMU2ZTDVEJ4NWQDPG","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":"8794428df433818f5091f5c6d452a36230f35df259ed9b29fc189025b3df9d9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-02T19:49:50Z","title_canon_sha256":"4b2ac7298c2bfbb1b4b46ab8ac0d597327ca970670440e2e981bdeaa978fecdb"},"schema_version":"1.0","source":{"id":"1111.0623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0623","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0623v1","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0623","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"pith_short_12","alias_value":"O3QUWCKL3CMU","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"O3QUWCKL3CMU2ZTD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"O3QUWCKL","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:affa99b4bf22a196d22eba580eaab872cd533d054cb05c528530e7e3ad4054d4","target":"graph","created_at":"2026-05-18T03:41:32Z","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":"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","authors_text":"Aaron Roth, Moritz Hardt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-02T19:49:50Z","title":"Beating Randomized Response on Incoherent Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0623","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:eb3ec0b7def9f5d1ee0efe5843b89cff7635dda36d8a93fd9f6feefd08101b51","target":"record","created_at":"2026-05-18T03:41:32Z","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":"8794428df433818f5091f5c6d452a36230f35df259ed9b29fc189025b3df9d9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-02T19:49:50Z","title_canon_sha256":"4b2ac7298c2bfbb1b4b46ab8ac0d597327ca970670440e2e981bdeaa978fecdb"},"schema_version":"1.0","source":{"id":"1111.0623","kind":"arxiv","version":1}},"canonical_sha256":"76e14b094bd8994d6663a913c6da037998b553ff9ceddd941c94733f6f4c3925","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76e14b094bd8994d6663a913c6da037998b553ff9ceddd941c94733f6f4c3925","first_computed_at":"2026-05-18T03:41:32.284564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:32.284564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LWjxFExevr9lbUzKVZ7dttuNtHBZ2QxtlHGFZeNPO8CkwD2cGRWM9N/AAFtl9X4UMFfxjwgtPLS9837UzxaoDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:32.285354Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb3ec0b7def9f5d1ee0efe5843b89cff7635dda36d8a93fd9f6feefd08101b51","sha256:affa99b4bf22a196d22eba580eaab872cd533d054cb05c528530e7e3ad4054d4"],"state_sha256":"6f204d7462449a40e6c36fdf845ab622f5a4962e1557529c1b34a29bd864eebe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vb5R47Zug8FTNdjQnPndLmXUAOoZXFLawDtoWaoDgrxVXiEm1vVod6Hv4HoxcdeiAnAEvN8twiJFftt1I7NBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:31:48.146903Z","bundle_sha256":"e1eb0f12d3cf6437660510c73a81f96d31488188cd3569f9aac9c1ac5744c1ec"}}