{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:GK5PFH7AEATMNYRPD3P7VIVIRP","short_pith_number":"pith:GK5PFH7A","schema_version":"1.0","canonical_sha256":"32baf29fe02026c6e22f1edffaa2a88bc49668c681aee7d4496f97aab703f108","source":{"kind":"arxiv","id":"2002.03145","version":2},"attestation_state":"computed","paper":{"title":"Means-fit effectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Yuri Gurevich","submitted_at":"2020-02-08T11:28:24Z","abstract_excerpt":"Historically, the notion of effective algorithm is closely related to the Church-Turing thesis. But effectivity imposes no restriction on computation time or any other resource; in that sense, it is incompatible with engineering or physics. We propose a natural generalization of it, means-fitting effectivity, which is effectivity relative to the (physical or abstract) underlying machinery of the algorithm. This machinery varies from one class of algorithms to another. Think for example of ruler-and-compass algorithms, arithmetical algorithms, and Blum-Shub-Smale algorithms. We believe that mea"},"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":"2002.03145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-02-08T11:28:24Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"2023ed343cdce8663768a69fb800f94d7ed08bca5794fb9a50c9c72382920795","abstract_canon_sha256":"8e45275237403c9debafc8a805239f188cf0d3b035b992715b85a63c20d7ba65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:42:34.207420Z","signature_b64":"Z1zHjHIXa8Al9uQ4yfDVD63q7ZXaNnwKdqVGaS5zb0TCyVi77SZo2050Vi850kZBxitBPhUs38dYIaPC/6kgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32baf29fe02026c6e22f1edffaa2a88bc49668c681aee7d4496f97aab703f108","last_reissued_at":"2026-07-05T00:42:34.206906Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:42:34.206906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Means-fit effectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Yuri Gurevich","submitted_at":"2020-02-08T11:28:24Z","abstract_excerpt":"Historically, the notion of effective algorithm is closely related to the Church-Turing thesis. But effectivity imposes no restriction on computation time or any other resource; in that sense, it is incompatible with engineering or physics. We propose a natural generalization of it, means-fitting effectivity, which is effectivity relative to the (physical or abstract) underlying machinery of the algorithm. This machinery varies from one class of algorithms to another. Think for example of ruler-and-compass algorithms, arithmetical algorithms, and Blum-Shub-Smale algorithms. We believe that mea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03145","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/2002.03145/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":"2002.03145","created_at":"2026-07-05T00:42:34.206964+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.03145v2","created_at":"2026-07-05T00:42:34.206964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03145","created_at":"2026-07-05T00:42:34.206964+00:00"},{"alias_kind":"pith_short_12","alias_value":"GK5PFH7AEATM","created_at":"2026-07-05T00:42:34.206964+00:00"},{"alias_kind":"pith_short_16","alias_value":"GK5PFH7AEATMNYRP","created_at":"2026-07-05T00:42:34.206964+00:00"},{"alias_kind":"pith_short_8","alias_value":"GK5PFH7A","created_at":"2026-07-05T00:42:34.206964+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.05798","citing_title":"Basic interactive algorithms: Preview","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GK5PFH7AEATMNYRPD3P7VIVIRP","json":"https://pith.science/pith/GK5PFH7AEATMNYRPD3P7VIVIRP.json","graph_json":"https://pith.science/api/pith-number/GK5PFH7AEATMNYRPD3P7VIVIRP/graph.json","events_json":"https://pith.science/api/pith-number/GK5PFH7AEATMNYRPD3P7VIVIRP/events.json","paper":"https://pith.science/paper/GK5PFH7A"},"agent_actions":{"view_html":"https://pith.science/pith/GK5PFH7AEATMNYRPD3P7VIVIRP","download_json":"https://pith.science/pith/GK5PFH7AEATMNYRPD3P7VIVIRP.json","view_paper":"https://pith.science/paper/GK5PFH7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.03145&json=true","fetch_graph":"https://pith.science/api/pith-number/GK5PFH7AEATMNYRPD3P7VIVIRP/graph.json","fetch_events":"https://pith.science/api/pith-number/GK5PFH7AEATMNYRPD3P7VIVIRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GK5PFH7AEATMNYRPD3P7VIVIRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GK5PFH7AEATMNYRPD3P7VIVIRP/action/storage_attestation","attest_author":"https://pith.science/pith/GK5PFH7AEATMNYRPD3P7VIVIRP/action/author_attestation","sign_citation":"https://pith.science/pith/GK5PFH7AEATMNYRPD3P7VIVIRP/action/citation_signature","submit_replication":"https://pith.science/pith/GK5PFH7AEATMNYRPD3P7VIVIRP/action/replication_record"}},"created_at":"2026-07-05T00:42:34.206964+00:00","updated_at":"2026-07-05T00:42:34.206964+00:00"}