{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QDIAOA2I4F7OLISN3OLSGYQJUH","short_pith_number":"pith:QDIAOA2I","schema_version":"1.0","canonical_sha256":"80d0070348e17ee5a24ddb97236209a1fe65fe6bbb8a8f4a66f6cf3bcab048f0","source":{"kind":"arxiv","id":"1305.0911","version":2},"attestation_state":"computed","paper":{"title":"A Comment on Budach's Mouse-in-an-Octant Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Amir M. Ben-Amram","submitted_at":"2013-05-04T11:02:03Z","abstract_excerpt":"Budach's Mouse-in-an-Octant Problem (attributed to Lothar Budach in a 1980 article by van Emde Boas and Karpinski) concerns the behaviour of a very simple finite-state machine (\"the mouse\") moving on the integer two-dimensional grid. Its decidability is apparently still open. This note sketches a proof that an extended version of the problem (a super-mouse) is undecidable."},"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":"1305.0911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-05-04T11:02:03Z","cross_cats_sorted":[],"title_canon_sha256":"84be6702616fc0f31b55c56d64c42411d41ea157340d2d2232178962b2ecfa79","abstract_canon_sha256":"0f3934325aaabea8b373015aa0b50c7ab761336a0f031bd42194bb23a89850af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:46.214482Z","signature_b64":"bFWrmFxXqSfavWSpd0cmMRWw6GmhfjAn8WwpNpmigSV6nSd8mVOkWNoCZddhfskds3L4dCtgEsGOBMUNrVb3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80d0070348e17ee5a24ddb97236209a1fe65fe6bbb8a8f4a66f6cf3bcab048f0","last_reissued_at":"2026-05-18T03:12:46.213674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:46.213674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comment on Budach's Mouse-in-an-Octant Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Amir M. Ben-Amram","submitted_at":"2013-05-04T11:02:03Z","abstract_excerpt":"Budach's Mouse-in-an-Octant Problem (attributed to Lothar Budach in a 1980 article by van Emde Boas and Karpinski) concerns the behaviour of a very simple finite-state machine (\"the mouse\") moving on the integer two-dimensional grid. Its decidability is apparently still open. This note sketches a proof that an extended version of the problem (a super-mouse) is undecidable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0911","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":"1305.0911","created_at":"2026-05-18T03:12:46.213795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0911v2","created_at":"2026-05-18T03:12:46.213795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0911","created_at":"2026-05-18T03:12:46.213795+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDIAOA2I4F7O","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDIAOA2I4F7OLISN","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDIAOA2I","created_at":"2026-05-18T12:27:57.521954+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/QDIAOA2I4F7OLISN3OLSGYQJUH","json":"https://pith.science/pith/QDIAOA2I4F7OLISN3OLSGYQJUH.json","graph_json":"https://pith.science/api/pith-number/QDIAOA2I4F7OLISN3OLSGYQJUH/graph.json","events_json":"https://pith.science/api/pith-number/QDIAOA2I4F7OLISN3OLSGYQJUH/events.json","paper":"https://pith.science/paper/QDIAOA2I"},"agent_actions":{"view_html":"https://pith.science/pith/QDIAOA2I4F7OLISN3OLSGYQJUH","download_json":"https://pith.science/pith/QDIAOA2I4F7OLISN3OLSGYQJUH.json","view_paper":"https://pith.science/paper/QDIAOA2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0911&json=true","fetch_graph":"https://pith.science/api/pith-number/QDIAOA2I4F7OLISN3OLSGYQJUH/graph.json","fetch_events":"https://pith.science/api/pith-number/QDIAOA2I4F7OLISN3OLSGYQJUH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDIAOA2I4F7OLISN3OLSGYQJUH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDIAOA2I4F7OLISN3OLSGYQJUH/action/storage_attestation","attest_author":"https://pith.science/pith/QDIAOA2I4F7OLISN3OLSGYQJUH/action/author_attestation","sign_citation":"https://pith.science/pith/QDIAOA2I4F7OLISN3OLSGYQJUH/action/citation_signature","submit_replication":"https://pith.science/pith/QDIAOA2I4F7OLISN3OLSGYQJUH/action/replication_record"}},"created_at":"2026-05-18T03:12:46.213795+00:00","updated_at":"2026-05-18T03:12:46.213795+00:00"}