{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GYXROXN3LKF6RBMLHS3TDTXHFL","short_pith_number":"pith:GYXROXN3","schema_version":"1.0","canonical_sha256":"362f175dbb5a8be8858b3cb731cee72acf37325ed2bed2652235af5131a8ef15","source":{"kind":"arxiv","id":"2411.12084","version":2},"attestation_state":"computed","paper":{"title":"Scott Spectral Gaps are Bounded for Linear Orderings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"David Gonzalez, Matthew Harrison-Trainor","submitted_at":"2024-11-18T21:49:46Z","abstract_excerpt":"We demonstrate that any $\\Pi_\\alpha$ sentence of the infinitary logic $L_{\\omega_1 \\omega}$ extending the theory of linear orderings has a model with a $\\Pi_{\\alpha+4}$ Scott sentence and hence of Scott rank at most $\\alpha+3$. In other words, the gap between the complexity of the theory and the complexity of the simplest model is always bounded by $4$. This contrasts the situation with general structures where for any $\\alpha$ there is a $\\Pi_2$ sentence all of whose models have Scott rank $\\alpha$. We also give new lower bounds, though there remains a small gap between our lower and upper bo"},"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":"2411.12084","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-11-18T21:49:46Z","cross_cats_sorted":[],"title_canon_sha256":"b0159ca77452af74f4e22a89c74e2dc4628826cb972a15a956035a3eb1e6402c","abstract_canon_sha256":"2a82ec357c084f8a69446cfb97b1fa5099cf91d7e75c387e511c37caf5f8ac0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:57:20.969152Z","signature_b64":"SAHe0OxneniJ6cn5xmmKzXikrudARh+QVN9tdReeB2c1XXPjDOqZwwiOAbTwEaa97J+JBMj2aNHNRTcK/zYMAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"362f175dbb5a8be8858b3cb731cee72acf37325ed2bed2652235af5131a8ef15","last_reissued_at":"2026-07-05T10:57:20.968656Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:57:20.968656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scott Spectral Gaps are Bounded for Linear Orderings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"David Gonzalez, Matthew Harrison-Trainor","submitted_at":"2024-11-18T21:49:46Z","abstract_excerpt":"We demonstrate that any $\\Pi_\\alpha$ sentence of the infinitary logic $L_{\\omega_1 \\omega}$ extending the theory of linear orderings has a model with a $\\Pi_{\\alpha+4}$ Scott sentence and hence of Scott rank at most $\\alpha+3$. In other words, the gap between the complexity of the theory and the complexity of the simplest model is always bounded by $4$. This contrasts the situation with general structures where for any $\\alpha$ there is a $\\Pi_2$ sentence all of whose models have Scott rank $\\alpha$. We also give new lower bounds, though there remains a small gap between our lower and upper bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.12084","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/2411.12084/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":"2411.12084","created_at":"2026-07-05T10:57:20.968712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.12084v2","created_at":"2026-07-05T10:57:20.968712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.12084","created_at":"2026-07-05T10:57:20.968712+00:00"},{"alias_kind":"pith_short_12","alias_value":"GYXROXN3LKF6","created_at":"2026-07-05T10:57:20.968712+00:00"},{"alias_kind":"pith_short_16","alias_value":"GYXROXN3LKF6RBML","created_at":"2026-07-05T10:57:20.968712+00:00"},{"alias_kind":"pith_short_8","alias_value":"GYXROXN3","created_at":"2026-07-05T10:57:20.968712+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04404","citing_title":"Computable Scott Sentences and the Friedman-Stanley embedding","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GYXROXN3LKF6RBMLHS3TDTXHFL","json":"https://pith.science/pith/GYXROXN3LKF6RBMLHS3TDTXHFL.json","graph_json":"https://pith.science/api/pith-number/GYXROXN3LKF6RBMLHS3TDTXHFL/graph.json","events_json":"https://pith.science/api/pith-number/GYXROXN3LKF6RBMLHS3TDTXHFL/events.json","paper":"https://pith.science/paper/GYXROXN3"},"agent_actions":{"view_html":"https://pith.science/pith/GYXROXN3LKF6RBMLHS3TDTXHFL","download_json":"https://pith.science/pith/GYXROXN3LKF6RBMLHS3TDTXHFL.json","view_paper":"https://pith.science/paper/GYXROXN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.12084&json=true","fetch_graph":"https://pith.science/api/pith-number/GYXROXN3LKF6RBMLHS3TDTXHFL/graph.json","fetch_events":"https://pith.science/api/pith-number/GYXROXN3LKF6RBMLHS3TDTXHFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GYXROXN3LKF6RBMLHS3TDTXHFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GYXROXN3LKF6RBMLHS3TDTXHFL/action/storage_attestation","attest_author":"https://pith.science/pith/GYXROXN3LKF6RBMLHS3TDTXHFL/action/author_attestation","sign_citation":"https://pith.science/pith/GYXROXN3LKF6RBMLHS3TDTXHFL/action/citation_signature","submit_replication":"https://pith.science/pith/GYXROXN3LKF6RBMLHS3TDTXHFL/action/replication_record"}},"created_at":"2026-07-05T10:57:20.968712+00:00","updated_at":"2026-07-05T10:57:20.968712+00:00"}