{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XGUKR3Z4L2SVTYFZS4CMQT4QQK","short_pith_number":"pith:XGUKR3Z4","canonical_record":{"source":{"id":"2010.12181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T06:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"341c0236a78bc52ac943b5ba2e871fa9f78479b75a0f85f3c5e5f15e6c8dfa5c","abstract_canon_sha256":"89f2fd5a42af100f470778ba6befe10f4bd2a6273c680d48594243b3b646b05c"},"schema_version":"1.0"},"canonical_sha256":"b9a8a8ef3c5ea559e0b99704c84f9082a62ccc883c5e0ff28432593040a198c0","source":{"kind":"arxiv","id":"2010.12181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12181","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12181v1","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12181","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"pith_short_12","alias_value":"XGUKR3Z4L2SV","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"pith_short_16","alias_value":"XGUKR3Z4L2SVTYFZ","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"pith_short_8","alias_value":"XGUKR3Z4","created_at":"2026-07-05T01:45:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XGUKR3Z4L2SVTYFZS4CMQT4QQK","target":"record","payload":{"canonical_record":{"source":{"id":"2010.12181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T06:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"341c0236a78bc52ac943b5ba2e871fa9f78479b75a0f85f3c5e5f15e6c8dfa5c","abstract_canon_sha256":"89f2fd5a42af100f470778ba6befe10f4bd2a6273c680d48594243b3b646b05c"},"schema_version":"1.0"},"canonical_sha256":"b9a8a8ef3c5ea559e0b99704c84f9082a62ccc883c5e0ff28432593040a198c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:34.657662Z","signature_b64":"phxGmv0exyANEjcj7RsphfH1JaWeda5X+aKy4tJeGZfl2IZqlvEFfpzFodhxRPC1kcs87xas0ufVSIw8B/GuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a8a8ef3c5ea559e0b99704c84f9082a62ccc883c5e0ff28432593040a198c0","last_reissued_at":"2026-07-05T01:45:34.657259Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:34.657259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.12181","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-07-05T01:45:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Up7PQ3Sam1ZvkqrZC3pVsaWIsaU2o6bX/VnPYED04D9HnT8y8fzWky2nptKr+OP/bKJH0qo9YQ44NLIrSGPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T22:48:23.912188Z"},"content_sha256":"67ecf8d3ad5eea831f38d2eac5c964d118f3211a297ba1b1a68d1eed67071af6","schema_version":"1.0","event_id":"sha256:67ecf8d3ad5eea831f38d2eac5c964d118f3211a297ba1b1a68d1eed67071af6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XGUKR3Z4L2SVTYFZS4CMQT4QQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alex Olshevsky, Qianqian Ma","submitted_at":"2020-10-23T06:23:20Z","abstract_excerpt":"We consider the problem of reconstructing a rank-one matrix from a revealed subset of its entries when some of the revealed entries are corrupted with perturbations that are unknown and can be arbitrarily large. It is not known which revealed entries are corrupted. We propose a new algorithm combining alternating minimization with extreme-value filtering and provide sufficient and necessary conditions to recover the original rank-one matrix. In particular, we show that our proposed algorithm is optimal when the set of revealed entries is given by an Erd\\H{o}s-R\\'enyi random graph. These result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12181","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.12181/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:45:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qz5brW1AGzsqneb0T19Bi2oGEVJF68uBs5zOlVBfFffiCcth71HADiV5bsgT4pJV/6SfFnUn/DKbTd1G4GS2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T22:48:23.912850Z"},"content_sha256":"9090d9abf3b306c93320ffc80fd3d00ca9e48a39724888a8da516c08c3ee6d19","schema_version":"1.0","event_id":"sha256:9090d9abf3b306c93320ffc80fd3d00ca9e48a39724888a8da516c08c3ee6d19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGUKR3Z4L2SVTYFZS4CMQT4QQK/bundle.json","state_url":"https://pith.science/pith/XGUKR3Z4L2SVTYFZS4CMQT4QQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGUKR3Z4L2SVTYFZS4CMQT4QQK/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-08-13T22:48:23Z","links":{"resolver":"https://pith.science/pith/XGUKR3Z4L2SVTYFZS4CMQT4QQK","bundle":"https://pith.science/pith/XGUKR3Z4L2SVTYFZS4CMQT4QQK/bundle.json","state":"https://pith.science/pith/XGUKR3Z4L2SVTYFZS4CMQT4QQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGUKR3Z4L2SVTYFZS4CMQT4QQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XGUKR3Z4L2SVTYFZS4CMQT4QQK","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":"89f2fd5a42af100f470778ba6befe10f4bd2a6273c680d48594243b3b646b05c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T06:23:20Z","title_canon_sha256":"341c0236a78bc52ac943b5ba2e871fa9f78479b75a0f85f3c5e5f15e6c8dfa5c"},"schema_version":"1.0","source":{"id":"2010.12181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.12181","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"arxiv_version","alias_value":"2010.12181v1","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.12181","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"pith_short_12","alias_value":"XGUKR3Z4L2SV","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"pith_short_16","alias_value":"XGUKR3Z4L2SVTYFZ","created_at":"2026-07-05T01:45:34Z"},{"alias_kind":"pith_short_8","alias_value":"XGUKR3Z4","created_at":"2026-07-05T01:45:34Z"}],"graph_snapshots":[{"event_id":"sha256:9090d9abf3b306c93320ffc80fd3d00ca9e48a39724888a8da516c08c3ee6d19","target":"graph","created_at":"2026-07-05T01:45:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.12181/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of reconstructing a rank-one matrix from a revealed subset of its entries when some of the revealed entries are corrupted with perturbations that are unknown and can be arbitrarily large. It is not known which revealed entries are corrupted. We propose a new algorithm combining alternating minimization with extreme-value filtering and provide sufficient and necessary conditions to recover the original rank-one matrix. In particular, we show that our proposed algorithm is optimal when the set of revealed entries is given by an Erd\\H{o}s-R\\'enyi random graph. These result","authors_text":"Alex Olshevsky, Qianqian Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T06:23:20Z","title":"Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.12181","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:67ecf8d3ad5eea831f38d2eac5c964d118f3211a297ba1b1a68d1eed67071af6","target":"record","created_at":"2026-07-05T01:45:34Z","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":"89f2fd5a42af100f470778ba6befe10f4bd2a6273c680d48594243b3b646b05c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-23T06:23:20Z","title_canon_sha256":"341c0236a78bc52ac943b5ba2e871fa9f78479b75a0f85f3c5e5f15e6c8dfa5c"},"schema_version":"1.0","source":{"id":"2010.12181","kind":"arxiv","version":1}},"canonical_sha256":"b9a8a8ef3c5ea559e0b99704c84f9082a62ccc883c5e0ff28432593040a198c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9a8a8ef3c5ea559e0b99704c84f9082a62ccc883c5e0ff28432593040a198c0","first_computed_at":"2026-07-05T01:45:34.657259Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:45:34.657259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"phxGmv0exyANEjcj7RsphfH1JaWeda5X+aKy4tJeGZfl2IZqlvEFfpzFodhxRPC1kcs87xas0ufVSIw8B/GuBA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:45:34.657662Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.12181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67ecf8d3ad5eea831f38d2eac5c964d118f3211a297ba1b1a68d1eed67071af6","sha256:9090d9abf3b306c93320ffc80fd3d00ca9e48a39724888a8da516c08c3ee6d19"],"state_sha256":"d12b67d228b6d34f1b1630846dda5ce3baa3cbf288e6ec5b069896f993ec84a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"waVXoMpqpnzPsDM/9lzj+63wyzjvmIsTNlB6PqIf8FTZUhApD/aTsRozcya7JklVGjr02J3MVGFHil6K35MSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T22:48:23.917831Z","bundle_sha256":"c2240e6fb04d38b8e406a7d69fe9206a5b3d91cd2e0db79c9afeb2a3a411e2fd"}}