{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YYLUYMGZTTSZIAXR2D6CWFUM2L","short_pith_number":"pith:YYLUYMGZ","schema_version":"1.0","canonical_sha256":"c6174c30d99ce59402f1d0fc2b168cd2f5b0de0f7407d10f9f4fa74aeaa8cb53","source":{"kind":"arxiv","id":"1709.02097","version":1},"attestation_state":"computed","paper":{"title":"The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alfio Giarlotta (Dept of Economics, Business, Canada), Computer Science, Domenico Cantone (Dept. of Mathematics, Italy), Statistics, Stephen Watson (Dept. of Mathematics, Toronto, University of Catania, York University","submitted_at":"2017-09-07T06:55:10Z","abstract_excerpt":"Given a set U of alternatives, a choice (correspondence) on U is a contractive map c defined on a family Omega of nonempty subsets of U.  Semantically, a choice c associates to each menu A in Omega a nonempty subset c(A) of A comprising all elements of A that are deemed selectable by an agent. A choice on U is total if its domain is the powerset of U minus the empty set, and partial otherwise.  According to the theory of revealed preferences, a choice is rationalizable if it can be retrieved from a binary relation on U by taking all maximal elements of each menu.  It is well-known that rationa"},"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":"1709.02097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-09-07T06:55:10Z","cross_cats_sorted":[],"title_canon_sha256":"d5f0b281cb14a93b4b63d23e32dc235be1f47a89216b78a27965ce089f27d4e5","abstract_canon_sha256":"d0dae3c6f4c3e83c6ff9aa1197f5a36bdc3a63eadd807139a43c965d31861afc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:50.223090Z","signature_b64":"aWq7F902mfc2d0sP5L/ymz3ll0rIXnQra2xtBRXFqwgv+dMy680IRR8YF7w1hGihJ6u+Hw2UrTa0s8RDtF5QCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6174c30d99ce59402f1d0fc2b168cd2f5b0de0f7407d10f9f4fa74aeaa8cb53","last_reissued_at":"2026-05-18T00:35:50.222224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:50.222224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alfio Giarlotta (Dept of Economics, Business, Canada), Computer Science, Domenico Cantone (Dept. of Mathematics, Italy), Statistics, Stephen Watson (Dept. of Mathematics, Toronto, University of Catania, York University","submitted_at":"2017-09-07T06:55:10Z","abstract_excerpt":"Given a set U of alternatives, a choice (correspondence) on U is a contractive map c defined on a family Omega of nonempty subsets of U.  Semantically, a choice c associates to each menu A in Omega a nonempty subset c(A) of A comprising all elements of A that are deemed selectable by an agent. A choice on U is total if its domain is the powerset of U minus the empty set, and partial otherwise.  According to the theory of revealed preferences, a choice is rationalizable if it can be retrieved from a binary relation on U by taking all maximal elements of each menu.  It is well-known that rationa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02097","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":"1709.02097","created_at":"2026-05-18T00:35:50.222386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02097v1","created_at":"2026-05-18T00:35:50.222386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02097","created_at":"2026-05-18T00:35:50.222386+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYLUYMGZTTSZ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYLUYMGZTTSZIAXR","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYLUYMGZ","created_at":"2026-05-18T12:31:59.375834+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/YYLUYMGZTTSZIAXR2D6CWFUM2L","json":"https://pith.science/pith/YYLUYMGZTTSZIAXR2D6CWFUM2L.json","graph_json":"https://pith.science/api/pith-number/YYLUYMGZTTSZIAXR2D6CWFUM2L/graph.json","events_json":"https://pith.science/api/pith-number/YYLUYMGZTTSZIAXR2D6CWFUM2L/events.json","paper":"https://pith.science/paper/YYLUYMGZ"},"agent_actions":{"view_html":"https://pith.science/pith/YYLUYMGZTTSZIAXR2D6CWFUM2L","download_json":"https://pith.science/pith/YYLUYMGZTTSZIAXR2D6CWFUM2L.json","view_paper":"https://pith.science/paper/YYLUYMGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02097&json=true","fetch_graph":"https://pith.science/api/pith-number/YYLUYMGZTTSZIAXR2D6CWFUM2L/graph.json","fetch_events":"https://pith.science/api/pith-number/YYLUYMGZTTSZIAXR2D6CWFUM2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYLUYMGZTTSZIAXR2D6CWFUM2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYLUYMGZTTSZIAXR2D6CWFUM2L/action/storage_attestation","attest_author":"https://pith.science/pith/YYLUYMGZTTSZIAXR2D6CWFUM2L/action/author_attestation","sign_citation":"https://pith.science/pith/YYLUYMGZTTSZIAXR2D6CWFUM2L/action/citation_signature","submit_replication":"https://pith.science/pith/YYLUYMGZTTSZIAXR2D6CWFUM2L/action/replication_record"}},"created_at":"2026-05-18T00:35:50.222386+00:00","updated_at":"2026-05-18T00:35:50.222386+00:00"}