{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XP364HCVXPSEUUVTTVO3HJ2YGX","short_pith_number":"pith:XP364HCV","schema_version":"1.0","canonical_sha256":"bbf7ee1c55bbe44a52b39d5db3a75835d2ec35f3cbbc372b04ed3f2d397a12ab","source":{"kind":"arxiv","id":"2503.20470","version":2},"attestation_state":"computed","paper":{"title":"Ranking theories via encoded $\\beta$-models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Fedor Pakhomov, Hanul Jeon, James Walsh, Patrick Lutz","submitted_at":"2025-03-26T11:52:19Z","abstract_excerpt":"Ranking theories according to their strength is a recurring motif in mathematical logic. We introduce a new ranking of arbitrary (not necessarily recursively axiomatized) theories in terms of the encoding power of their $\\beta$-models: $T\\prec_\\beta U$ if every $\\beta$-model of $U$ contains a countable coded $\\beta$-model of $T$. The restriction of $\\prec_\\beta$ to theories with $\\beta$-models is well-founded. We establish fundamental properties of the attendant ranking. First, though there are continuum-many theories, every theory has countable $\\prec_\\beta$-rank. Second, the $\\prec_\\beta$-ra"},"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":"2503.20470","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2025-03-26T11:52:19Z","cross_cats_sorted":[],"title_canon_sha256":"1f6c6359a69657df991a2df372437b5366e1c8e9c5288bd6befd03b06e69a375","abstract_canon_sha256":"8f6b1408c25e4028cb17bcc9a6e5c631b7f170e24fa5db993d5fb5790c080e1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:34.304626Z","signature_b64":"rzS5KivNgh+AYZC40VnDPJf5zX2iakux8mpZ53iDStVfPY33V47H91XNW3EJ0xItYePYseLmAGdCLIBvBgx8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbf7ee1c55bbe44a52b39d5db3a75835d2ec35f3cbbc372b04ed3f2d397a12ab","last_reissued_at":"2026-06-25T01:18:34.304172Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:34.304172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ranking theories via encoded $\\beta$-models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Fedor Pakhomov, Hanul Jeon, James Walsh, Patrick Lutz","submitted_at":"2025-03-26T11:52:19Z","abstract_excerpt":"Ranking theories according to their strength is a recurring motif in mathematical logic. We introduce a new ranking of arbitrary (not necessarily recursively axiomatized) theories in terms of the encoding power of their $\\beta$-models: $T\\prec_\\beta U$ if every $\\beta$-model of $U$ contains a countable coded $\\beta$-model of $T$. The restriction of $\\prec_\\beta$ to theories with $\\beta$-models is well-founded. We establish fundamental properties of the attendant ranking. First, though there are continuum-many theories, every theory has countable $\\prec_\\beta$-rank. Second, the $\\prec_\\beta$-ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.20470","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/2503.20470/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":"2503.20470","created_at":"2026-06-25T01:18:34.304230+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.20470v2","created_at":"2026-06-25T01:18:34.304230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.20470","created_at":"2026-06-25T01:18:34.304230+00:00"},{"alias_kind":"pith_short_12","alias_value":"XP364HCVXPSE","created_at":"2026-06-25T01:18:34.304230+00:00"},{"alias_kind":"pith_short_16","alias_value":"XP364HCVXPSEUUVT","created_at":"2026-06-25T01:18:34.304230+00:00"},{"alias_kind":"pith_short_8","alias_value":"XP364HCV","created_at":"2026-06-25T01:18:34.304230+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/XP364HCVXPSEUUVTTVO3HJ2YGX","json":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX.json","graph_json":"https://pith.science/api/pith-number/XP364HCVXPSEUUVTTVO3HJ2YGX/graph.json","events_json":"https://pith.science/api/pith-number/XP364HCVXPSEUUVTTVO3HJ2YGX/events.json","paper":"https://pith.science/paper/XP364HCV"},"agent_actions":{"view_html":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX","download_json":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX.json","view_paper":"https://pith.science/paper/XP364HCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.20470&json=true","fetch_graph":"https://pith.science/api/pith-number/XP364HCVXPSEUUVTTVO3HJ2YGX/graph.json","fetch_events":"https://pith.science/api/pith-number/XP364HCVXPSEUUVTTVO3HJ2YGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/action/storage_attestation","attest_author":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/action/author_attestation","sign_citation":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/action/citation_signature","submit_replication":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/action/replication_record"}},"created_at":"2026-06-25T01:18:34.304230+00:00","updated_at":"2026-06-25T01:18:34.304230+00:00"}