{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6MXUCUFRXFJIAHHAOHW6QSGAVO","short_pith_number":"pith:6MXUCUFR","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"},"canonical_sha256":"f32f4150b1b952801ce071ede848c0abb5be3ff175553fe7c6400f071e675852","source":{"kind":"arxiv","id":"1806.08182","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08182","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08182v2","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08182","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"6MXUCUFRXFJI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6MXUCUFRXFJIAHHA","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6MXUCUFR","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6MXUCUFRXFJIAHHAOHW6QSGAVO","target":"record","payload":{"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"},"canonical_sha256":"f32f4150b1b952801ce071ede848c0abb5be3ff175553fe7c6400f071e675852","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"},"source_kind":"arxiv","source_id":"1806.08182","source_version":2,"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-18T00:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQMgJR/gznomNwhYraOYB/uiqnBIPNefeoQMzlmWVwwooUC9QJSJB9S3WWX8/XX63lzKzOBlrzwjWZoIVIN3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:33:44.997063Z"},"content_sha256":"aa83d00301db6ed1b627a44209a5035482fc1822333517a81b90c22d9d9ac9be","schema_version":"1.0","event_id":"sha256:aa83d00301db6ed1b627a44209a5035482fc1822333517a81b90c22d9d9ac9be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6MXUCUFRXFJIAHHAOHW6QSGAVO","target":"graph","payload":{"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"},"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-18T00:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dO7AfEODFbYMgEnhR4To5U2lK3cr281qRsUpO09vbXx0G0GqEOcMb+EaGkDaYzt9IDPVgIUNfg1pB35BU3IPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:33:44.997435Z"},"content_sha256":"dc78033f82d0cda74a472e92f7a7a5ce304eeb4b3a9baa09e0b2a161c3523e58","schema_version":"1.0","event_id":"sha256:dc78033f82d0cda74a472e92f7a7a5ce304eeb4b3a9baa09e0b2a161c3523e58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/bundle.json","state_url":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/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-06-01T21:33:44Z","links":{"resolver":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO","bundle":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/bundle.json","state":"https://pith.science/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MXUCUFRXFJIAHHAOHW6QSGAVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6MXUCUFRXFJIAHHAOHW6QSGAVO","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":"645972defd5da5f9396c5ac147dcfb66ec6f4b46360603a7c0dcba75da7eafbb","cross_cats_sorted":["cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T11:50:39Z","title_canon_sha256":"b9e011cb13278d12749fc5d4623a82ce59c4cbae4ba6d76905f18630ced58b77"},"schema_version":"1.0","source":{"id":"1806.08182","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08182","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08182v2","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08182","created_at":"2026-05-18T00:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"6MXUCUFRXFJI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6MXUCUFRXFJIAHHA","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6MXUCUFR","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:dc78033f82d0cda74a472e92f7a7a5ce304eeb4b3a9baa09e0b2a161c3523e58","target":"graph","created_at":"2026-05-18T00:01:38Z","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":"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","authors_text":"Claire Mathieu, Frederik Mallmann-Trenn, Vincent Cohen-Addad","cross_cats":["cs.DB","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T11:50:39Z","title":"Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08182","kind":"arxiv","version":2},"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:aa83d00301db6ed1b627a44209a5035482fc1822333517a81b90c22d9d9ac9be","target":"record","created_at":"2026-05-18T00:01:38Z","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":"645972defd5da5f9396c5ac147dcfb66ec6f4b46360603a7c0dcba75da7eafbb","cross_cats_sorted":["cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-21T11:50:39Z","title_canon_sha256":"b9e011cb13278d12749fc5d4623a82ce59c4cbae4ba6d76905f18630ced58b77"},"schema_version":"1.0","source":{"id":"1806.08182","kind":"arxiv","version":2}},"canonical_sha256":"f32f4150b1b952801ce071ede848c0abb5be3ff175553fe7c6400f071e675852","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f32f4150b1b952801ce071ede848c0abb5be3ff175553fe7c6400f071e675852","first_computed_at":"2026-05-18T00:01:38.160020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:38.160020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jFiD2ScOv+ZPzb8O+YaaFtseigfdVwT8SL6hEu5rYOdqhig5Q/pZMXlGbTwyrEeeqaQEL6OpTdLAstXiNl5mBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:38.160718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08182","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa83d00301db6ed1b627a44209a5035482fc1822333517a81b90c22d9d9ac9be","sha256:dc78033f82d0cda74a472e92f7a7a5ce304eeb4b3a9baa09e0b2a161c3523e58"],"state_sha256":"adc97a7bab127ace3dcc42c8b1caae27f654763a0190d74d990baa625cc95522"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4EVND+OT0P09Ry87e72YPaMQui7PVbtl1nhRr61acoP0XSowI8pR7XP1DHVbUna4Pj5D83IOxmIBbKPpDc0dDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:33:44.999420Z","bundle_sha256":"f8494542b894a76efcaacaf7ea23cc5bf258e5b2ffa6a815371c7e5f5d363ebe"}}