{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HRN6VHL6NZFLAEWBESJ7L7XI7V","short_pith_number":"pith:HRN6VHL6","canonical_record":{"source":{"id":"1712.05202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-14T12:54:22Z","cross_cats_sorted":["nlin.CG"],"title_canon_sha256":"f178fd538623a2891c4775c96f756283622d439825647de35c4b0551e44163cf","abstract_canon_sha256":"48c931e29cfe57891a224053b3a4de3531dfc41c18310918afdcf4731f2e2974"},"schema_version":"1.0"},"canonical_sha256":"3c5bea9d7e6e4ab012c12493f5fee8fd62167013f84eb67bd2b230c590f094a7","source":{"kind":"arxiv","id":"1712.05202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05202","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05202v1","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05202","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"HRN6VHL6NZFL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HRN6VHL6NZFLAEWB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HRN6VHL6","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HRN6VHL6NZFLAEWBESJ7L7XI7V","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-14T12:54:22Z","cross_cats_sorted":["nlin.CG"],"title_canon_sha256":"f178fd538623a2891c4775c96f756283622d439825647de35c4b0551e44163cf","abstract_canon_sha256":"48c931e29cfe57891a224053b3a4de3531dfc41c18310918afdcf4731f2e2974"},"schema_version":"1.0"},"canonical_sha256":"3c5bea9d7e6e4ab012c12493f5fee8fd62167013f84eb67bd2b230c590f094a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:58.599101Z","signature_b64":"J9C0kZnsYVwsS5Mr8B+uzCmKPwdfeAiCikHVtToiU4ZNkTKE74+l6nOFKvi0/A2C2Yo5jQJQTt5IWpW14b4iBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c5bea9d7e6e4ab012c12493f5fee8fd62167013f84eb67bd2b230c590f094a7","last_reissued_at":"2026-05-18T00:27:58.598637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:58.598637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05202","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:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xh+eWiD6JvW4PvGUPcq+MccBEDyLWRCVXatgQ2iO3FSRrKWPkqWjSwJvT/zmh3KNdoy5Ab2ge2x2K3H7X/ZBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:40:18.620740Z"},"content_sha256":"47ab29c144b31fe254d316c8b6b6eb19009d8eedc4e6891e62f4f0e40f7d102d","schema_version":"1.0","event_id":"sha256:47ab29c144b31fe254d316c8b6b6eb19009d8eedc4e6891e62f4f0e40f7d102d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HRN6VHL6NZFLAEWBESJ7L7XI7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cellular Automata Applications in Shortest Path Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["nlin.CG"],"primary_cat":"cs.CG","authors_text":"Andrew Adamatzky, Georgios Ch. Sirakoulis, Konstantinos Ioannidis, Michail-Antisthenis I. Tsompanas, Nikolaos I. Dourvas, Rolf Hoffmann","submitted_at":"2017-12-14T12:54:22Z","abstract_excerpt":"Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even uncon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05202","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:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqzsjcdaLTpb9AzAM2ASFdzpwwidRwfc+ynqO83cdC8hhNqh9kT0jJv5o9l5OQQtPYDDcl5pOS8bM8gaqVhgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:40:18.621326Z"},"content_sha256":"c8d24a90eb3c0296f9bb061a3f64d137ba1e27347198c000c3b6408e343c846b","schema_version":"1.0","event_id":"sha256:c8d24a90eb3c0296f9bb061a3f64d137ba1e27347198c000c3b6408e343c846b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRN6VHL6NZFLAEWBESJ7L7XI7V/bundle.json","state_url":"https://pith.science/pith/HRN6VHL6NZFLAEWBESJ7L7XI7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRN6VHL6NZFLAEWBESJ7L7XI7V/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-31T11:40:18Z","links":{"resolver":"https://pith.science/pith/HRN6VHL6NZFLAEWBESJ7L7XI7V","bundle":"https://pith.science/pith/HRN6VHL6NZFLAEWBESJ7L7XI7V/bundle.json","state":"https://pith.science/pith/HRN6VHL6NZFLAEWBESJ7L7XI7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRN6VHL6NZFLAEWBESJ7L7XI7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HRN6VHL6NZFLAEWBESJ7L7XI7V","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":"48c931e29cfe57891a224053b3a4de3531dfc41c18310918afdcf4731f2e2974","cross_cats_sorted":["nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-14T12:54:22Z","title_canon_sha256":"f178fd538623a2891c4775c96f756283622d439825647de35c4b0551e44163cf"},"schema_version":"1.0","source":{"id":"1712.05202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05202","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05202v1","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05202","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"HRN6VHL6NZFL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HRN6VHL6NZFLAEWB","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HRN6VHL6","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:c8d24a90eb3c0296f9bb061a3f64d137ba1e27347198c000c3b6408e343c846b","target":"graph","created_at":"2026-05-18T00:27:58Z","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":"Cellular Automata (CAs) are computational models that can capture the essential features of systems in which global behavior emerges from the collective effect of simple components, which interact locally. During the last decades, CAs have been extensively used for mimicking several natural processes and systems to find fine solutions in many complex hard to solve computer science and engineering problems. Among them, the shortest path problem is one of the most pronounced and highly studied problems that scientists have been trying to tackle by using a plethora of methodologies and even uncon","authors_text":"Andrew Adamatzky, Georgios Ch. Sirakoulis, Konstantinos Ioannidis, Michail-Antisthenis I. Tsompanas, Nikolaos I. Dourvas, Rolf Hoffmann","cross_cats":["nlin.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-14T12:54:22Z","title":"Cellular Automata Applications in Shortest Path Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05202","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:47ab29c144b31fe254d316c8b6b6eb19009d8eedc4e6891e62f4f0e40f7d102d","target":"record","created_at":"2026-05-18T00:27:58Z","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":"48c931e29cfe57891a224053b3a4de3531dfc41c18310918afdcf4731f2e2974","cross_cats_sorted":["nlin.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-14T12:54:22Z","title_canon_sha256":"f178fd538623a2891c4775c96f756283622d439825647de35c4b0551e44163cf"},"schema_version":"1.0","source":{"id":"1712.05202","kind":"arxiv","version":1}},"canonical_sha256":"3c5bea9d7e6e4ab012c12493f5fee8fd62167013f84eb67bd2b230c590f094a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c5bea9d7e6e4ab012c12493f5fee8fd62167013f84eb67bd2b230c590f094a7","first_computed_at":"2026-05-18T00:27:58.598637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:58.598637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J9C0kZnsYVwsS5Mr8B+uzCmKPwdfeAiCikHVtToiU4ZNkTKE74+l6nOFKvi0/A2C2Yo5jQJQTt5IWpW14b4iBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:58.599101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47ab29c144b31fe254d316c8b6b6eb19009d8eedc4e6891e62f4f0e40f7d102d","sha256:c8d24a90eb3c0296f9bb061a3f64d137ba1e27347198c000c3b6408e343c846b"],"state_sha256":"b002afbac551dcff5ed164b6cd4e8e0e7c7f61afb01e3362f09acdcb0dea9d28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UdGK9sfhmDhFYG6mi/0QrZ/K+B0vuHfSx9aicuFyIqrq9sHENC3hBi0kM2GE/H8eX5G+H50jHn8kbj5ThD6oCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:40:18.624139Z","bundle_sha256":"8c3a287eff995c5ce52c07e92f730e1063d70060a01d6fc6dd265e2acbcd182e"}}