{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HCCAIXZ6UM5YM4EYEIXVQAL7II","short_pith_number":"pith:HCCAIXZ6","canonical_record":{"source":{"id":"1703.09406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-03-28T05:53:34Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b7a8a653d0b2bb6a35aaa9e5d0f43c8dfb0f615ce2b4d1d973c8b1d4f5fee416","abstract_canon_sha256":"6f742597d79813566c60972ea2a97d373ccc5057ae0c34b08ae31c3db4884587"},"schema_version":"1.0"},"canonical_sha256":"3884045f3ea33b867098222f58017f422378ed1f540a627454fde34230fceec7","source":{"kind":"arxiv","id":"1703.09406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09406","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09406v1","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09406","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"HCCAIXZ6UM5Y","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HCCAIXZ6UM5YM4EY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HCCAIXZ6","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HCCAIXZ6UM5YM4EYEIXVQAL7II","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-03-28T05:53:34Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"b7a8a653d0b2bb6a35aaa9e5d0f43c8dfb0f615ce2b4d1d973c8b1d4f5fee416","abstract_canon_sha256":"6f742597d79813566c60972ea2a97d373ccc5057ae0c34b08ae31c3db4884587"},"schema_version":"1.0"},"canonical_sha256":"3884045f3ea33b867098222f58017f422378ed1f540a627454fde34230fceec7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:44.657032Z","signature_b64":"udGT0eT2desxZcm6wAFasl5xC0Frb4HkXqcaE24qkUIcGA+enL8C02f0Ur5BxErYI88TcVe9yiic7Jf3ZnUlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3884045f3ea33b867098222f58017f422378ed1f540a627454fde34230fceec7","last_reissued_at":"2026-05-18T00:47:44.656331Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:44.656331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09406","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:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mxsRgp/p1MtFZTlp7Zb25YByJhszhIVqDNYav8VSRh/ZnUd5ErViM01zBXeln/Jqg9Vr7DvMtijX2iTrc7qXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:51:02.291254Z"},"content_sha256":"89a0c2a0a3d43de0fe41b047452ef5d01882b387df24abd064f958674c9cb52a","schema_version":"1.0","event_id":"sha256:89a0c2a0a3d43de0fe41b047452ef5d01882b387df24abd064f958674c9cb52a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HCCAIXZ6UM5YM4EYEIXVQAL7II","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the computability of graph Turing machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Cameron Freer, Nathanael Ackerman","submitted_at":"2017-03-28T05:53:34Z","abstract_excerpt":"We consider graph Turing machines, a model of parallel computation on a graph, in which each vertex is only capable of performing one of a finite number of operations. This model of computation is a natural generalization of several well-studied notions of computation, including ordinary Turing machines, cellular automata, and parallel graph dynamical systems. We analyze the power of computations that can take place in this model, both in terms of the degrees of computability of the functions that can be computed, and the time and space resources needed to carry out these computations. We furt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09406","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:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8l8RB/ELpgDBN6n7KxEFWdXGNY+kQLJUhhV0KePFM92ZjHUvIEVUKM1yj7FZeyfD8b3s9c5pMOVud+Zmw3b7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:51:02.291626Z"},"content_sha256":"652aed37d505989283e83f11bfff27a9c5d6a111ede2dd0624b74cbc92bf9a99","schema_version":"1.0","event_id":"sha256:652aed37d505989283e83f11bfff27a9c5d6a111ede2dd0624b74cbc92bf9a99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCCAIXZ6UM5YM4EYEIXVQAL7II/bundle.json","state_url":"https://pith.science/pith/HCCAIXZ6UM5YM4EYEIXVQAL7II/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCCAIXZ6UM5YM4EYEIXVQAL7II/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-06-23T01:51:02Z","links":{"resolver":"https://pith.science/pith/HCCAIXZ6UM5YM4EYEIXVQAL7II","bundle":"https://pith.science/pith/HCCAIXZ6UM5YM4EYEIXVQAL7II/bundle.json","state":"https://pith.science/pith/HCCAIXZ6UM5YM4EYEIXVQAL7II/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCCAIXZ6UM5YM4EYEIXVQAL7II/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HCCAIXZ6UM5YM4EYEIXVQAL7II","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":"6f742597d79813566c60972ea2a97d373ccc5057ae0c34b08ae31c3db4884587","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-03-28T05:53:34Z","title_canon_sha256":"b7a8a653d0b2bb6a35aaa9e5d0f43c8dfb0f615ce2b4d1d973c8b1d4f5fee416"},"schema_version":"1.0","source":{"id":"1703.09406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09406","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09406v1","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09406","created_at":"2026-05-18T00:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"HCCAIXZ6UM5Y","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HCCAIXZ6UM5YM4EY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HCCAIXZ6","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:652aed37d505989283e83f11bfff27a9c5d6a111ede2dd0624b74cbc92bf9a99","target":"graph","created_at":"2026-05-18T00:47:44Z","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":"We consider graph Turing machines, a model of parallel computation on a graph, in which each vertex is only capable of performing one of a finite number of operations. This model of computation is a natural generalization of several well-studied notions of computation, including ordinary Turing machines, cellular automata, and parallel graph dynamical systems. We analyze the power of computations that can take place in this model, both in terms of the degrees of computability of the functions that can be computed, and the time and space resources needed to carry out these computations. We furt","authors_text":"Cameron Freer, Nathanael Ackerman","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-03-28T05:53:34Z","title":"On the computability of graph Turing machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09406","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:89a0c2a0a3d43de0fe41b047452ef5d01882b387df24abd064f958674c9cb52a","target":"record","created_at":"2026-05-18T00:47:44Z","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":"6f742597d79813566c60972ea2a97d373ccc5057ae0c34b08ae31c3db4884587","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-03-28T05:53:34Z","title_canon_sha256":"b7a8a653d0b2bb6a35aaa9e5d0f43c8dfb0f615ce2b4d1d973c8b1d4f5fee416"},"schema_version":"1.0","source":{"id":"1703.09406","kind":"arxiv","version":1}},"canonical_sha256":"3884045f3ea33b867098222f58017f422378ed1f540a627454fde34230fceec7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3884045f3ea33b867098222f58017f422378ed1f540a627454fde34230fceec7","first_computed_at":"2026-05-18T00:47:44.656331Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:44.656331Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"udGT0eT2desxZcm6wAFasl5xC0Frb4HkXqcaE24qkUIcGA+enL8C02f0Ur5BxErYI88TcVe9yiic7Jf3ZnUlCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:44.657032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89a0c2a0a3d43de0fe41b047452ef5d01882b387df24abd064f958674c9cb52a","sha256:652aed37d505989283e83f11bfff27a9c5d6a111ede2dd0624b74cbc92bf9a99"],"state_sha256":"27bee6abdfe75b3c97fe8bb8fe2f761a58b79e2e81ef77e6a6763a6fee781790"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+VDSEO5yT/Y/vnBMY3P9QZRtUSDVHSfa7W6+gy6joRKiWuilGY0HU9KdNHhowfFSl1M+GvwPWS3gLbd3ToXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T01:51:02.293675Z","bundle_sha256":"cbbf514775cbc96aebd10456f01fa81f2b17ffcabbf5b7d660e235d758f6aa71"}}