{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:NXABRA7LNW65EOF2VYZEXYUTSH","short_pith_number":"pith:NXABRA7L","schema_version":"1.0","canonical_sha256":"6dc01883eb6dbdd238baae324be29391f6523a73161caa7d906f800902950e69","source":{"kind":"arxiv","id":"0707.3789","version":2},"attestation_state":"computed","paper":{"title":"Interactive Small-Step Algorithms II: Abstract State Machines and the<br> Characterization Theorem","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Blass, Benjamin Rossman, Dean Rosenzweig, Yuri Gurevich","submitted_at":"2007-07-25T17:35:46Z","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. In Part I (Interactive Small-Step Algorithms I: Axiomatization), the axiomatization was extended 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"},"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.3789","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-07-25T17:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"97d095698a56e928c576313a18e7fd30337305fe2e062c0a18b09c35019467d2","abstract_canon_sha256":"ada4c8b6099c7581a96ba016d94c05369274d3f09e5be7f2a845cb1672a3d543"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:42.667642Z","signature_b64":"XNc8vN0CRjDVBRL8ejSZSI2kSlbUXkISTpTJvRVDDvgDXbYJNvnr8F3XEUyVSdG6BGPjBFoPcPTl6uMUHtokCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dc01883eb6dbdd238baae324be29391f6523a73161caa7d906f800902950e69","last_reissued_at":"2026-05-18T01:37:42.666923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:42.666923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interactive Small-Step Algorithms II: Abstract State Machines and the<br> Characterization Theorem","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andreas Blass, Benjamin Rossman, Dean Rosenzweig, Yuri Gurevich","submitted_at":"2007-07-25T17:35:46Z","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. In Part I (Interactive Small-Step Algorithms I: Axiomatization), the axiomatization was extended 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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.3789","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.3789","created_at":"2026-05-18T01:37:42.667038+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.3789v2","created_at":"2026-05-18T01:37:42.667038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.3789","created_at":"2026-05-18T01:37:42.667038+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXABRA7LNW65","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXABRA7LNW65EOF2","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXABRA7L","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/NXABRA7LNW65EOF2VYZEXYUTSH","json":"https://pith.science/pith/NXABRA7LNW65EOF2VYZEXYUTSH.json","graph_json":"https://pith.science/api/pith-number/NXABRA7LNW65EOF2VYZEXYUTSH/graph.json","events_json":"https://pith.science/api/pith-number/NXABRA7LNW65EOF2VYZEXYUTSH/events.json","paper":"https://pith.science/paper/NXABRA7L"},"agent_actions":{"view_html":"https://pith.science/pith/NXABRA7LNW65EOF2VYZEXYUTSH","download_json":"https://pith.science/pith/NXABRA7LNW65EOF2VYZEXYUTSH.json","view_paper":"https://pith.science/paper/NXABRA7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.3789&json=true","fetch_graph":"https://pith.science/api/pith-number/NXABRA7LNW65EOF2VYZEXYUTSH/graph.json","fetch_events":"https://pith.science/api/pith-number/NXABRA7LNW65EOF2VYZEXYUTSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXABRA7LNW65EOF2VYZEXYUTSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXABRA7LNW65EOF2VYZEXYUTSH/action/storage_attestation","attest_author":"https://pith.science/pith/NXABRA7LNW65EOF2VYZEXYUTSH/action/author_attestation","sign_citation":"https://pith.science/pith/NXABRA7LNW65EOF2VYZEXYUTSH/action/citation_signature","submit_replication":"https://pith.science/pith/NXABRA7LNW65EOF2VYZEXYUTSH/action/replication_record"}},"created_at":"2026-05-18T01:37:42.667038+00:00","updated_at":"2026-05-18T01:37:42.667038+00:00"}