{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ADRPN6BOGKODNWEJSUZAK5OUAB","short_pith_number":"pith:ADRPN6BO","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"},"canonical_sha256":"00e2f6f82e329c36d88995320575d400649d9b33e44e1883011860e7cf75d078","source":{"kind":"arxiv","id":"1804.05439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05439","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05439v1","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05439","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"ADRPN6BOGKOD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ADRPN6BOGKODNWEJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ADRPN6BO","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ADRPN6BOGKODNWEJSUZAK5OUAB","target":"record","payload":{"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"},"canonical_sha256":"00e2f6f82e329c36d88995320575d400649d9b33e44e1883011860e7cf75d078","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"},"source_kind":"arxiv","source_id":"1804.05439","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MifTRAXhy3qy+ost0orOCzGceQaeVLZeCgB0hPxFyNDpvccm7HwvDX/lvSU0RolIEamZ3gWcCAz7j1v6XtmgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:05:07.815310Z"},"content_sha256":"67baf3492b33269eeaa5bb4f56cf1ed27670bc16b2eb631872d5a8a1cb362014","schema_version":"1.0","event_id":"sha256:67baf3492b33269eeaa5bb4f56cf1ed27670bc16b2eb631872d5a8a1cb362014"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ADRPN6BOGKODNWEJSUZAK5OUAB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMvAGHH132OCV+eEl2iKwxIc6TIw0lYOWB/xCmvnLcmzaPUARW5UBQQScu0jpMFrQf73a0WxznYWE8fc/1y9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:05:07.815734Z"},"content_sha256":"f99653b8696669fb5692b1c96c22775ae3963e5f5cb30e4a66d9b20a72c1e51a","schema_version":"1.0","event_id":"sha256:f99653b8696669fb5692b1c96c22775ae3963e5f5cb30e4a66d9b20a72c1e51a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/bundle.json","state_url":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T13:05:07Z","links":{"resolver":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB","bundle":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/bundle.json","state":"https://pith.science/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ADRPN6BOGKODNWEJSUZAK5OUAB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ADRPN6BOGKODNWEJSUZAK5OUAB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"80566f583b0f3af81d07749bc714bff018dd57e06d490e5625926e65bdca1687","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-15T22:09:33Z","title_canon_sha256":"ef63f8e2477f1d6977bf9b37c8b3f01d49b57814f9dec2017403e3de1c7661f2"},"schema_version":"1.0","source":{"id":"1804.05439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05439","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05439v1","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05439","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"ADRPN6BOGKOD","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ADRPN6BOGKODNWEJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ADRPN6BO","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:f99653b8696669fb5692b1c96c22775ae3963e5f5cb30e4a66d9b20a72c1e51a","target":"graph","created_at":"2026-05-18T00:18:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Marius Tiba, Stefan David","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-15T22:09:33Z","title":"Solvability of Mazes by Blind Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05439","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:67baf3492b33269eeaa5bb4f56cf1ed27670bc16b2eb631872d5a8a1cb362014","target":"record","created_at":"2026-05-18T00:18:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"80566f583b0f3af81d07749bc714bff018dd57e06d490e5625926e65bdca1687","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-15T22:09:33Z","title_canon_sha256":"ef63f8e2477f1d6977bf9b37c8b3f01d49b57814f9dec2017403e3de1c7661f2"},"schema_version":"1.0","source":{"id":"1804.05439","kind":"arxiv","version":1}},"canonical_sha256":"00e2f6f82e329c36d88995320575d400649d9b33e44e1883011860e7cf75d078","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00e2f6f82e329c36d88995320575d400649d9b33e44e1883011860e7cf75d078","first_computed_at":"2026-05-18T00:18:28.129833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:28.129833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gmi+qZRC0tUxiv1BPx5m/wuQo+yHz6UJ3DSRUNk0CWH0YFENu8XczTvRUQ9eknKvJs1V5tu/aC9pLSubB1cLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:28.130217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67baf3492b33269eeaa5bb4f56cf1ed27670bc16b2eb631872d5a8a1cb362014","sha256:f99653b8696669fb5692b1c96c22775ae3963e5f5cb30e4a66d9b20a72c1e51a"],"state_sha256":"ac14047cd138cf23257102937fdf3122ca45bbe2747b6a79dd3489935c3b987d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7YQEd0xQb307OsUtWp2XcINcFn7ajQ4Ze9OTRHrtHhgcVmQs6AZmx1ldN/OHhGqscgmc20hEKsAp+TCBFdNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:05:07.817873Z","bundle_sha256":"5ad727dd1a558983c3638653851c17d6026e848d79349e519bb4a4a846d178f1"}}