{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TFJE6N7DQFSKNIEZHSIMBAULNI","short_pith_number":"pith:TFJE6N7D","schema_version":"1.0","canonical_sha256":"99524f37e38164a6a0993c90c0828b6a21bfc28440eab646117632d9bed74c5d","source":{"kind":"arxiv","id":"2105.06933","version":1},"attestation_state":"computed","paper":{"title":"Computability models over categories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CT","authors_text":"Iosif Petrakis","submitted_at":"2021-05-14T16:23:20Z","abstract_excerpt":"Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann, we define canonical computability models over categories and appropriate Set-valued functors on them. We study the canonical total computability model over a category, and the partial one over a category with pullbacks. Our notions and results are generalised to categories with a base of computability, connecting Rosolini's theory of dominions with the theory of computability models."},"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":"2105.06933","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CT","submitted_at":"2021-05-14T16:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"422881571dbdc869ce8488dfd0b2f9c10c9942e3b4fbfda13c0ee8fb6033bf4e","abstract_canon_sha256":"a9fe8cf790ff1c21029ddb10460fdec61eb74108f48781e13917e19375787fa2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:23.162228Z","signature_b64":"l/rcONYuS8grxhuqxWn7HJ0O43e2KbG2cl1GXGYdfAjHpo+qRZytBL5j3/dJGHH54l0TSIv4MoMWbD3S/36gAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99524f37e38164a6a0993c90c0828b6a21bfc28440eab646117632d9bed74c5d","last_reissued_at":"2026-07-05T02:40:23.160423Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:23.160423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computability models over categories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CT","authors_text":"Iosif Petrakis","submitted_at":"2021-05-14T16:23:20Z","abstract_excerpt":"Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann, we define canonical computability models over categories and appropriate Set-valued functors on them. We study the canonical total computability model over a category, and the partial one over a category with pullbacks. Our notions and results are generalised to categories with a base of computability, connecting Rosolini's theory of dominions with the theory of computability models."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.06933","kind":"arxiv","version":1},"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/2105.06933/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":"2105.06933","created_at":"2026-07-05T02:40:23.161218+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.06933v1","created_at":"2026-07-05T02:40:23.161218+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.06933","created_at":"2026-07-05T02:40:23.161218+00:00"},{"alias_kind":"pith_short_12","alias_value":"TFJE6N7DQFSK","created_at":"2026-07-05T02:40:23.161218+00:00"},{"alias_kind":"pith_short_16","alias_value":"TFJE6N7DQFSKNIEZ","created_at":"2026-07-05T02:40:23.161218+00:00"},{"alias_kind":"pith_short_8","alias_value":"TFJE6N7D","created_at":"2026-07-05T02:40:23.161218+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/TFJE6N7DQFSKNIEZHSIMBAULNI","json":"https://pith.science/pith/TFJE6N7DQFSKNIEZHSIMBAULNI.json","graph_json":"https://pith.science/api/pith-number/TFJE6N7DQFSKNIEZHSIMBAULNI/graph.json","events_json":"https://pith.science/api/pith-number/TFJE6N7DQFSKNIEZHSIMBAULNI/events.json","paper":"https://pith.science/paper/TFJE6N7D"},"agent_actions":{"view_html":"https://pith.science/pith/TFJE6N7DQFSKNIEZHSIMBAULNI","download_json":"https://pith.science/pith/TFJE6N7DQFSKNIEZHSIMBAULNI.json","view_paper":"https://pith.science/paper/TFJE6N7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.06933&json=true","fetch_graph":"https://pith.science/api/pith-number/TFJE6N7DQFSKNIEZHSIMBAULNI/graph.json","fetch_events":"https://pith.science/api/pith-number/TFJE6N7DQFSKNIEZHSIMBAULNI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TFJE6N7DQFSKNIEZHSIMBAULNI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TFJE6N7DQFSKNIEZHSIMBAULNI/action/storage_attestation","attest_author":"https://pith.science/pith/TFJE6N7DQFSKNIEZHSIMBAULNI/action/author_attestation","sign_citation":"https://pith.science/pith/TFJE6N7DQFSKNIEZHSIMBAULNI/action/citation_signature","submit_replication":"https://pith.science/pith/TFJE6N7DQFSKNIEZHSIMBAULNI/action/replication_record"}},"created_at":"2026-07-05T02:40:23.161218+00:00","updated_at":"2026-07-05T02:40:23.161218+00:00"}