{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GPV7UB7QGRJWJZWPI7VFPTHKAW","short_pith_number":"pith:GPV7UB7Q","schema_version":"1.0","canonical_sha256":"33ebfa07f0345364e6cf47ea57ccea05880793a98976f5b0974d8edb57bdcd59","source":{"kind":"arxiv","id":"2202.08656","version":2},"attestation_state":"computed","paper":{"title":"Robust Sparse Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"L\\^e-Nguy\\^en Hoang, Oscar Villemaud, Rachid Guerraoui, Youssef Allouah","submitted_at":"2022-02-17T13:40:33Z","abstract_excerpt":"Many applications, such as content moderation and recommendation, require reviewing and scoring a large number of alternatives. Doing so robustly is however very challenging. Indeed, voters' inputs are inevitably sparse: most alternatives are only scored by a small fraction of voters. This sparsity amplifies the effects of biased voters introducing unfairness, and of malicious voters seeking to hack the voting process by reporting dishonest scores. We give a precise definition of the problem of robust sparse voting, highlight its underlying technical challenges, and present a novel voting mech"},"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":"2202.08656","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-02-17T13:40:33Z","cross_cats_sorted":["econ.TH"],"title_canon_sha256":"cddf4c655e3408e8dd7d9c151f5ab836627a3d2ce9b0c1600e0ca739cfc58ae0","abstract_canon_sha256":"bb94974c561b9426f0672e1950f5d900a5c34cca81bc0567b0221cbe529b7b33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:37:09.888633Z","signature_b64":"TITvCuXWUlYE/vT7rhMlTM9zuD5ZIhuxKHcfrj9xPgTVRFqL0Mz4syrbEgjsLxiXrcjzQk+iGbUB4qLwPpgyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33ebfa07f0345364e6cf47ea57ccea05880793a98976f5b0974d8edb57bdcd59","last_reissued_at":"2026-07-05T07:37:09.888217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:37:09.888217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Sparse Voting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["econ.TH"],"primary_cat":"cs.GT","authors_text":"L\\^e-Nguy\\^en Hoang, Oscar Villemaud, Rachid Guerraoui, Youssef Allouah","submitted_at":"2022-02-17T13:40:33Z","abstract_excerpt":"Many applications, such as content moderation and recommendation, require reviewing and scoring a large number of alternatives. Doing so robustly is however very challenging. Indeed, voters' inputs are inevitably sparse: most alternatives are only scored by a small fraction of voters. This sparsity amplifies the effects of biased voters introducing unfairness, and of malicious voters seeking to hack the voting process by reporting dishonest scores. We give a precise definition of the problem of robust sparse voting, highlight its underlying technical challenges, and present a novel voting mech"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.08656","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.08656/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2202.08656","created_at":"2026-07-05T07:37:09.888273+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.08656v2","created_at":"2026-07-05T07:37:09.888273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.08656","created_at":"2026-07-05T07:37:09.888273+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPV7UB7QGRJW","created_at":"2026-07-05T07:37:09.888273+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPV7UB7QGRJWJZWP","created_at":"2026-07-05T07:37:09.888273+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPV7UB7Q","created_at":"2026-07-05T07:37:09.888273+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/GPV7UB7QGRJWJZWPI7VFPTHKAW","json":"https://pith.science/pith/GPV7UB7QGRJWJZWPI7VFPTHKAW.json","graph_json":"https://pith.science/api/pith-number/GPV7UB7QGRJWJZWPI7VFPTHKAW/graph.json","events_json":"https://pith.science/api/pith-number/GPV7UB7QGRJWJZWPI7VFPTHKAW/events.json","paper":"https://pith.science/paper/GPV7UB7Q"},"agent_actions":{"view_html":"https://pith.science/pith/GPV7UB7QGRJWJZWPI7VFPTHKAW","download_json":"https://pith.science/pith/GPV7UB7QGRJWJZWPI7VFPTHKAW.json","view_paper":"https://pith.science/paper/GPV7UB7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.08656&json=true","fetch_graph":"https://pith.science/api/pith-number/GPV7UB7QGRJWJZWPI7VFPTHKAW/graph.json","fetch_events":"https://pith.science/api/pith-number/GPV7UB7QGRJWJZWPI7VFPTHKAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPV7UB7QGRJWJZWPI7VFPTHKAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPV7UB7QGRJWJZWPI7VFPTHKAW/action/storage_attestation","attest_author":"https://pith.science/pith/GPV7UB7QGRJWJZWPI7VFPTHKAW/action/author_attestation","sign_citation":"https://pith.science/pith/GPV7UB7QGRJWJZWPI7VFPTHKAW/action/citation_signature","submit_replication":"https://pith.science/pith/GPV7UB7QGRJWJZWPI7VFPTHKAW/action/replication_record"}},"created_at":"2026-07-05T07:37:09.888273+00:00","updated_at":"2026-07-05T07:37:09.888273+00:00"}