{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6MXUCUFRXFJIAHHAOHW6QSGAVO","short_pith_number":"pith:6MXUCUFR","schema_version":"1.0","canonical_sha256":"f32f4150b1b952801ce071ede848c0abb5be3ff175553fe7c6400f071e675852","source":{"kind":"arxiv","id":"1806.08182","version":2},"attestation_state":"computed","paper":{"title":"Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Frederik Mallmann-Trenn, Vincent Cohen-Addad","submitted_at":"2018-06-21T11:50:39Z","abstract_excerpt":"Motivated by crowdsourced computation, peer-grading, and recommendation systems, Braverman, Mao and Weinberg [STOC'16] studied the \\emph{query} and \\emph{round} complexity of fundamental problems such as finding the maximum (\\textsc{max}), finding all elements above a certain value (\\textsc{threshold-$v$}) or computing the top$-k$ elements (\\textsc{Top}-$k$) in a noisy environment.\n  For example, consider the task of selecting papers for a conference. This task is challenging due the crowdsourcing nature of peer reviews: the results of reviews are noisy and it is necessary to parallelize the r"},"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":"1806.08182","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T11:50:39Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"b9e011cb13278d12749fc5d4623a82ce59c4cbae4ba6d76905f18630ced58b77","abstract_canon_sha256":"645972defd5da5f9396c5ac147dcfb66ec6f4b46360603a7c0dcba75da7eafbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:38.160718Z","signature_b64":"jFiD2ScOv+ZPzb8O+YaaFtseigfdVwT8SL6hEu5rYOdqhig5Q/pZMXlGbTwyrEeeqaQEL6OpTdLAstXiNl5mBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f32f4150b1b952801ce071ede848c0abb5be3ff175553fe7c6400f071e675852","last_reissued_at":"2026-05-18T00:01:38.160020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:38.160020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Frederik Mallmann-Trenn, Vincent Cohen-Addad","submitted_at":"2018-06-21T11:50:39Z","abstract_excerpt":"Motivated by crowdsourced computation, peer-grading, and recommendation systems, Braverman, Mao and Weinberg [STOC'16] studied the \\emph{query} and \\emph{round} complexity of fundamental problems such as finding the maximum (\\textsc{max}), finding all elements above a certain value (\\textsc{threshold-$v$}) or computing the top$-k$ elements (\\textsc{Top}-$k$) in a noisy environment.\n  For example, consider the task of selecting papers for a conference. This task is challenging due the crowdsourcing nature of peer reviews: the results of reviews are noisy and it is necessary to parallelize the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08182","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":"1806.08182","created_at":"2026-05-18T00:01:38.160124+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08182v2","created_at":"2026-05-18T00:01:38.160124+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08182","created_at":"2026-05-18T00:01:38.160124+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MXUCUFRXFJI","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MXUCUFRXFJIAHHA","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MXUCUFR","created_at":"2026-05-18T12:32:11.075285+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/6MXUCUFRXFJIAHHAOHW6QSGAVO","json":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO.json","graph_json":"https://pith.science/api/pith-number/6MXUCUFRXFJIAHHAOHW6QSGAVO/graph.json","events_json":"https://pith.science/api/pith-number/6MXUCUFRXFJIAHHAOHW6QSGAVO/events.json","paper":"https://pith.science/paper/6MXUCUFR"},"agent_actions":{"view_html":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO","download_json":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO.json","view_paper":"https://pith.science/paper/6MXUCUFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08182&json=true","fetch_graph":"https://pith.science/api/pith-number/6MXUCUFRXFJIAHHAOHW6QSGAVO/graph.json","fetch_events":"https://pith.science/api/pith-number/6MXUCUFRXFJIAHHAOHW6QSGAVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/action/storage_attestation","attest_author":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/action/author_attestation","sign_citation":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/action/citation_signature","submit_replication":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/action/replication_record"}},"created_at":"2026-05-18T00:01:38.160124+00:00","updated_at":"2026-05-18T00:01:38.160124+00:00"}