{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LEE2QZU5PGOLNMEMCAI7YUT377","short_pith_number":"pith:LEE2QZU5","canonical_record":{"source":{"id":"1408.6741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-08-28T14:55:16Z","cross_cats_sorted":["cond-mat.mes-hall","cs.ET"],"title_canon_sha256":"05db02d7a14c87ddf3cb01962f5d64d96e92f1724c4dfdeb8f93d2577546ab8d","abstract_canon_sha256":"4eaa5c128ef3e3175cdf5cde934d7be74cdc3b1a3e65056c9cefa2e280b31476"},"schema_version":"1.0"},"canonical_sha256":"5909a8669d799cb6b08c1011fc527bffda1f3edbbb67d974a67073298a1f254e","source":{"kind":"arxiv","id":"1408.6741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6741","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6741v1","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6741","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"LEE2QZU5PGOL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LEE2QZU5PGOLNMEM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LEE2QZU5","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LEE2QZU5PGOLNMEMCAI7YUT377","target":"record","payload":{"canonical_record":{"source":{"id":"1408.6741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-08-28T14:55:16Z","cross_cats_sorted":["cond-mat.mes-hall","cs.ET"],"title_canon_sha256":"05db02d7a14c87ddf3cb01962f5d64d96e92f1724c4dfdeb8f93d2577546ab8d","abstract_canon_sha256":"4eaa5c128ef3e3175cdf5cde934d7be74cdc3b1a3e65056c9cefa2e280b31476"},"schema_version":"1.0"},"canonical_sha256":"5909a8669d799cb6b08c1011fc527bffda1f3edbbb67d974a67073298a1f254e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:00.943855Z","signature_b64":"tJ57c/Skk6uHuNggDN8V7DK0VLZECfNvMTDXDgTN/mDUp3a/onnHUE+UnSU0RjnycAfSrGIZLuEBCRoCzOY9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5909a8669d799cb6b08c1011fc527bffda1f3edbbb67d974a67073298a1f254e","last_reissued_at":"2026-05-18T02:44:00.943456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:00.943456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.6741","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-18T02:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbW/gkeFJHKK1Mrca0yI2Tm9dZO6YTJWHo4/xoNrXGZsdwPNSgVt2FvyRj3uDsdlT1VoQ3wmrE2pA4iJrkvmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:57:09.801940Z"},"content_sha256":"150602c2f6c01c9751b4355014e2403151b2c5309f4a9ad1ab713acc66a42340","schema_version":"1.0","event_id":"sha256:150602c2f6c01c9751b4355014e2403151b2c5309f4a9ad1ab713acc66a42340"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LEE2QZU5PGOLNMEMCAI7YUT377","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memcomputing and Swarm Intelligence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cs.ET"],"primary_cat":"cs.NE","authors_text":"M. Di Ventra, Y. V. Pershin","submitted_at":"2014-08-28T14:55:16Z","abstract_excerpt":"We explore the relation between memcomputing, namely computing with and in memory, and swarm intelligence algorithms. In particular, we show that one can design memristive networks to solve short-path optimization problems that can also be solved by ant-colony algorithms. By employing appropriate memristive elements one can demonstrate an almost one-to-one correspondence between memcomputing and ant colony optimization approaches. However, the memristive network has the capability of finding the solution in one deterministic step, compared to the stochastic multi-step ant colony optimization. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6741","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-18T02:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOMgB2rqwkwTxaXMsPM/f0tkXflSSmuIBcjSpGgxwvFqzYtSVZXg9rFn8bdOJJD7u3B2qke1a4G7YnLJt44HAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:57:09.802616Z"},"content_sha256":"ec8174ce1dc4bddecf9aa6275e61f09a75a443d1bbdf29f7759d8b352dae64e6","schema_version":"1.0","event_id":"sha256:ec8174ce1dc4bddecf9aa6275e61f09a75a443d1bbdf29f7759d8b352dae64e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEE2QZU5PGOLNMEMCAI7YUT377/bundle.json","state_url":"https://pith.science/pith/LEE2QZU5PGOLNMEMCAI7YUT377/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEE2QZU5PGOLNMEMCAI7YUT377/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-06T19:57:09Z","links":{"resolver":"https://pith.science/pith/LEE2QZU5PGOLNMEMCAI7YUT377","bundle":"https://pith.science/pith/LEE2QZU5PGOLNMEMCAI7YUT377/bundle.json","state":"https://pith.science/pith/LEE2QZU5PGOLNMEMCAI7YUT377/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEE2QZU5PGOLNMEMCAI7YUT377/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LEE2QZU5PGOLNMEMCAI7YUT377","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":"4eaa5c128ef3e3175cdf5cde934d7be74cdc3b1a3e65056c9cefa2e280b31476","cross_cats_sorted":["cond-mat.mes-hall","cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-08-28T14:55:16Z","title_canon_sha256":"05db02d7a14c87ddf3cb01962f5d64d96e92f1724c4dfdeb8f93d2577546ab8d"},"schema_version":"1.0","source":{"id":"1408.6741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.6741","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"1408.6741v1","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6741","created_at":"2026-05-18T02:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"LEE2QZU5PGOL","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LEE2QZU5PGOLNMEM","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LEE2QZU5","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:ec8174ce1dc4bddecf9aa6275e61f09a75a443d1bbdf29f7759d8b352dae64e6","target":"graph","created_at":"2026-05-18T02:44:00Z","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 explore the relation between memcomputing, namely computing with and in memory, and swarm intelligence algorithms. In particular, we show that one can design memristive networks to solve short-path optimization problems that can also be solved by ant-colony algorithms. By employing appropriate memristive elements one can demonstrate an almost one-to-one correspondence between memcomputing and ant colony optimization approaches. However, the memristive network has the capability of finding the solution in one deterministic step, compared to the stochastic multi-step ant colony optimization. ","authors_text":"M. Di Ventra, Y. V. Pershin","cross_cats":["cond-mat.mes-hall","cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-08-28T14:55:16Z","title":"Memcomputing and Swarm Intelligence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6741","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:150602c2f6c01c9751b4355014e2403151b2c5309f4a9ad1ab713acc66a42340","target":"record","created_at":"2026-05-18T02:44:00Z","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":"4eaa5c128ef3e3175cdf5cde934d7be74cdc3b1a3e65056c9cefa2e280b31476","cross_cats_sorted":["cond-mat.mes-hall","cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-08-28T14:55:16Z","title_canon_sha256":"05db02d7a14c87ddf3cb01962f5d64d96e92f1724c4dfdeb8f93d2577546ab8d"},"schema_version":"1.0","source":{"id":"1408.6741","kind":"arxiv","version":1}},"canonical_sha256":"5909a8669d799cb6b08c1011fc527bffda1f3edbbb67d974a67073298a1f254e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5909a8669d799cb6b08c1011fc527bffda1f3edbbb67d974a67073298a1f254e","first_computed_at":"2026-05-18T02:44:00.943456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:00.943456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tJ57c/Skk6uHuNggDN8V7DK0VLZECfNvMTDXDgTN/mDUp3a/onnHUE+UnSU0RjnycAfSrGIZLuEBCRoCzOY9CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:00.943855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.6741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:150602c2f6c01c9751b4355014e2403151b2c5309f4a9ad1ab713acc66a42340","sha256:ec8174ce1dc4bddecf9aa6275e61f09a75a443d1bbdf29f7759d8b352dae64e6"],"state_sha256":"db156cff12f3fa540f3d33431b36dcac971c992699a87f4a9617089a4fe416c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fu+2HYJ47XYAAWhOn5uuzTISTibycJbZREgDEXwkHPPF86/s1mMRyNQ31S7G6Q2fvDmRTbRZWfDHem4UUnF4Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:57:09.806138Z","bundle_sha256":"bff9afde7dc4c58f0493beea4d43bdc16595e8745f813984ad2b91a4dadaab9a"}}