{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:34FRYUCV7GGQ7HYGZKMPYDEDDN","short_pith_number":"pith:34FRYUCV","schema_version":"1.0","canonical_sha256":"df0b1c5055f98d0f9f06ca98fc0c831b6089073e9218161f7ea963badb6c9112","source":{"kind":"arxiv","id":"2102.09002","version":1},"attestation_state":"computed","paper":{"title":"Impartial selection with prior information","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"George Christodoulou, Ioannis Caragiannis, Nicos Protopapas","submitted_at":"2021-02-17T19:49:37Z","abstract_excerpt":"We study the problem of {\\em impartial selection}, a topic that lies at the intersection of computational social choice and mechanism design. The goal is to select the most popular individual among a set of community members. The input can be modeled as a directed graph, where each node represents an individual, and a directed edge indicates nomination or approval of a community member to another. An {\\em impartial mechanism} is robust to potential selfish behavior of the individuals and provides appropriate incentives to voters to report their true preferences by ensuring that the chance of a"},"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":"2102.09002","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2021-02-17T19:49:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"02cc1cda4afbb9a5816200452708a8340cf6bcc449afe344d8316c88064c557d","abstract_canon_sha256":"2a45962a8f926d60e27726f5f2ecbdfa0ac0f018e91ea0f9deba0e8c79c88a1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:18.432294Z","signature_b64":"QdKIltIQJrKag1rTmwAZtvVVy94hLNWVkJyLq+Jqluap2ko3GJbg5R3KwjhPmLu3gT/0mfh/jF9lSbetqlwlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df0b1c5055f98d0f9f06ca98fc0c831b6089073e9218161f7ea963badb6c9112","last_reissued_at":"2026-07-05T02:16:18.431887Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:18.431887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Impartial selection with prior information","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"George Christodoulou, Ioannis Caragiannis, Nicos Protopapas","submitted_at":"2021-02-17T19:49:37Z","abstract_excerpt":"We study the problem of {\\em impartial selection}, a topic that lies at the intersection of computational social choice and mechanism design. The goal is to select the most popular individual among a set of community members. The input can be modeled as a directed graph, where each node represents an individual, and a directed edge indicates nomination or approval of a community member to another. An {\\em impartial mechanism} is robust to potential selfish behavior of the individuals and provides appropriate incentives to voters to report their true preferences by ensuring that the chance of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.09002","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/2102.09002/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":"2102.09002","created_at":"2026-07-05T02:16:18.431949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.09002v1","created_at":"2026-07-05T02:16:18.431949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.09002","created_at":"2026-07-05T02:16:18.431949+00:00"},{"alias_kind":"pith_short_12","alias_value":"34FRYUCV7GGQ","created_at":"2026-07-05T02:16:18.431949+00:00"},{"alias_kind":"pith_short_16","alias_value":"34FRYUCV7GGQ7HYG","created_at":"2026-07-05T02:16:18.431949+00:00"},{"alias_kind":"pith_short_8","alias_value":"34FRYUCV","created_at":"2026-07-05T02:16:18.431949+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/34FRYUCV7GGQ7HYGZKMPYDEDDN","json":"https://pith.science/pith/34FRYUCV7GGQ7HYGZKMPYDEDDN.json","graph_json":"https://pith.science/api/pith-number/34FRYUCV7GGQ7HYGZKMPYDEDDN/graph.json","events_json":"https://pith.science/api/pith-number/34FRYUCV7GGQ7HYGZKMPYDEDDN/events.json","paper":"https://pith.science/paper/34FRYUCV"},"agent_actions":{"view_html":"https://pith.science/pith/34FRYUCV7GGQ7HYGZKMPYDEDDN","download_json":"https://pith.science/pith/34FRYUCV7GGQ7HYGZKMPYDEDDN.json","view_paper":"https://pith.science/paper/34FRYUCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.09002&json=true","fetch_graph":"https://pith.science/api/pith-number/34FRYUCV7GGQ7HYGZKMPYDEDDN/graph.json","fetch_events":"https://pith.science/api/pith-number/34FRYUCV7GGQ7HYGZKMPYDEDDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34FRYUCV7GGQ7HYGZKMPYDEDDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34FRYUCV7GGQ7HYGZKMPYDEDDN/action/storage_attestation","attest_author":"https://pith.science/pith/34FRYUCV7GGQ7HYGZKMPYDEDDN/action/author_attestation","sign_citation":"https://pith.science/pith/34FRYUCV7GGQ7HYGZKMPYDEDDN/action/citation_signature","submit_replication":"https://pith.science/pith/34FRYUCV7GGQ7HYGZKMPYDEDDN/action/replication_record"}},"created_at":"2026-07-05T02:16:18.431949+00:00","updated_at":"2026-07-05T02:16:18.431949+00:00"}