{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4NLH22WSZ42WALJVSA4IQDRJRC","short_pith_number":"pith:4NLH22WS","canonical_record":{"source":{"id":"1712.03139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-08T15:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"3345ddda842b3fa0c53a195ae578598ab540694d165dae5422491c8a87bea57e","abstract_canon_sha256":"0c92e599da61bd43cfddc533a49c941846161d4342bad5cb2142ec9aa2a3f2da"},"schema_version":"1.0"},"canonical_sha256":"e3567d6ad2cf35602d359038880e2988bc4b95b5443b223034f58349b0c45f33","source":{"kind":"arxiv","id":"1712.03139","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03139","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03139v1","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03139","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"4NLH22WSZ42W","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NLH22WSZ42WALJV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NLH22WS","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4NLH22WSZ42WALJVSA4IQDRJRC","target":"record","payload":{"canonical_record":{"source":{"id":"1712.03139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-08T15:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"3345ddda842b3fa0c53a195ae578598ab540694d165dae5422491c8a87bea57e","abstract_canon_sha256":"0c92e599da61bd43cfddc533a49c941846161d4342bad5cb2142ec9aa2a3f2da"},"schema_version":"1.0"},"canonical_sha256":"e3567d6ad2cf35602d359038880e2988bc4b95b5443b223034f58349b0c45f33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:30.877140Z","signature_b64":"DbW+gP9p1VoycpTPy/ne1PmKcezjjg4rA3tAwhVdjbDeuSVMlezoVfetYDHIHg7rNbSaBys0uf3niiLf/w/FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3567d6ad2cf35602d359038880e2988bc4b95b5443b223034f58349b0c45f33","last_reissued_at":"2026-05-17T23:46:30.876476Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:30.876476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.03139","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-17T23:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kNpzC/zz5hs+rnUGIdbAcQHT/cupXHYncr/tsrNBCXerzndnzxPBXDj/+7Yo2sfqAhOSkaGC02JwKwO+0IjQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:09:35.356663Z"},"content_sha256":"8e8fd6ec1fa50cf962ecb34a90069979cdb32bbe83e57ecf510c7b25bf5fac86","schema_version":"1.0","event_id":"sha256:8e8fd6ec1fa50cf962ecb34a90069979cdb32bbe83e57ecf510c7b25bf5fac86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4NLH22WSZ42WALJVSA4IQDRJRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When the path is never shortest: a reality check on shortest path biocomputation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Richard Mayne","submitted_at":"2017-12-08T15:57:28Z","abstract_excerpt":"Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route optimisation and labyrinth navigation, but their outputs are typically difficult to reproduce and somewhat abstract in nature, suggesting that both experimental design and analysis in the field require standardising. This chapter details laboratory experimental data which probe the path finding process in two single-celled protistic model organis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03139","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-17T23:46:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EfMcqxvqUfCdSZkml5xpXy4nYIdHFxglUFGnaQUH1NJVD3dZWqgg4KOizVvrEf6fkpGxiWw7vpt1HuoZ/WWpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:09:35.357204Z"},"content_sha256":"5b146da2a6ba5f5420039a6265f105286b833579be76e6fdf8b5461a733aa406","schema_version":"1.0","event_id":"sha256:5b146da2a6ba5f5420039a6265f105286b833579be76e6fdf8b5461a733aa406"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NLH22WSZ42WALJVSA4IQDRJRC/bundle.json","state_url":"https://pith.science/pith/4NLH22WSZ42WALJVSA4IQDRJRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NLH22WSZ42WALJVSA4IQDRJRC/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-08T23:09:35Z","links":{"resolver":"https://pith.science/pith/4NLH22WSZ42WALJVSA4IQDRJRC","bundle":"https://pith.science/pith/4NLH22WSZ42WALJVSA4IQDRJRC/bundle.json","state":"https://pith.science/pith/4NLH22WSZ42WALJVSA4IQDRJRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NLH22WSZ42WALJVSA4IQDRJRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4NLH22WSZ42WALJVSA4IQDRJRC","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":"0c92e599da61bd43cfddc533a49c941846161d4342bad5cb2142ec9aa2a3f2da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-08T15:57:28Z","title_canon_sha256":"3345ddda842b3fa0c53a195ae578598ab540694d165dae5422491c8a87bea57e"},"schema_version":"1.0","source":{"id":"1712.03139","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.03139","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"arxiv_version","alias_value":"1712.03139v1","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.03139","created_at":"2026-05-17T23:46:30Z"},{"alias_kind":"pith_short_12","alias_value":"4NLH22WSZ42W","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NLH22WSZ42WALJV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NLH22WS","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:5b146da2a6ba5f5420039a6265f105286b833579be76e6fdf8b5461a733aa406","target":"graph","created_at":"2026-05-17T23:46:30Z","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":"Shortest path problems are a touchstone for evaluating the computing performance and functional range of novel computing substrates. Much has been published in recent years regarding the use of biocomputers to solve minimal path problems such as route optimisation and labyrinth navigation, but their outputs are typically difficult to reproduce and somewhat abstract in nature, suggesting that both experimental design and analysis in the field require standardising. This chapter details laboratory experimental data which probe the path finding process in two single-celled protistic model organis","authors_text":"Richard Mayne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-08T15:57:28Z","title":"When the path is never shortest: a reality check on shortest path biocomputation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.03139","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:8e8fd6ec1fa50cf962ecb34a90069979cdb32bbe83e57ecf510c7b25bf5fac86","target":"record","created_at":"2026-05-17T23:46:30Z","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":"0c92e599da61bd43cfddc533a49c941846161d4342bad5cb2142ec9aa2a3f2da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-12-08T15:57:28Z","title_canon_sha256":"3345ddda842b3fa0c53a195ae578598ab540694d165dae5422491c8a87bea57e"},"schema_version":"1.0","source":{"id":"1712.03139","kind":"arxiv","version":1}},"canonical_sha256":"e3567d6ad2cf35602d359038880e2988bc4b95b5443b223034f58349b0c45f33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3567d6ad2cf35602d359038880e2988bc4b95b5443b223034f58349b0c45f33","first_computed_at":"2026-05-17T23:46:30.876476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:30.876476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DbW+gP9p1VoycpTPy/ne1PmKcezjjg4rA3tAwhVdjbDeuSVMlezoVfetYDHIHg7rNbSaBys0uf3niiLf/w/FCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:30.877140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.03139","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e8fd6ec1fa50cf962ecb34a90069979cdb32bbe83e57ecf510c7b25bf5fac86","sha256:5b146da2a6ba5f5420039a6265f105286b833579be76e6fdf8b5461a733aa406"],"state_sha256":"e0e864e154a5b003aef295a970549af681c2f355d9d73bc1086f3410a89dc8a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGaJ7GNOiwAdT6or3bzUoLReGM3dbj0ARIFWDYn3ItfFYpuiRG63VBN7q9psr0Qa6vWNykuQV5tjZd/QqkjuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:09:35.359762Z","bundle_sha256":"f90beb892207b21d858cc30bff5240d681a22432beb492ecad8db5ba542bdc2b"}}