{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RS6PQR4ANEVYKXJGFDPJ7AKVEI","short_pith_number":"pith:RS6PQR4A","schema_version":"1.0","canonical_sha256":"8cbcf84780692b855d2628de9f815522223bd69b929a7be5da02a22b9cfad308","source":{"kind":"arxiv","id":"1807.03978","version":3},"attestation_state":"computed","paper":{"title":"Sequential Voting with Confirmation Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Moshe Tennenholtz, Oren Dean, Yakov Babichenko","submitted_at":"2018-07-11T07:50:32Z","abstract_excerpt":"We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects a chairperson, or when peer researchers select a prize winner. Our model assumes that each voter either renders worthy (confirms) or unworthy any other agent. We further assume that the prime goal of each agent is to be selected himself. Only if that is not feasible, will he try to get one of those that he confirms selected. In this paper, we investigate the"},"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":"1807.03978","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2018-07-11T07:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"313d44dcf64233e2d6feced5b0e812a75d6f276992864bc8d65dbcfcb5a1dbad","abstract_canon_sha256":"769bab291f23243fb092b1282fd06143188a360821ea9ba3764ba33535af330f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:04.370585Z","signature_b64":"gOTAdP7ubV5Sr4aky4SZYSlSVP9Kw1eXq52mKN3jzNFzX9pt2otgiyZfM9R3JhmReTq2KjwEOo510cVyQxIlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cbcf84780692b855d2628de9f815522223bd69b929a7be5da02a22b9cfad308","last_reissued_at":"2026-05-17T23:40:04.369843Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:04.369843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Voting with Confirmation Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Moshe Tennenholtz, Oren Dean, Yakov Babichenko","submitted_at":"2018-07-11T07:50:32Z","abstract_excerpt":"We discuss voting scenarios in which the set of voters (agents) and the set of alternatives are the same; that is, voters select a single representative from among themselves. Such a scenario happens, for instance, when a committee selects a chairperson, or when peer researchers select a prize winner. Our model assumes that each voter either renders worthy (confirms) or unworthy any other agent. We further assume that the prime goal of each agent is to be selected himself. Only if that is not feasible, will he try to get one of those that he confirms selected. In this paper, we investigate the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03978","kind":"arxiv","version":3},"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":"1807.03978","created_at":"2026-05-17T23:40:04.369970+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03978v3","created_at":"2026-05-17T23:40:04.369970+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03978","created_at":"2026-05-17T23:40:04.369970+00:00"},{"alias_kind":"pith_short_12","alias_value":"RS6PQR4ANEVY","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RS6PQR4ANEVYKXJG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RS6PQR4A","created_at":"2026-05-18T12:32:50.500415+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/RS6PQR4ANEVYKXJGFDPJ7AKVEI","json":"https://pith.science/pith/RS6PQR4ANEVYKXJGFDPJ7AKVEI.json","graph_json":"https://pith.science/api/pith-number/RS6PQR4ANEVYKXJGFDPJ7AKVEI/graph.json","events_json":"https://pith.science/api/pith-number/RS6PQR4ANEVYKXJGFDPJ7AKVEI/events.json","paper":"https://pith.science/paper/RS6PQR4A"},"agent_actions":{"view_html":"https://pith.science/pith/RS6PQR4ANEVYKXJGFDPJ7AKVEI","download_json":"https://pith.science/pith/RS6PQR4ANEVYKXJGFDPJ7AKVEI.json","view_paper":"https://pith.science/paper/RS6PQR4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03978&json=true","fetch_graph":"https://pith.science/api/pith-number/RS6PQR4ANEVYKXJGFDPJ7AKVEI/graph.json","fetch_events":"https://pith.science/api/pith-number/RS6PQR4ANEVYKXJGFDPJ7AKVEI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RS6PQR4ANEVYKXJGFDPJ7AKVEI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RS6PQR4ANEVYKXJGFDPJ7AKVEI/action/storage_attestation","attest_author":"https://pith.science/pith/RS6PQR4ANEVYKXJGFDPJ7AKVEI/action/author_attestation","sign_citation":"https://pith.science/pith/RS6PQR4ANEVYKXJGFDPJ7AKVEI/action/citation_signature","submit_replication":"https://pith.science/pith/RS6PQR4ANEVYKXJGFDPJ7AKVEI/action/replication_record"}},"created_at":"2026-05-17T23:40:04.369970+00:00","updated_at":"2026-05-17T23:40:04.369970+00:00"}