{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TIRPLJ4MVPEMSLW3F6OKO4Z63Q","short_pith_number":"pith:TIRPLJ4M","canonical_record":{"source":{"id":"1407.8535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-31T19:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"673a3da30ae61e30911de568608151a09dc98a40bcc616d510ba70b7bc4b2925","abstract_canon_sha256":"32955447e171dd1a9ebc6c802ad8f90aa25ddb3cee9d33428d275f4eee651b39"},"schema_version":"1.0"},"canonical_sha256":"9a22f5a78cabc8c92edb2f9ca7733edc36155da6af17e2b83ba687672a5e9f00","source":{"kind":"arxiv","id":"1407.8535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.8535","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1407.8535v1","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8535","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"TIRPLJ4MVPEM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TIRPLJ4MVPEMSLW3","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TIRPLJ4M","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TIRPLJ4MVPEMSLW3F6OKO4Z63Q","target":"record","payload":{"canonical_record":{"source":{"id":"1407.8535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-31T19:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"673a3da30ae61e30911de568608151a09dc98a40bcc616d510ba70b7bc4b2925","abstract_canon_sha256":"32955447e171dd1a9ebc6c802ad8f90aa25ddb3cee9d33428d275f4eee651b39"},"schema_version":"1.0"},"canonical_sha256":"9a22f5a78cabc8c92edb2f9ca7733edc36155da6af17e2b83ba687672a5e9f00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:04.938521Z","signature_b64":"4UcY6b4wOkQDZ3bQ8Zjg8YZJZwFw8ELkeoWKXklGGzaYugFJvYHKbGGYl2shDZrFqnsbTDwOa4ssp5erCdxmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a22f5a78cabc8c92edb2f9ca7733edc36155da6af17e2b83ba687672a5e9f00","last_reissued_at":"2026-05-18T02:46:04.938101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:04.938101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.8535","source_version":1,"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-18T02:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnzxcBcIVhctbYvvA9lyP+dUx8YFn5wC610ObxvUq0LXOeCz3++eGvn/zqBfDXP7KBTiFfE8PBv23Ts0d2SwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:32:42.470418Z"},"content_sha256":"5761be3417c6c93fc8fff5037080448bf4f7b5801435310c2b32a316e5b14c5c","schema_version":"1.0","event_id":"sha256:5761be3417c6c93fc8fff5037080448bf4f7b5801435310c2b32a316e5b14c5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TIRPLJ4MVPEMSLW3F6OKO4Z63Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Near-Optimal Mechanism for Impartial Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Adrian Vetta, Nicolas Bousquet, Sergey Norin","submitted_at":"2014-07-31T19:02:27Z","abstract_excerpt":"We examine strategy-proof elections to select a winner amongst a set of agents, each of whom cares only about winning. This impartial selection problem was introduced independently by Holzman and Moulin and Alon et al. Fisher and Klimm showed that the permutation mechanism is impartial and $1/2$-optimal, that is, it selects an agent who gains, in expectation, at least half the number of votes of most popular agent. Furthermore, they showed the mechanism is $7/12$-optimal if agents cannot abstain in the election. We show that a better guarantee is possible, provided the most popular agent recei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8535","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":""},"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-18T02:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+0vCC2x+oMZAw8D2zgeZFn5iU5yNxNXD9uMHeFCHJ/oKS8boOPgcpUSD5QK6X51qBKnM8WXUh93YD5asy3BCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:32:42.471117Z"},"content_sha256":"4d6f63344ba79e1c5e0661f31cbebab7869893c40f92243064bdecab83567cab","schema_version":"1.0","event_id":"sha256:4d6f63344ba79e1c5e0661f31cbebab7869893c40f92243064bdecab83567cab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TIRPLJ4MVPEMSLW3F6OKO4Z63Q/bundle.json","state_url":"https://pith.science/pith/TIRPLJ4MVPEMSLW3F6OKO4Z63Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TIRPLJ4MVPEMSLW3F6OKO4Z63Q/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-05-25T19:32:42Z","links":{"resolver":"https://pith.science/pith/TIRPLJ4MVPEMSLW3F6OKO4Z63Q","bundle":"https://pith.science/pith/TIRPLJ4MVPEMSLW3F6OKO4Z63Q/bundle.json","state":"https://pith.science/pith/TIRPLJ4MVPEMSLW3F6OKO4Z63Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TIRPLJ4MVPEMSLW3F6OKO4Z63Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TIRPLJ4MVPEMSLW3F6OKO4Z63Q","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":"32955447e171dd1a9ebc6c802ad8f90aa25ddb3cee9d33428d275f4eee651b39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-31T19:02:27Z","title_canon_sha256":"673a3da30ae61e30911de568608151a09dc98a40bcc616d510ba70b7bc4b2925"},"schema_version":"1.0","source":{"id":"1407.8535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.8535","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1407.8535v1","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.8535","created_at":"2026-05-18T02:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"TIRPLJ4MVPEM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TIRPLJ4MVPEMSLW3","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TIRPLJ4M","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:4d6f63344ba79e1c5e0661f31cbebab7869893c40f92243064bdecab83567cab","target":"graph","created_at":"2026-05-18T02:46:04Z","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":"We examine strategy-proof elections to select a winner amongst a set of agents, each of whom cares only about winning. This impartial selection problem was introduced independently by Holzman and Moulin and Alon et al. Fisher and Klimm showed that the permutation mechanism is impartial and $1/2$-optimal, that is, it selects an agent who gains, in expectation, at least half the number of votes of most popular agent. Furthermore, they showed the mechanism is $7/12$-optimal if agents cannot abstain in the election. We show that a better guarantee is possible, provided the most popular agent recei","authors_text":"Adrian Vetta, Nicolas Bousquet, Sergey Norin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-31T19:02:27Z","title":"A Near-Optimal Mechanism for Impartial Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.8535","kind":"arxiv","version":1},"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:5761be3417c6c93fc8fff5037080448bf4f7b5801435310c2b32a316e5b14c5c","target":"record","created_at":"2026-05-18T02:46:04Z","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":"32955447e171dd1a9ebc6c802ad8f90aa25ddb3cee9d33428d275f4eee651b39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-31T19:02:27Z","title_canon_sha256":"673a3da30ae61e30911de568608151a09dc98a40bcc616d510ba70b7bc4b2925"},"schema_version":"1.0","source":{"id":"1407.8535","kind":"arxiv","version":1}},"canonical_sha256":"9a22f5a78cabc8c92edb2f9ca7733edc36155da6af17e2b83ba687672a5e9f00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a22f5a78cabc8c92edb2f9ca7733edc36155da6af17e2b83ba687672a5e9f00","first_computed_at":"2026-05-18T02:46:04.938101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:04.938101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4UcY6b4wOkQDZ3bQ8Zjg8YZJZwFw8ELkeoWKXklGGzaYugFJvYHKbGGYl2shDZrFqnsbTDwOa4ssp5erCdxmBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:04.938521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.8535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5761be3417c6c93fc8fff5037080448bf4f7b5801435310c2b32a316e5b14c5c","sha256:4d6f63344ba79e1c5e0661f31cbebab7869893c40f92243064bdecab83567cab"],"state_sha256":"452275e4b37c20e86e593488963a98e9014ff4719080a5fec6241aa3a660179b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+gExkMj6d04t0RjgXA/aP9mSAYrxCpnkqgnnEhJhBp0b6Ti5fQmhQdDxoFoASjRunWtlR3VivQ7G1l1H4dVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:32:42.475178Z","bundle_sha256":"acb934a63371827aaa1e31dcdbfbb28c1cdc29ee98cd8e723d06d58b74857f54"}}