{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SEF76J6PF6JKHNSNRAV5KQNOQ7","short_pith_number":"pith:SEF76J6P","canonical_record":{"source":{"id":"1712.08702","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-12-23T02:30:25Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"8ea7f71517f4b849794c3a009fed1ef02468a88b2b31bb4e748d1789cfd76a0c","abstract_canon_sha256":"888513d9c651e0c63231f6068f8656bacc24fe7fab5418e0e72ef034f3257121"},"schema_version":"1.0"},"canonical_sha256":"910bff27cf2f92a3b64d882bd541ae87f59c853cdcdef1ed0eceadfbd8ae1cd2","source":{"kind":"arxiv","id":"1712.08702","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08702","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08702v2","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08702","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"SEF76J6PF6JK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SEF76J6PF6JKHNSN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SEF76J6P","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SEF76J6PF6JKHNSNRAV5KQNOQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08702","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-12-23T02:30:25Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"8ea7f71517f4b849794c3a009fed1ef02468a88b2b31bb4e748d1789cfd76a0c","abstract_canon_sha256":"888513d9c651e0c63231f6068f8656bacc24fe7fab5418e0e72ef034f3257121"},"schema_version":"1.0"},"canonical_sha256":"910bff27cf2f92a3b64d882bd541ae87f59c853cdcdef1ed0eceadfbd8ae1cd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:59.902776Z","signature_b64":"bzfkE72ox5y9xl37feZoxVSKRKlOpRtYRKsLQq7dWZZClHX77KQCDXyA5FRcPa5+LL3MDApfLpN637HrUz8sCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910bff27cf2f92a3b64d882bd541ae87f59c853cdcdef1ed0eceadfbd8ae1cd2","last_reissued_at":"2026-05-17T23:44:59.902169Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:59.902169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08702","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-17T23:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69zFx2RfuZlYPeC5jGVJfsv8k0neG1cN3GO6StdjoVj8GiP8rvRpaxbH0B0VAGt0/AbEGFNXTYmQSdGt5BE9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:14:21.946442Z"},"content_sha256":"02288000a3ca617f80efcf5c638c1e31bd358da43f764cf8a7779645fe22b0b0","schema_version":"1.0","event_id":"sha256:02288000a3ca617f80efcf5c638c1e31bd358da43f764cf8a7779645fe22b0b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SEF76J6PF6JKHNSNRAV5KQNOQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Universality of Memcomputing Machines","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"cs.NE","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra, Yan Ru Pei","submitted_at":"2017-12-23T02:30:25Z","abstract_excerpt":"Universal memcomputing machines (UMMs) [IEEE Trans. Neural Netw. Learn. Syst. 26, 2702 (2015)] represent a novel computational model in which memory (time non-locality) accomplishes both tasks of storing and processing of information. UMMs have been shown to be Turing-complete, namely they can simulate any Turing machine. In this paper, using set theory and cardinality arguments, we compare them with liquid-state machines (or \"reservoir computing\") and quantum machines (\"quantum computing\"). We show that UMMs can simulate both types of machines, hence they are both \"liquid-\" or \"reservoir-comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08702","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-17T23:44:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/PvuNSRDySh71J9v5KeAabykFHLgnQWifx8KWJ7dV/Y5sW89N8ACwBe01DkZ33Y4/zvLfLnP2klG0qU4HTpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:14:21.946786Z"},"content_sha256":"3d63561b2f781f4cf223279e7df9126f26f478bf4c1e0e07eb5660e5580a66b0","schema_version":"1.0","event_id":"sha256:3d63561b2f781f4cf223279e7df9126f26f478bf4c1e0e07eb5660e5580a66b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/bundle.json","state_url":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/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-31T00:14:21Z","links":{"resolver":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7","bundle":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/bundle.json","state":"https://pith.science/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEF76J6PF6JKHNSNRAV5KQNOQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SEF76J6PF6JKHNSNRAV5KQNOQ7","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":"888513d9c651e0c63231f6068f8656bacc24fe7fab5418e0e72ef034f3257121","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-12-23T02:30:25Z","title_canon_sha256":"8ea7f71517f4b849794c3a009fed1ef02468a88b2b31bb4e748d1789cfd76a0c"},"schema_version":"1.0","source":{"id":"1712.08702","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08702","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08702v2","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08702","created_at":"2026-05-17T23:44:59Z"},{"alias_kind":"pith_short_12","alias_value":"SEF76J6PF6JK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SEF76J6PF6JKHNSN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SEF76J6P","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:3d63561b2f781f4cf223279e7df9126f26f478bf4c1e0e07eb5660e5580a66b0","target":"graph","created_at":"2026-05-17T23:44:59Z","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":"Universal memcomputing machines (UMMs) [IEEE Trans. Neural Netw. Learn. Syst. 26, 2702 (2015)] represent a novel computational model in which memory (time non-locality) accomplishes both tasks of storing and processing of information. UMMs have been shown to be Turing-complete, namely they can simulate any Turing machine. In this paper, using set theory and cardinality arguments, we compare them with liquid-state machines (or \"reservoir computing\") and quantum machines (\"quantum computing\"). We show that UMMs can simulate both types of machines, hence they are both \"liquid-\" or \"reservoir-comp","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra, Yan Ru Pei","cross_cats":["cs.ET"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-12-23T02:30:25Z","title":"On the Universality of Memcomputing Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08702","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:02288000a3ca617f80efcf5c638c1e31bd358da43f764cf8a7779645fe22b0b0","target":"record","created_at":"2026-05-17T23:44:59Z","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":"888513d9c651e0c63231f6068f8656bacc24fe7fab5418e0e72ef034f3257121","cross_cats_sorted":["cs.ET"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2017-12-23T02:30:25Z","title_canon_sha256":"8ea7f71517f4b849794c3a009fed1ef02468a88b2b31bb4e748d1789cfd76a0c"},"schema_version":"1.0","source":{"id":"1712.08702","kind":"arxiv","version":2}},"canonical_sha256":"910bff27cf2f92a3b64d882bd541ae87f59c853cdcdef1ed0eceadfbd8ae1cd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"910bff27cf2f92a3b64d882bd541ae87f59c853cdcdef1ed0eceadfbd8ae1cd2","first_computed_at":"2026-05-17T23:44:59.902169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:59.902169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bzfkE72ox5y9xl37feZoxVSKRKlOpRtYRKsLQq7dWZZClHX77KQCDXyA5FRcPa5+LL3MDApfLpN637HrUz8sCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:59.902776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08702","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02288000a3ca617f80efcf5c638c1e31bd358da43f764cf8a7779645fe22b0b0","sha256:3d63561b2f781f4cf223279e7df9126f26f478bf4c1e0e07eb5660e5580a66b0"],"state_sha256":"28582dffd6dfd0e5c009d2b5f85c0b4d32165d2d441e5d420dc27924245090c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWwU8PfDzmjIhhBvwjw5sduUBtfSV5XeL6GeQOL42aIQI3J8e9jRC8dmZPA29lYKVY5MFwHK0zUolNCkXW+lDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:14:21.948664Z","bundle_sha256":"2e7cd03937feef39d633d866f1b492a9f8d9361aca86c91fbdeb77ed73cf9f4d"}}