{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VS7Z2UEBZB72VQ4X26AJFXFIEB","short_pith_number":"pith:VS7Z2UEB","schema_version":"1.0","canonical_sha256":"acbf9d5081c87faac397d78092dca82063f4d850292294d875b26312809b5514","source":{"kind":"arxiv","id":"1401.3866","version":1},"attestation_state":"computed","paper":{"title":"Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.MA"],"primary_cat":"cs.AI","authors_text":"Christian Geist, Ulle Endriss","submitted_at":"2014-01-16T05:06:28Z","abstract_excerpt":"We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets of objects. The key question in this area, which has important applications in social choice theory and decision making under uncertainty, is how to extend an agents preferences over a number of objects to a preference relation over nonempty sets of such objects. Certain combinations of seemingly natural principles for this kind of preference extension can result in logical inconsistencies, which has led to a number of "},"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":"1401.3866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-01-16T05:06:28Z","cross_cats_sorted":["cs.LO","cs.MA"],"title_canon_sha256":"31c07e868bb6f8256dcc5eb89d61b6505f688433b21ef7d55de9471f8b7e249a","abstract_canon_sha256":"79a7baea1fcdcc2c911f237068e6c7e56f4463bc710f1492943b19ac3367bde8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.435859Z","signature_b64":"WS89tfdQqmM0I0RHWKHcxg4lmElPRLtzBtgZ03q8Y8KafQ4DfN4/P1/iDuf/+X9Mb2B5casvB1IQyvY9x/s5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acbf9d5081c87faac397d78092dca82063f4d850292294d875b26312809b5514","last_reissued_at":"2026-05-18T03:02:06.434929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.434929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","cs.MA"],"primary_cat":"cs.AI","authors_text":"Christian Geist, Ulle Endriss","submitted_at":"2014-01-16T05:06:28Z","abstract_excerpt":"We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets of objects. The key question in this area, which has important applications in social choice theory and decision making under uncertainty, is how to extend an agents preferences over a number of objects to a preference relation over nonempty sets of such objects. Certain combinations of seemingly natural principles for this kind of preference extension can result in logical inconsistencies, which has led to a number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3866","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":"1401.3866","created_at":"2026-05-18T03:02:06.435116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3866v1","created_at":"2026-05-18T03:02:06.435116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3866","created_at":"2026-05-18T03:02:06.435116+00:00"},{"alias_kind":"pith_short_12","alias_value":"VS7Z2UEBZB72","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VS7Z2UEBZB72VQ4X","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VS7Z2UEB","created_at":"2026-05-18T12:28:54.890064+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/VS7Z2UEBZB72VQ4X26AJFXFIEB","json":"https://pith.science/pith/VS7Z2UEBZB72VQ4X26AJFXFIEB.json","graph_json":"https://pith.science/api/pith-number/VS7Z2UEBZB72VQ4X26AJFXFIEB/graph.json","events_json":"https://pith.science/api/pith-number/VS7Z2UEBZB72VQ4X26AJFXFIEB/events.json","paper":"https://pith.science/paper/VS7Z2UEB"},"agent_actions":{"view_html":"https://pith.science/pith/VS7Z2UEBZB72VQ4X26AJFXFIEB","download_json":"https://pith.science/pith/VS7Z2UEBZB72VQ4X26AJFXFIEB.json","view_paper":"https://pith.science/paper/VS7Z2UEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3866&json=true","fetch_graph":"https://pith.science/api/pith-number/VS7Z2UEBZB72VQ4X26AJFXFIEB/graph.json","fetch_events":"https://pith.science/api/pith-number/VS7Z2UEBZB72VQ4X26AJFXFIEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VS7Z2UEBZB72VQ4X26AJFXFIEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VS7Z2UEBZB72VQ4X26AJFXFIEB/action/storage_attestation","attest_author":"https://pith.science/pith/VS7Z2UEBZB72VQ4X26AJFXFIEB/action/author_attestation","sign_citation":"https://pith.science/pith/VS7Z2UEBZB72VQ4X26AJFXFIEB/action/citation_signature","submit_replication":"https://pith.science/pith/VS7Z2UEBZB72VQ4X26AJFXFIEB/action/replication_record"}},"created_at":"2026-05-18T03:02:06.435116+00:00","updated_at":"2026-05-18T03:02:06.435116+00:00"}