{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:HDTBKPYCQU2IDGEKCQJOJNJXME","short_pith_number":"pith:HDTBKPYC","schema_version":"1.0","canonical_sha256":"38e6153f02853481988a1412e4b5376106e94e729d9fdd61148de6221b1e845e","source":{"kind":"arxiv","id":"2106.00312","version":2},"attestation_state":"computed","paper":{"title":"Maximal towers and ultrafilter bases in computability","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Andre Nies, Joseph S. Miller, Mariya Soskova, Steffen Lempp","submitted_at":"2021-06-01T08:41:00Z","abstract_excerpt":"The tower number $\\mathfrak t$ and the ultrafilter number $\\mathfrak u$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of~$\\omega$ and the almost inclusion relation $\\subseteq^*$ between such subsets. We consider analogs of these cardinal characteristics in computability theory.\n  We show that the mass problem of ultrafilter bases is equivalent to the mass problem of computing a function that dominates all computable functions, and hence, by Martin's characterization, it captures highness. On the other hand, the mass problem for m"},"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":"2106.00312","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.LO","submitted_at":"2021-06-01T08:41:00Z","cross_cats_sorted":[],"title_canon_sha256":"3b6a972fbe1de624f32b4d569e59dcf7df191719d813d34b5e985abd30968c35","abstract_canon_sha256":"993beb801bd0b50ef24da349f15ece023ff301722031c891c78bc8b3afdfa879"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:25.235678Z","signature_b64":"xNUjFxKr8jUnXT3mzbQIbH2PtoYNJ0xs8g1wQ1W+hsvsRnVxWjVWbVaVLICL4FYGvstixLAb4MJ2eKmQD+gnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38e6153f02853481988a1412e4b5376106e94e729d9fdd61148de6221b1e845e","last_reissued_at":"2026-07-05T09:15:25.235175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:25.235175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal towers and ultrafilter bases in computability","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Andre Nies, Joseph S. Miller, Mariya Soskova, Steffen Lempp","submitted_at":"2021-06-01T08:41:00Z","abstract_excerpt":"The tower number $\\mathfrak t$ and the ultrafilter number $\\mathfrak u$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of~$\\omega$ and the almost inclusion relation $\\subseteq^*$ between such subsets. We consider analogs of these cardinal characteristics in computability theory.\n  We show that the mass problem of ultrafilter bases is equivalent to the mass problem of computing a function that dominates all computable functions, and hence, by Martin's characterization, it captures highness. On the other hand, the mass problem for m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00312","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.00312/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.00312","created_at":"2026-07-05T09:15:25.235227+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.00312v2","created_at":"2026-07-05T09:15:25.235227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00312","created_at":"2026-07-05T09:15:25.235227+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDTBKPYCQU2I","created_at":"2026-07-05T09:15:25.235227+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDTBKPYCQU2IDGEK","created_at":"2026-07-05T09:15:25.235227+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDTBKPYC","created_at":"2026-07-05T09:15:25.235227+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/HDTBKPYCQU2IDGEKCQJOJNJXME","json":"https://pith.science/pith/HDTBKPYCQU2IDGEKCQJOJNJXME.json","graph_json":"https://pith.science/api/pith-number/HDTBKPYCQU2IDGEKCQJOJNJXME/graph.json","events_json":"https://pith.science/api/pith-number/HDTBKPYCQU2IDGEKCQJOJNJXME/events.json","paper":"https://pith.science/paper/HDTBKPYC"},"agent_actions":{"view_html":"https://pith.science/pith/HDTBKPYCQU2IDGEKCQJOJNJXME","download_json":"https://pith.science/pith/HDTBKPYCQU2IDGEKCQJOJNJXME.json","view_paper":"https://pith.science/paper/HDTBKPYC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.00312&json=true","fetch_graph":"https://pith.science/api/pith-number/HDTBKPYCQU2IDGEKCQJOJNJXME/graph.json","fetch_events":"https://pith.science/api/pith-number/HDTBKPYCQU2IDGEKCQJOJNJXME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDTBKPYCQU2IDGEKCQJOJNJXME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDTBKPYCQU2IDGEKCQJOJNJXME/action/storage_attestation","attest_author":"https://pith.science/pith/HDTBKPYCQU2IDGEKCQJOJNJXME/action/author_attestation","sign_citation":"https://pith.science/pith/HDTBKPYCQU2IDGEKCQJOJNJXME/action/citation_signature","submit_replication":"https://pith.science/pith/HDTBKPYCQU2IDGEKCQJOJNJXME/action/replication_record"}},"created_at":"2026-07-05T09:15:25.235227+00:00","updated_at":"2026-07-05T09:15:25.235227+00:00"}