{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EMG6HC7UGNY3BE7IPUCP36PLCC","short_pith_number":"pith:EMG6HC7U","schema_version":"1.0","canonical_sha256":"230de38bf43371b093e87d04fdf9eb1088f9cf294a8cdbc3ee0806fd18c57b0d","source":{"kind":"arxiv","id":"1905.03190","version":1},"attestation_state":"computed","paper":{"title":"Convex choice, finite choice and sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Arno Pauly, Takayuki Kihara","submitted_at":"2019-05-02T03:27:00Z","abstract_excerpt":"We study the Weihrauch degrees of closed choice for finite sets, closed choice for convex sets and sorting infinite sequences over finite alphabets. Our main results are: One, that choice for finite sets of cardinality $i + 1$ is reducible to choice for convex sets in dimension $j$, which in turn is reducible to sorting infinite sequences over an alphabet of size $k + 1$, iff $i \\leq j \\leq k$. Two, that convex choice in dimension two is not reducible to the product of convex choice in dimension one with itself. Three, that sequential composition of one-dimensional convex choice is not reducib"},"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":"1905.03190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-05-02T03:27:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"11450ccc3b1b0c8f8da7db0765642f6a8298723d917786b0aac6030dab0418b4","abstract_canon_sha256":"91ede65dfc78bdb558a346b773030e0be9fad5c4425a1d31f32faba7be51ed1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:42.600347Z","signature_b64":"Vv4rbPyAnxKSIVTWoB71JX2g5ksWCnAQPU50gV85R70u0gbPVFvQvaxMYefRDKW5nBNqWe957DrgxrfL1uTyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"230de38bf43371b093e87d04fdf9eb1088f9cf294a8cdbc3ee0806fd18c57b0d","last_reissued_at":"2026-05-17T23:46:42.599818Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:42.599818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex choice, finite choice and sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Arno Pauly, Takayuki Kihara","submitted_at":"2019-05-02T03:27:00Z","abstract_excerpt":"We study the Weihrauch degrees of closed choice for finite sets, closed choice for convex sets and sorting infinite sequences over finite alphabets. Our main results are: One, that choice for finite sets of cardinality $i + 1$ is reducible to choice for convex sets in dimension $j$, which in turn is reducible to sorting infinite sequences over an alphabet of size $k + 1$, iff $i \\leq j \\leq k$. Two, that convex choice in dimension two is not reducible to the product of convex choice in dimension one with itself. Three, that sequential composition of one-dimensional convex choice is not reducib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03190","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":"1905.03190","created_at":"2026-05-17T23:46:42.599917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03190v1","created_at":"2026-05-17T23:46:42.599917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03190","created_at":"2026-05-17T23:46:42.599917+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMG6HC7UGNY3","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMG6HC7UGNY3BE7I","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMG6HC7U","created_at":"2026-05-18T12:33:15.570797+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/EMG6HC7UGNY3BE7IPUCP36PLCC","json":"https://pith.science/pith/EMG6HC7UGNY3BE7IPUCP36PLCC.json","graph_json":"https://pith.science/api/pith-number/EMG6HC7UGNY3BE7IPUCP36PLCC/graph.json","events_json":"https://pith.science/api/pith-number/EMG6HC7UGNY3BE7IPUCP36PLCC/events.json","paper":"https://pith.science/paper/EMG6HC7U"},"agent_actions":{"view_html":"https://pith.science/pith/EMG6HC7UGNY3BE7IPUCP36PLCC","download_json":"https://pith.science/pith/EMG6HC7UGNY3BE7IPUCP36PLCC.json","view_paper":"https://pith.science/paper/EMG6HC7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03190&json=true","fetch_graph":"https://pith.science/api/pith-number/EMG6HC7UGNY3BE7IPUCP36PLCC/graph.json","fetch_events":"https://pith.science/api/pith-number/EMG6HC7UGNY3BE7IPUCP36PLCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMG6HC7UGNY3BE7IPUCP36PLCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMG6HC7UGNY3BE7IPUCP36PLCC/action/storage_attestation","attest_author":"https://pith.science/pith/EMG6HC7UGNY3BE7IPUCP36PLCC/action/author_attestation","sign_citation":"https://pith.science/pith/EMG6HC7UGNY3BE7IPUCP36PLCC/action/citation_signature","submit_replication":"https://pith.science/pith/EMG6HC7UGNY3BE7IPUCP36PLCC/action/replication_record"}},"created_at":"2026-05-17T23:46:42.599917+00:00","updated_at":"2026-05-17T23:46:42.599917+00:00"}