{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BNW5VU3XCKEXUJVZKHYQOEVDMY","short_pith_number":"pith:BNW5VU3X","canonical_record":{"source":{"id":"1809.04677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-09-12T21:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"0e881994b82737e2b0826565416662075c46b072495d1a356aa6629149e5e733","abstract_canon_sha256":"70f4f6526759370e69902f3bb8f4ec406be598864bb262cfbba7ff527bf1a8f5"},"schema_version":"1.0"},"canonical_sha256":"0b6ddad37712897a26b951f10712a366313de157f085d3941d01a4ddf0d43729","source":{"kind":"arxiv","id":"1809.04677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04677","created_at":"2026-05-17T23:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04677v1","created_at":"2026-05-17T23:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04677","created_at":"2026-05-17T23:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"BNW5VU3XCKEX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BNW5VU3XCKEXUJVZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BNW5VU3X","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BNW5VU3XCKEXUJVZKHYQOEVDMY","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-09-12T21:11:17Z","cross_cats_sorted":[],"title_canon_sha256":"0e881994b82737e2b0826565416662075c46b072495d1a356aa6629149e5e733","abstract_canon_sha256":"70f4f6526759370e69902f3bb8f4ec406be598864bb262cfbba7ff527bf1a8f5"},"schema_version":"1.0"},"canonical_sha256":"0b6ddad37712897a26b951f10712a366313de157f085d3941d01a4ddf0d43729","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:03.853554Z","signature_b64":"Fna7JRa1Xmc9D5vOfz5E9ARlr3IK+jj58ophYuk0T0PeBTwoz214CjD9MJekOJqF0QDcn6b9EPi2IE9SgS2tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b6ddad37712897a26b951f10712a366313de157f085d3941d01a4ddf0d43729","last_reissued_at":"2026-05-17T23:58:03.853045Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:03.853045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04677","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:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMfEvF6HgHryJuRFWpsY1dXV1meoDb2CbpDP4CD9lQV1Z+QPJTdE+DqDsSV4xus1orgqRw7eEyPpU5MYohYnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:15:16.305905Z"},"content_sha256":"453ef1459f75ff6fec4daef0c6ff9cbb8af1b6804d5a4bac408fdc789d8961d3","schema_version":"1.0","event_id":"sha256:453ef1459f75ff6fec4daef0c6ff9cbb8af1b6804d5a4bac408fdc789d8961d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BNW5VU3XCKEXUJVZKHYQOEVDMY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A scalable method to find the shortest path in a graph with circuits of memristors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Alice Mizrahi, Brian Hoskins, M.D. Stiles, Thomas Marsh","submitted_at":"2018-09-12T21:11:17Z","abstract_excerpt":"Finding the shortest path in a graph has applications to a wide range of optimization problems. However, algorithmic methods scale with the size of the graph in terms of time and energy. We propose a method to solve the shortest path problem using circuits of nanodevices called memristors and validate it on graphs of different sizes and topologies. It is both valid for an experimentally derived memristor model and robust to device variability. The time and energy of the computation scale with the length of the shortest path rather than with the size of the graph, making this method particularl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04677","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:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sdgpgRYNbexGVz579N0/MmsFZ1Eso1BKxeDUH4RwCz6QglI4IgLJyJ+TnDCNO8FThIt3S9oYDErjx5hevL5HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:15:16.306247Z"},"content_sha256":"940392d51af2929edf7508f00ffc04b70e9a928099e8c18771c159ad822163fc","schema_version":"1.0","event_id":"sha256:940392d51af2929edf7508f00ffc04b70e9a928099e8c18771c159ad822163fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNW5VU3XCKEXUJVZKHYQOEVDMY/bundle.json","state_url":"https://pith.science/pith/BNW5VU3XCKEXUJVZKHYQOEVDMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNW5VU3XCKEXUJVZKHYQOEVDMY/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-05T14:15:16Z","links":{"resolver":"https://pith.science/pith/BNW5VU3XCKEXUJVZKHYQOEVDMY","bundle":"https://pith.science/pith/BNW5VU3XCKEXUJVZKHYQOEVDMY/bundle.json","state":"https://pith.science/pith/BNW5VU3XCKEXUJVZKHYQOEVDMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNW5VU3XCKEXUJVZKHYQOEVDMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BNW5VU3XCKEXUJVZKHYQOEVDMY","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":"70f4f6526759370e69902f3bb8f4ec406be598864bb262cfbba7ff527bf1a8f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-09-12T21:11:17Z","title_canon_sha256":"0e881994b82737e2b0826565416662075c46b072495d1a356aa6629149e5e733"},"schema_version":"1.0","source":{"id":"1809.04677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04677","created_at":"2026-05-17T23:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04677v1","created_at":"2026-05-17T23:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04677","created_at":"2026-05-17T23:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"BNW5VU3XCKEX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BNW5VU3XCKEXUJVZ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BNW5VU3X","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:940392d51af2929edf7508f00ffc04b70e9a928099e8c18771c159ad822163fc","target":"graph","created_at":"2026-05-17T23:58:03Z","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":"Finding the shortest path in a graph has applications to a wide range of optimization problems. However, algorithmic methods scale with the size of the graph in terms of time and energy. We propose a method to solve the shortest path problem using circuits of nanodevices called memristors and validate it on graphs of different sizes and topologies. It is both valid for an experimentally derived memristor model and robust to device variability. The time and energy of the computation scale with the length of the shortest path rather than with the size of the graph, making this method particularl","authors_text":"Alice Mizrahi, Brian Hoskins, M.D. Stiles, Thomas Marsh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-09-12T21:11:17Z","title":"A scalable method to find the shortest path in a graph with circuits of memristors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04677","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:453ef1459f75ff6fec4daef0c6ff9cbb8af1b6804d5a4bac408fdc789d8961d3","target":"record","created_at":"2026-05-17T23:58:03Z","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":"70f4f6526759370e69902f3bb8f4ec406be598864bb262cfbba7ff527bf1a8f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-09-12T21:11:17Z","title_canon_sha256":"0e881994b82737e2b0826565416662075c46b072495d1a356aa6629149e5e733"},"schema_version":"1.0","source":{"id":"1809.04677","kind":"arxiv","version":1}},"canonical_sha256":"0b6ddad37712897a26b951f10712a366313de157f085d3941d01a4ddf0d43729","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b6ddad37712897a26b951f10712a366313de157f085d3941d01a4ddf0d43729","first_computed_at":"2026-05-17T23:58:03.853045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:03.853045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fna7JRa1Xmc9D5vOfz5E9ARlr3IK+jj58ophYuk0T0PeBTwoz214CjD9MJekOJqF0QDcn6b9EPi2IE9SgS2tCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:03.853554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:453ef1459f75ff6fec4daef0c6ff9cbb8af1b6804d5a4bac408fdc789d8961d3","sha256:940392d51af2929edf7508f00ffc04b70e9a928099e8c18771c159ad822163fc"],"state_sha256":"373cbe1382f7770e1d2acfae263ba998dea3535e61c1e47d35044753f7a53d03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/fuHR2Rlv5hrwKzrJsS8sRdLkd0+Mw+zT6mtNiMa1xxXF2JyJUGAO1PVLPMLwneaX2RJBViJBOvi2MnRjI+ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:15:16.308109Z","bundle_sha256":"b7a7f9ddc2d1c40ccf5063b98b134438ef320d9e29776fd0a1e016c816ae2dc2"}}