{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ADRPN6BOGKODNWEJSUZAK5OUAB","short_pith_number":"pith:ADRPN6BO","schema_version":"1.0","canonical_sha256":"00e2f6f82e329c36d88995320575d400649d9b33e44e1883011860e7cf75d078","source":{"kind":"arxiv","id":"1804.05439","version":1},"attestation_state":"computed","paper":{"title":"Solvability of Mazes by Blind Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marius Tiba, Stefan David","submitted_at":"2018-04-15T22:09:33Z","abstract_excerpt":"In this paper we introduce and investigate a new type of automata which turns out to be rich in deep and complex phenomena. For our model, a maze is a countable strongly connected digraph called the board together with a proper colouring of its edges (the edges leaving a vertex have distinct colours) and two special vertices: the origin and the destination. A pointer or robot starts at the origin of a maze and moves naturally between its vertices, according to a finite or infinite sequence of specific instructions from the set of all colours called an algorithm; if the robot is at a vertex for"},"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":"1804.05439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-15T22:09:33Z","cross_cats_sorted":[],"title_canon_sha256":"ef63f8e2477f1d6977bf9b37c8b3f01d49b57814f9dec2017403e3de1c7661f2","abstract_canon_sha256":"80566f583b0f3af81d07749bc714bff018dd57e06d490e5625926e65bdca1687"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:28.130217Z","signature_b64":"Gmi+qZRC0tUxiv1BPx5m/wuQo+yHz6UJ3DSRUNk0CWH0YFENu8XczTvRUQ9eknKvJs1V5tu/aC9pLSubB1cLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00e2f6f82e329c36d88995320575d400649d9b33e44e1883011860e7cf75d078","last_reissued_at":"2026-05-18T00:18:28.129833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:28.129833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solvability of Mazes by Blind Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marius Tiba, Stefan David","submitted_at":"2018-04-15T22:09:33Z","abstract_excerpt":"In this paper we introduce and investigate a new type of automata which turns out to be rich in deep and complex phenomena. For our model, a maze is a countable strongly connected digraph called the board together with a proper colouring of its edges (the edges leaving a vertex have distinct colours) and two special vertices: the origin and the destination. A pointer or robot starts at the origin of a maze and moves naturally between its vertices, according to a finite or infinite sequence of specific instructions from the set of all colours called an algorithm; if the robot is at a vertex for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05439","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":""},"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":"1804.05439","created_at":"2026-05-18T00:18:28.129887+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05439v1","created_at":"2026-05-18T00:18:28.129887+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05439","created_at":"2026-05-18T00:18:28.129887+00:00"},{"alias_kind":"pith_short_12","alias_value":"ADRPN6BOGKOD","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ADRPN6BOGKODNWEJ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ADRPN6BO","created_at":"2026-05-18T12:32:13.499390+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/ADRPN6BOGKODNWEJSUZAK5OUAB","json":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB.json","graph_json":"https://pith.science/api/pith-number/ADRPN6BOGKODNWEJSUZAK5OUAB/graph.json","events_json":"https://pith.science/api/pith-number/ADRPN6BOGKODNWEJSUZAK5OUAB/events.json","paper":"https://pith.science/paper/ADRPN6BO"},"agent_actions":{"view_html":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB","download_json":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB.json","view_paper":"https://pith.science/paper/ADRPN6BO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05439&json=true","fetch_graph":"https://pith.science/api/pith-number/ADRPN6BOGKODNWEJSUZAK5OUAB/graph.json","fetch_events":"https://pith.science/api/pith-number/ADRPN6BOGKODNWEJSUZAK5OUAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/action/storage_attestation","attest_author":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/action/author_attestation","sign_citation":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/action/citation_signature","submit_replication":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/action/replication_record"}},"created_at":"2026-05-18T00:18:28.129887+00:00","updated_at":"2026-05-18T00:18:28.129887+00:00"}