{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EB2EZVXPEPAVHMDZCT77ZNUVKJ","short_pith_number":"pith:EB2EZVXP","schema_version":"1.0","canonical_sha256":"20744cd6ef23c153b07914fffcb695524dbc8e044243425a30346bc1448df161","source":{"kind":"arxiv","id":"2508.05798","version":1},"attestation_state":"computed","paper":{"title":"Basic interactive algorithms: Preview","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","math.LO","quant-ph"],"primary_cat":"cs.LO","authors_text":"Yuri Gurevich","submitted_at":"2025-08-07T19:13:47Z","abstract_excerpt":"This dialog paper offers a preview and provides a foretaste of an upcoming work on the axiomatization of basic interactive algorithms.\n  The modern notion of algorithm was elucidated in the 1930s--1950s. It was axiomatized a quarter of a century ago as the notion of ``sequential algorithm'' or ``classical algorithm''; we prefer to call it ``basic algorithm\" now. The axiomatization was used to show that for every basic algorithm there is a behaviorally equivalent abstract state machine. It was also used to prove the Church-Turing thesis as it has been understood by the logicians.\n  Starting fro"},"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":"2508.05798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-08-07T19:13:47Z","cross_cats_sorted":["cs.CL","math.LO","quant-ph"],"title_canon_sha256":"6c611887b43bad5b1c08f25f6cf67608614f7721703a1288f9346f8495c73ebd","abstract_canon_sha256":"79b36bead7fb394d6c5fecdee61c0b8ae44e7103166297e001399b4b913c225e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:43.589778Z","signature_b64":"v3OdFLHSqPURqHKChDZzcbcxS4i03c0mubynYh5MhKiOq+P+TexbYylZQz3wjV5QJPh1qdhfursakTKB0yxPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20744cd6ef23c153b07914fffcb695524dbc8e044243425a30346bc1448df161","last_reissued_at":"2026-07-05T11:50:43.589248Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:43.589248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Basic interactive algorithms: Preview","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","math.LO","quant-ph"],"primary_cat":"cs.LO","authors_text":"Yuri Gurevich","submitted_at":"2025-08-07T19:13:47Z","abstract_excerpt":"This dialog paper offers a preview and provides a foretaste of an upcoming work on the axiomatization of basic interactive algorithms.\n  The modern notion of algorithm was elucidated in the 1930s--1950s. It was axiomatized a quarter of a century ago as the notion of ``sequential algorithm'' or ``classical algorithm''; we prefer to call it ``basic algorithm\" now. The axiomatization was used to show that for every basic algorithm there is a behaviorally equivalent abstract state machine. It was also used to prove the Church-Turing thesis as it has been understood by the logicians.\n  Starting fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.05798","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/2508.05798/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":"2508.05798","created_at":"2026-07-05T11:50:43.589330+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.05798v1","created_at":"2026-07-05T11:50:43.589330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.05798","created_at":"2026-07-05T11:50:43.589330+00:00"},{"alias_kind":"pith_short_12","alias_value":"EB2EZVXPEPAV","created_at":"2026-07-05T11:50:43.589330+00:00"},{"alias_kind":"pith_short_16","alias_value":"EB2EZVXPEPAVHMDZ","created_at":"2026-07-05T11:50:43.589330+00:00"},{"alias_kind":"pith_short_8","alias_value":"EB2EZVXP","created_at":"2026-07-05T11:50:43.589330+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/EB2EZVXPEPAVHMDZCT77ZNUVKJ","json":"https://pith.science/pith/EB2EZVXPEPAVHMDZCT77ZNUVKJ.json","graph_json":"https://pith.science/api/pith-number/EB2EZVXPEPAVHMDZCT77ZNUVKJ/graph.json","events_json":"https://pith.science/api/pith-number/EB2EZVXPEPAVHMDZCT77ZNUVKJ/events.json","paper":"https://pith.science/paper/EB2EZVXP"},"agent_actions":{"view_html":"https://pith.science/pith/EB2EZVXPEPAVHMDZCT77ZNUVKJ","download_json":"https://pith.science/pith/EB2EZVXPEPAVHMDZCT77ZNUVKJ.json","view_paper":"https://pith.science/paper/EB2EZVXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.05798&json=true","fetch_graph":"https://pith.science/api/pith-number/EB2EZVXPEPAVHMDZCT77ZNUVKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EB2EZVXPEPAVHMDZCT77ZNUVKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EB2EZVXPEPAVHMDZCT77ZNUVKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EB2EZVXPEPAVHMDZCT77ZNUVKJ/action/storage_attestation","attest_author":"https://pith.science/pith/EB2EZVXPEPAVHMDZCT77ZNUVKJ/action/author_attestation","sign_citation":"https://pith.science/pith/EB2EZVXPEPAVHMDZCT77ZNUVKJ/action/citation_signature","submit_replication":"https://pith.science/pith/EB2EZVXPEPAVHMDZCT77ZNUVKJ/action/replication_record"}},"created_at":"2026-07-05T11:50:43.589330+00:00","updated_at":"2026-07-05T11:50:43.589330+00:00"}