{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RU6KJ3F5C4T6E4NGGGB7P4WMG3","short_pith_number":"pith:RU6KJ3F5","schema_version":"1.0","canonical_sha256":"8d3ca4ecbd1727e271a63183f7f2cc36eab75624d87c093b5e7546f4f15739b1","source":{"kind":"arxiv","id":"1805.10249","version":2},"attestation_state":"computed","paper":{"title":"Degrees of Categoricity Above Limit Ordinals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Barbara F. Csima, Matthew Harrison-Trainor, Michael Deveau, Mohammad Assem Mahmoud","submitted_at":"2018-05-25T17:02:27Z","abstract_excerpt":"A computable structure $\\mathcal{A}$ has degree of categoricity $\\mathbf{d}$ if $\\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\\mathcal{A}$. Fokina, Kalimullin, and Miller showed that every degree d.c.e. in and above $\\mathbf{0}^{(n)}$, for any $n < \\omega$, and also the degree $\\mathbf{0}^{(\\omega)}$, are degrees of categoricity. Later, Csima, Franklin, and Shore showed that every degree $\\mathbf{0}^{(\\alpha)}$ for any computable ordinal $\\alpha$, and every degree d.c.e. in and above $\\mathbf{0}^{(\\alpha)}$ for any successor"},"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":"1805.10249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2018-05-25T17:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"6a05ebb60f40d44ca03dee932c1480b50920a3407c68cb523429d480fb3d9940","abstract_canon_sha256":"6a7cce2ae491316ea2266f4c8f67af2578769a6bc5f7fc5624baed5b1c3196ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:05.430920Z","signature_b64":"Ec7+dSJxWbefntC24fC7jooxvDm55IfAcyvgNLPY5qH48iUXCXvOoWlvS1etqD4ewPjWZe5tQ+PdFcinwbS+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d3ca4ecbd1727e271a63183f7f2cc36eab75624d87c093b5e7546f4f15739b1","last_reissued_at":"2026-05-18T00:09:05.430442Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:05.430442Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degrees of Categoricity Above Limit Ordinals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Barbara F. Csima, Matthew Harrison-Trainor, Michael Deveau, Mohammad Assem Mahmoud","submitted_at":"2018-05-25T17:02:27Z","abstract_excerpt":"A computable structure $\\mathcal{A}$ has degree of categoricity $\\mathbf{d}$ if $\\mathbf{d}$ is exactly the degree of difficulty of computing isomorphisms between isomorphic computable copies of $\\mathcal{A}$. Fokina, Kalimullin, and Miller showed that every degree d.c.e. in and above $\\mathbf{0}^{(n)}$, for any $n < \\omega$, and also the degree $\\mathbf{0}^{(\\omega)}$, are degrees of categoricity. Later, Csima, Franklin, and Shore showed that every degree $\\mathbf{0}^{(\\alpha)}$ for any computable ordinal $\\alpha$, and every degree d.c.e. in and above $\\mathbf{0}^{(\\alpha)}$ for any successor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10249","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":""},"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":"1805.10249","created_at":"2026-05-18T00:09:05.430511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10249v2","created_at":"2026-05-18T00:09:05.430511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10249","created_at":"2026-05-18T00:09:05.430511+00:00"},{"alias_kind":"pith_short_12","alias_value":"RU6KJ3F5C4T6","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RU6KJ3F5C4T6E4NG","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RU6KJ3F5","created_at":"2026-05-18T12:32:50.500415+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/RU6KJ3F5C4T6E4NGGGB7P4WMG3","json":"https://pith.science/pith/RU6KJ3F5C4T6E4NGGGB7P4WMG3.json","graph_json":"https://pith.science/api/pith-number/RU6KJ3F5C4T6E4NGGGB7P4WMG3/graph.json","events_json":"https://pith.science/api/pith-number/RU6KJ3F5C4T6E4NGGGB7P4WMG3/events.json","paper":"https://pith.science/paper/RU6KJ3F5"},"agent_actions":{"view_html":"https://pith.science/pith/RU6KJ3F5C4T6E4NGGGB7P4WMG3","download_json":"https://pith.science/pith/RU6KJ3F5C4T6E4NGGGB7P4WMG3.json","view_paper":"https://pith.science/paper/RU6KJ3F5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10249&json=true","fetch_graph":"https://pith.science/api/pith-number/RU6KJ3F5C4T6E4NGGGB7P4WMG3/graph.json","fetch_events":"https://pith.science/api/pith-number/RU6KJ3F5C4T6E4NGGGB7P4WMG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RU6KJ3F5C4T6E4NGGGB7P4WMG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RU6KJ3F5C4T6E4NGGGB7P4WMG3/action/storage_attestation","attest_author":"https://pith.science/pith/RU6KJ3F5C4T6E4NGGGB7P4WMG3/action/author_attestation","sign_citation":"https://pith.science/pith/RU6KJ3F5C4T6E4NGGGB7P4WMG3/action/citation_signature","submit_replication":"https://pith.science/pith/RU6KJ3F5C4T6E4NGGGB7P4WMG3/action/replication_record"}},"created_at":"2026-05-18T00:09:05.430511+00:00","updated_at":"2026-05-18T00:09:05.430511+00:00"}