{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:J56W234TDARK4IRGYUZQTODEPH","short_pith_number":"pith:J56W234T","schema_version":"1.0","canonical_sha256":"4f7d6d6f931822ae2226c53309b86479d3be762a3289e56cb5d956817af4fb7e","source":{"kind":"arxiv","id":"1211.0515","version":1},"attestation_state":"computed","paper":{"title":"Computing with voting trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jennifer Iglesias, Nathaniel Ince, Po-Shen Loh","submitted_at":"2012-11-02T18:31:03Z","abstract_excerpt":"The classical paradox of social choice theory asserts that there is no fair way to deterministically select a winner in an election among more than two candidates; the only definite collective preferences are between individual pairs of candidates. Combinatorially, one may summarize this information with a graph-theoretic tournament on N vertices (one per candidate), placing an edge from U to V if U would beat V in an election between only those two candidates (no ties are permitted). One well-studied procedure for selecting a winner is to specify a complete binary tree whose leaves are labele"},"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":"1211.0515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-02T18:31:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"80c13821445b456aa6675f5b2e0c33bc8498a26afc0438a50d9bc33f11bbf85b","abstract_canon_sha256":"2f03c4e8d131fc1e2b034e7fa40002b3592ef94493c1042d1872bf7e807d9906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:40.739688Z","signature_b64":"uoIDp/2H51/pf7xhwzTzdNIvbUklnkWxdoUKBvE22B2Dp6W+CJKYKyumVMyIOPQsh+3N4IxM9ZI4bi7rhUhmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f7d6d6f931822ae2226c53309b86479d3be762a3289e56cb5d956817af4fb7e","last_reissued_at":"2026-05-18T03:41:40.738910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:40.738910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing with voting trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jennifer Iglesias, Nathaniel Ince, Po-Shen Loh","submitted_at":"2012-11-02T18:31:03Z","abstract_excerpt":"The classical paradox of social choice theory asserts that there is no fair way to deterministically select a winner in an election among more than two candidates; the only definite collective preferences are between individual pairs of candidates. Combinatorially, one may summarize this information with a graph-theoretic tournament on N vertices (one per candidate), placing an edge from U to V if U would beat V in an election between only those two candidates (no ties are permitted). One well-studied procedure for selecting a winner is to specify a complete binary tree whose leaves are labele"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0515","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.0515","created_at":"2026-05-18T03:41:40.739026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0515v1","created_at":"2026-05-18T03:41:40.739026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0515","created_at":"2026-05-18T03:41:40.739026+00:00"},{"alias_kind":"pith_short_12","alias_value":"J56W234TDARK","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"J56W234TDARK4IRG","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"J56W234T","created_at":"2026-05-18T12:27:09.501522+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/J56W234TDARK4IRGYUZQTODEPH","json":"https://pith.science/pith/J56W234TDARK4IRGYUZQTODEPH.json","graph_json":"https://pith.science/api/pith-number/J56W234TDARK4IRGYUZQTODEPH/graph.json","events_json":"https://pith.science/api/pith-number/J56W234TDARK4IRGYUZQTODEPH/events.json","paper":"https://pith.science/paper/J56W234T"},"agent_actions":{"view_html":"https://pith.science/pith/J56W234TDARK4IRGYUZQTODEPH","download_json":"https://pith.science/pith/J56W234TDARK4IRGYUZQTODEPH.json","view_paper":"https://pith.science/paper/J56W234T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0515&json=true","fetch_graph":"https://pith.science/api/pith-number/J56W234TDARK4IRGYUZQTODEPH/graph.json","fetch_events":"https://pith.science/api/pith-number/J56W234TDARK4IRGYUZQTODEPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J56W234TDARK4IRGYUZQTODEPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J56W234TDARK4IRGYUZQTODEPH/action/storage_attestation","attest_author":"https://pith.science/pith/J56W234TDARK4IRGYUZQTODEPH/action/author_attestation","sign_citation":"https://pith.science/pith/J56W234TDARK4IRGYUZQTODEPH/action/citation_signature","submit_replication":"https://pith.science/pith/J56W234TDARK4IRGYUZQTODEPH/action/replication_record"}},"created_at":"2026-05-18T03:41:40.739026+00:00","updated_at":"2026-05-18T03:41:40.739026+00:00"}