{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:GDA6RHGUIHIZIY55QPKYTK3J6L","short_pith_number":"pith:GDA6RHGU","schema_version":"1.0","canonical_sha256":"30c1e89cd441d19463bd83d589ab69f2e9e347a6ecda7bf85b3a9090eb094781","source":{"kind":"arxiv","id":"0707.3782","version":2},"attestation_state":"computed","paper":{"title":"Interactive Small-Step Algorithms I: Axiomatization","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Blass, Benjamin Rossman, Dean Rosenzweig, Yuri Gurevich","submitted_at":"2007-07-25T17:04:26Z","abstract_excerpt":"In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms. This was accomplished on the basis of axiomatizations of these classes of algorithms. Here we extend the axiomatization and, in a companion paper, the proof, to cover interactive small-step algorithms that are not necessarily ordinary. This means that the algorithms (1) can complete a step without necessarily waiting for replies to all queries from that"},"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":"0707.3782","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-07-25T17:04:26Z","cross_cats_sorted":[],"title_canon_sha256":"46a09d1cecf12935e891fcd5cb10ea85f57af4424455a3800ad732962a83e2e3","abstract_canon_sha256":"2ce80e206f8d39d190d04d83c4eb99495208471a80f7dd352ca13c99b75bd25e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:42.675748Z","signature_b64":"zk3O136U7K6aWQ15qOShBmBzegVY3/2F1WJJQaRVwwAHxSHFnggDDF75ZbwCMcNurhcXBboxW544GtOEaJs7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30c1e89cd441d19463bd83d589ab69f2e9e347a6ecda7bf85b3a9090eb094781","last_reissued_at":"2026-05-18T01:37:42.675178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:42.675178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interactive Small-Step Algorithms I: Axiomatization","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Blass, Benjamin Rossman, Dean Rosenzweig, Yuri Gurevich","submitted_at":"2007-07-25T17:04:26Z","abstract_excerpt":"In earlier work, the Abstract State Machine Thesis -- that arbitrary algorithms are behaviorally equivalent to abstract state machines -- was established for several classes of algorithms, including ordinary, interactive, small-step algorithms. This was accomplished on the basis of axiomatizations of these classes of algorithms. Here we extend the axiomatization and, in a companion paper, the proof, to cover interactive small-step algorithms that are not necessarily ordinary. This means that the algorithms (1) can complete a step without necessarily waiting for replies to all queries from that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.3782","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":"0707.3782","created_at":"2026-05-18T01:37:42.675268+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.3782v2","created_at":"2026-05-18T01:37:42.675268+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.3782","created_at":"2026-05-18T01:37:42.675268+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDA6RHGUIHIZ","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDA6RHGUIHIZIY55","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDA6RHGU","created_at":"2026-05-18T12:25:55.427421+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/GDA6RHGUIHIZIY55QPKYTK3J6L","json":"https://pith.science/pith/GDA6RHGUIHIZIY55QPKYTK3J6L.json","graph_json":"https://pith.science/api/pith-number/GDA6RHGUIHIZIY55QPKYTK3J6L/graph.json","events_json":"https://pith.science/api/pith-number/GDA6RHGUIHIZIY55QPKYTK3J6L/events.json","paper":"https://pith.science/paper/GDA6RHGU"},"agent_actions":{"view_html":"https://pith.science/pith/GDA6RHGUIHIZIY55QPKYTK3J6L","download_json":"https://pith.science/pith/GDA6RHGUIHIZIY55QPKYTK3J6L.json","view_paper":"https://pith.science/paper/GDA6RHGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.3782&json=true","fetch_graph":"https://pith.science/api/pith-number/GDA6RHGUIHIZIY55QPKYTK3J6L/graph.json","fetch_events":"https://pith.science/api/pith-number/GDA6RHGUIHIZIY55QPKYTK3J6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDA6RHGUIHIZIY55QPKYTK3J6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDA6RHGUIHIZIY55QPKYTK3J6L/action/storage_attestation","attest_author":"https://pith.science/pith/GDA6RHGUIHIZIY55QPKYTK3J6L/action/author_attestation","sign_citation":"https://pith.science/pith/GDA6RHGUIHIZIY55QPKYTK3J6L/action/citation_signature","submit_replication":"https://pith.science/pith/GDA6RHGUIHIZIY55QPKYTK3J6L/action/replication_record"}},"created_at":"2026-05-18T01:37:42.675268+00:00","updated_at":"2026-05-18T01:37:42.675268+00:00"}