{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XP364HCVXPSEUUVTTVO3HJ2YGX","short_pith_number":"pith:XP364HCV","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"},"canonical_sha256":"bbf7ee1c55bbe44a52b39d5db3a75835d2ec35f3cbbc372b04ed3f2d397a12ab","source":{"kind":"arxiv","id":"2503.20470","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.20470","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2503.20470v2","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.20470","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"XP364HCVXPSE","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"XP364HCVXPSEUUVT","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"XP364HCV","created_at":"2026-06-25T01:18:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XP364HCVXPSEUUVTTVO3HJ2YGX","target":"record","payload":{"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"},"canonical_sha256":"bbf7ee1c55bbe44a52b39d5db3a75835d2ec35f3cbbc372b04ed3f2d397a12ab","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"},"source_kind":"arxiv","source_id":"2503.20470","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-25T01:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkfAd8tDhw/l/gT227fuUEGuCrJbkZ0oD6JRw+002jjSmFiruYkDCUEb/CF9odaQZxVTvRwnyintVsLfvMUaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:57:59.503909Z"},"content_sha256":"99678ac0b2d18c5b73f5d75324b61b391e6e185c22a3a84904af218e1bcbe3f5","schema_version":"1.0","event_id":"sha256:99678ac0b2d18c5b73f5d75324b61b391e6e185c22a3a84904af218e1bcbe3f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XP364HCVXPSEUUVTTVO3HJ2YGX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-25T01:18:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cphn5fikkvyjQpfeAwH+jx6z8BArAqUywJfi6ZPc+VnSyJYUbAsJ1erD4U3SvHPPiDAltjHCfzF6+8+L5l3WCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T00:57:59.504278Z"},"content_sha256":"e6ba1b6815896ecbe4ae58885c227ad9027bb56480b0e16b2fb97a8ef0799ad2","schema_version":"1.0","event_id":"sha256:e6ba1b6815896ecbe4ae58885c227ad9027bb56480b0e16b2fb97a8ef0799ad2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/bundle.json","state_url":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T00:57:59Z","links":{"resolver":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX","bundle":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/bundle.json","state":"https://pith.science/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XP364HCVXPSEUUVTTVO3HJ2YGX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XP364HCVXPSEUUVTTVO3HJ2YGX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8f6b1408c25e4028cb17bcc9a6e5c631b7f170e24fa5db993d5fb5790c080e1d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2025-03-26T11:52:19Z","title_canon_sha256":"1f6c6359a69657df991a2df372437b5366e1c8e9c5288bd6befd03b06e69a375"},"schema_version":"1.0","source":{"id":"2503.20470","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.20470","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"arxiv_version","alias_value":"2503.20470v2","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.20470","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_12","alias_value":"XP364HCVXPSE","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_16","alias_value":"XP364HCVXPSEUUVT","created_at":"2026-06-25T01:18:34Z"},{"alias_kind":"pith_short_8","alias_value":"XP364HCV","created_at":"2026-06-25T01:18:34Z"}],"graph_snapshots":[{"event_id":"sha256:e6ba1b6815896ecbe4ae58885c227ad9027bb56480b0e16b2fb97a8ef0799ad2","target":"graph","created_at":"2026-06-25T01:18:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.20470/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Fedor Pakhomov, Hanul Jeon, James Walsh, Patrick Lutz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2025-03-26T11:52:19Z","title":"Ranking theories via encoded $\\beta$-models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.20470","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:99678ac0b2d18c5b73f5d75324b61b391e6e185c22a3a84904af218e1bcbe3f5","target":"record","created_at":"2026-06-25T01:18:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8f6b1408c25e4028cb17bcc9a6e5c631b7f170e24fa5db993d5fb5790c080e1d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2025-03-26T11:52:19Z","title_canon_sha256":"1f6c6359a69657df991a2df372437b5366e1c8e9c5288bd6befd03b06e69a375"},"schema_version":"1.0","source":{"id":"2503.20470","kind":"arxiv","version":2}},"canonical_sha256":"bbf7ee1c55bbe44a52b39d5db3a75835d2ec35f3cbbc372b04ed3f2d397a12ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbf7ee1c55bbe44a52b39d5db3a75835d2ec35f3cbbc372b04ed3f2d397a12ab","first_computed_at":"2026-06-25T01:18:34.304172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:34.304172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rzS5KivNgh+AYZC40VnDPJf5zX2iakux8mpZ53iDStVfPY33V47H91XNW3EJ0xItYePYseLmAGdCLIBvBgx8CA==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:34.304626Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.20470","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99678ac0b2d18c5b73f5d75324b61b391e6e185c22a3a84904af218e1bcbe3f5","sha256:e6ba1b6815896ecbe4ae58885c227ad9027bb56480b0e16b2fb97a8ef0799ad2"],"state_sha256":"782d6294f83e78f0118bf06ea31f23317759a8863bb710530402cf8f84beb867"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y8e/Xq3DSjzkaPYvvn1vM6pGcrjLBcEEv4p1175y5v0gH7dKhHil9B9qxAeoHgsiXbFgRy/XHYR6g49rn+j3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T00:57:59.506811Z","bundle_sha256":"aae4f176f5e361e818551bd85799e5c04ed2f147971664f20ca7945a03decd06"}}