{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EMZUKXIDYW3XXVNE5O3FQZ4MHV","short_pith_number":"pith:EMZUKXID","canonical_record":{"source":{"id":"1405.0931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-05T15:34:29Z","cross_cats_sorted":["cond-mat.mes-hall","cs.ET","cs.IT","math.IT"],"title_canon_sha256":"d7b0c09d65a03456e508e55fe73831c870f25bb4002ebbd79f7ac52f6819f8e9","abstract_canon_sha256":"fea5dd58c83aa261b60623b147bebf055d97bf09e7eda952ea9d144e363e2296"},"schema_version":"1.0"},"canonical_sha256":"2333455d03c5b77bd5a4ebb658678c3d48f949ec5ec12e6bf2111ef65b0d655d","source":{"kind":"arxiv","id":"1405.0931","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0931","created_at":"2026-05-18T01:24:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0931v2","created_at":"2026-05-18T01:24:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0931","created_at":"2026-05-18T01:24:14Z"},{"alias_kind":"pith_short_12","alias_value":"EMZUKXIDYW3X","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EMZUKXIDYW3XXVNE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EMZUKXID","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EMZUKXIDYW3XXVNE5O3FQZ4MHV","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0931","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-05T15:34:29Z","cross_cats_sorted":["cond-mat.mes-hall","cs.ET","cs.IT","math.IT"],"title_canon_sha256":"d7b0c09d65a03456e508e55fe73831c870f25bb4002ebbd79f7ac52f6819f8e9","abstract_canon_sha256":"fea5dd58c83aa261b60623b147bebf055d97bf09e7eda952ea9d144e363e2296"},"schema_version":"1.0"},"canonical_sha256":"2333455d03c5b77bd5a4ebb658678c3d48f949ec5ec12e6bf2111ef65b0d655d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:14.826539Z","signature_b64":"3oumfPFftFcvtY5fD3paF0iInUmt8lBZ2UIsW29EAscF4aM0BsIQTDgxjhphE0OkvaY6YK0fUhphyvLPpsw5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2333455d03c5b77bd5a4ebb658678c3d48f949ec5ec12e6bf2111ef65b0d655d","last_reissued_at":"2026-05-18T01:24:14.825890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:14.825890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0931","source_version":2,"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-18T01:24:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"00Fp01iRxcONNyzH9Ar7XrPhSURhMuxTV11qnWTbGoNrB3pWMQcozKODh9qQhw823Up4JtjNUTGXaDzVdHIpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:27:25.384198Z"},"content_sha256":"0b89ce8c2ae3d88cdaa282dba4726b87000091614bf6ebbc9f0d29ac25b9934b","schema_version":"1.0","event_id":"sha256:0b89ce8c2ae3d88cdaa282dba4726b87000091614bf6ebbc9f0d29ac25b9934b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EMZUKXIDYW3XXVNE5O3FQZ4MHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Universal Memcomputing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cs.ET","cs.IT","math.IT"],"primary_cat":"cs.NE","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra","submitted_at":"2014-05-05T15:34:29Z","abstract_excerpt":"We introduce the notion of universal memcomputing machines (UMMs): a class of brain-inspired general-purpose computing machines based on systems with memory, whereby processing and storing of information occur on the same physical location. We analytically prove that the memory properties of UMMs endow them with universal computing power - they are Turing-complete -, intrinsic parallelism, functional polymorphism, and information overhead, namely their collective states can support exponential data compression directly in memory. We also demonstrate that a UMM has the same computational power "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0931","kind":"arxiv","version":2},"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-18T01:24:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DMaE4GrEO73ySnZAwljFEya4T/ck0y2yCIJWlzv1vBkVY1suBkPjcN0htuAf6aO84XZYa/Hkh433dyZT6GjcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:27:25.384805Z"},"content_sha256":"761fd7ffc0376b159d68d187e201b2320f78c8b7d6ac136a206606a6e68b8a64","schema_version":"1.0","event_id":"sha256:761fd7ffc0376b159d68d187e201b2320f78c8b7d6ac136a206606a6e68b8a64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMZUKXIDYW3XXVNE5O3FQZ4MHV/bundle.json","state_url":"https://pith.science/pith/EMZUKXIDYW3XXVNE5O3FQZ4MHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMZUKXIDYW3XXVNE5O3FQZ4MHV/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-31T09:27:25Z","links":{"resolver":"https://pith.science/pith/EMZUKXIDYW3XXVNE5O3FQZ4MHV","bundle":"https://pith.science/pith/EMZUKXIDYW3XXVNE5O3FQZ4MHV/bundle.json","state":"https://pith.science/pith/EMZUKXIDYW3XXVNE5O3FQZ4MHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMZUKXIDYW3XXVNE5O3FQZ4MHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EMZUKXIDYW3XXVNE5O3FQZ4MHV","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":"fea5dd58c83aa261b60623b147bebf055d97bf09e7eda952ea9d144e363e2296","cross_cats_sorted":["cond-mat.mes-hall","cs.ET","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-05T15:34:29Z","title_canon_sha256":"d7b0c09d65a03456e508e55fe73831c870f25bb4002ebbd79f7ac52f6819f8e9"},"schema_version":"1.0","source":{"id":"1405.0931","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0931","created_at":"2026-05-18T01:24:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0931v2","created_at":"2026-05-18T01:24:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0931","created_at":"2026-05-18T01:24:14Z"},{"alias_kind":"pith_short_12","alias_value":"EMZUKXIDYW3X","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EMZUKXIDYW3XXVNE","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EMZUKXID","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:761fd7ffc0376b159d68d187e201b2320f78c8b7d6ac136a206606a6e68b8a64","target":"graph","created_at":"2026-05-18T01:24:14Z","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 introduce the notion of universal memcomputing machines (UMMs): a class of brain-inspired general-purpose computing machines based on systems with memory, whereby processing and storing of information occur on the same physical location. We analytically prove that the memory properties of UMMs endow them with universal computing power - they are Turing-complete -, intrinsic parallelism, functional polymorphism, and information overhead, namely their collective states can support exponential data compression directly in memory. We also demonstrate that a UMM has the same computational power ","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra","cross_cats":["cond-mat.mes-hall","cs.ET","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-05T15:34:29Z","title":"Universal Memcomputing Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0931","kind":"arxiv","version":2},"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:0b89ce8c2ae3d88cdaa282dba4726b87000091614bf6ebbc9f0d29ac25b9934b","target":"record","created_at":"2026-05-18T01:24:14Z","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":"fea5dd58c83aa261b60623b147bebf055d97bf09e7eda952ea9d144e363e2296","cross_cats_sorted":["cond-mat.mes-hall","cs.ET","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-05-05T15:34:29Z","title_canon_sha256":"d7b0c09d65a03456e508e55fe73831c870f25bb4002ebbd79f7ac52f6819f8e9"},"schema_version":"1.0","source":{"id":"1405.0931","kind":"arxiv","version":2}},"canonical_sha256":"2333455d03c5b77bd5a4ebb658678c3d48f949ec5ec12e6bf2111ef65b0d655d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2333455d03c5b77bd5a4ebb658678c3d48f949ec5ec12e6bf2111ef65b0d655d","first_computed_at":"2026-05-18T01:24:14.825890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:14.825890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3oumfPFftFcvtY5fD3paF0iInUmt8lBZ2UIsW29EAscF4aM0BsIQTDgxjhphE0OkvaY6YK0fUhphyvLPpsw5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:14.826539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0931","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b89ce8c2ae3d88cdaa282dba4726b87000091614bf6ebbc9f0d29ac25b9934b","sha256:761fd7ffc0376b159d68d187e201b2320f78c8b7d6ac136a206606a6e68b8a64"],"state_sha256":"14b17dc08cba61ebf9bfc6e610118da6e348aa46fd463f6882fb17082be3a952"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bczFOPYUPLZvtPlky+W7D2GBxGhMSYo4S3gOu5SdAyT9GEMb2fb99TFkhgTenMO9ap01XIvfAc5/7IO8jvTeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:27:25.387793Z","bundle_sha256":"42d98602d97a2448439f07f5ca9e5d7da119ef959bd874b5122101a82be31e44"}}