{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7BMSXP4HSUCEHHURZGIQLPRDCD","short_pith_number":"pith:7BMSXP4H","schema_version":"1.0","canonical_sha256":"f8592bbf879504439e91c99105be2310f5d7b6cc70a35f5e81e87cd3da1b362b","source":{"kind":"arxiv","id":"1604.00258","version":3},"attestation_state":"computed","paper":{"title":"Computable dyadic subbases and $\\mathbf{T}^\\omega$-representations of compact sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Arno Pauly, Hideki Tsuiki","submitted_at":"2016-04-01T14:24:02Z","abstract_excerpt":"We explore representing the compact subsets of a given represented space by infinite sequences over Plotkin's $\\mathbb{T}$. We show that computably compact computable metric spaces admit representations of their compact subsets in such a way that compact sets are essentially underspecified points. We can even ensure that a name of an $n$-element compact set contains $n$ occurrences of $\\bot$. We undergo this study effectively and show that such a $\\mathbb{T}^\\omega$-representation is effectively obtained from structures of computably compact computable metric spaces. As an application, we prov"},"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":"1604.00258","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-04-01T14:24:02Z","cross_cats_sorted":[],"title_canon_sha256":"02b268b604e65c030bba5e7e5b7a0d0a3235b9764b1315c471a0fe9c4c6e321c","abstract_canon_sha256":"646f98ba3e42a5c707f95bc343d18dcfb5656c2a6f2712de4c3d263d91b7ecbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.326029Z","signature_b64":"4bLLBJLsfvMUc9ZLZQlQ7zHuTvRfHoamRKY9n2yLsEH5k+OvdCzUEYi1boeyLAgDg2gbOnCTPC+bq9hQSk6lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8592bbf879504439e91c99105be2310f5d7b6cc70a35f5e81e87cd3da1b362b","last_reissued_at":"2026-05-17T23:59:18.325539Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.325539Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computable dyadic subbases and $\\mathbf{T}^\\omega$-representations of compact sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Arno Pauly, Hideki Tsuiki","submitted_at":"2016-04-01T14:24:02Z","abstract_excerpt":"We explore representing the compact subsets of a given represented space by infinite sequences over Plotkin's $\\mathbb{T}$. We show that computably compact computable metric spaces admit representations of their compact subsets in such a way that compact sets are essentially underspecified points. We can even ensure that a name of an $n$-element compact set contains $n$ occurrences of $\\bot$. We undergo this study effectively and show that such a $\\mathbb{T}^\\omega$-representation is effectively obtained from structures of computably compact computable metric spaces. As an application, we prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00258","kind":"arxiv","version":3},"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":"1604.00258","created_at":"2026-05-17T23:59:18.325603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00258v3","created_at":"2026-05-17T23:59:18.325603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00258","created_at":"2026-05-17T23:59:18.325603+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BMSXP4HSUCE","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BMSXP4HSUCEHHUR","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BMSXP4H","created_at":"2026-05-18T12:30:04.600751+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/7BMSXP4HSUCEHHURZGIQLPRDCD","json":"https://pith.science/pith/7BMSXP4HSUCEHHURZGIQLPRDCD.json","graph_json":"https://pith.science/api/pith-number/7BMSXP4HSUCEHHURZGIQLPRDCD/graph.json","events_json":"https://pith.science/api/pith-number/7BMSXP4HSUCEHHURZGIQLPRDCD/events.json","paper":"https://pith.science/paper/7BMSXP4H"},"agent_actions":{"view_html":"https://pith.science/pith/7BMSXP4HSUCEHHURZGIQLPRDCD","download_json":"https://pith.science/pith/7BMSXP4HSUCEHHURZGIQLPRDCD.json","view_paper":"https://pith.science/paper/7BMSXP4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00258&json=true","fetch_graph":"https://pith.science/api/pith-number/7BMSXP4HSUCEHHURZGIQLPRDCD/graph.json","fetch_events":"https://pith.science/api/pith-number/7BMSXP4HSUCEHHURZGIQLPRDCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BMSXP4HSUCEHHURZGIQLPRDCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BMSXP4HSUCEHHURZGIQLPRDCD/action/storage_attestation","attest_author":"https://pith.science/pith/7BMSXP4HSUCEHHURZGIQLPRDCD/action/author_attestation","sign_citation":"https://pith.science/pith/7BMSXP4HSUCEHHURZGIQLPRDCD/action/citation_signature","submit_replication":"https://pith.science/pith/7BMSXP4HSUCEHHURZGIQLPRDCD/action/replication_record"}},"created_at":"2026-05-17T23:59:18.325603+00:00","updated_at":"2026-05-17T23:59:18.325603+00:00"}