{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WN74BB4CLVLIYRHKJGOYV2FQSG","short_pith_number":"pith:WN74BB4C","schema_version":"1.0","canonical_sha256":"b37fc087825d568c44ea499d8ae8b091a2a1d0f84cd6010d0ea993d4b5da29ae","source":{"kind":"arxiv","id":"1411.4798","version":3},"attestation_state":"computed","paper":{"title":"Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.ET","authors_text":"Chiara Ramella, Fabio L. Traversa, Fabrizio Bonani, Massimiliano Di Ventra","submitted_at":"2014-11-18T10:35:17Z","abstract_excerpt":"Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proved mathematically that memcomputing machines have the same computational power of non-deterministic Turing machines. Therefore, they can solve NP-complete problems in polynomial time and, using the appropriate architecture, with resources that only grow polynomially with the input size. The reason for this computational power stems from properties inspired by the brain and shared by any univer"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1411.4798","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2014-11-18T10:35:17Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"45654f9ba221e39ecbcea970605dca60c0543264001eae5d726e3f67837e24a4","abstract_canon_sha256":"7488a6dafd5bd07eebde015f5e1fc702babc2563ab80d17c35dfa48ebdf6abdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:11.239450Z","signature_b64":"BkszrplTMWjWCQ9jqGqA2CoePCWDoLe7ETv9Rc5YB24Jj+YQ8vtkowcB5kRF9PKDqNRd7sdQ6HBDcpluJRikDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b37fc087825d568c44ea499d8ae8b091a2a1d0f84cd6010d0ea993d4b5da29ae","last_reissued_at":"2026-05-18T01:37:11.238742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:11.238742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.ET","authors_text":"Chiara Ramella, Fabio L. Traversa, Fabrizio Bonani, Massimiliano Di Ventra","submitted_at":"2014-11-18T10:35:17Z","abstract_excerpt":"Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proved mathematically that memcomputing machines have the same computational power of non-deterministic Turing machines. Therefore, they can solve NP-complete problems in polynomial time and, using the appropriate architecture, with resources that only grow polynomially with the input size. The reason for this computational power stems from properties inspired by the brain and shared by any univer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4798","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.4798","created_at":"2026-05-18T01:37:11.238838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.4798v3","created_at":"2026-05-18T01:37:11.238838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4798","created_at":"2026-05-18T01:37:11.238838+00:00"},{"alias_kind":"pith_short_12","alias_value":"WN74BB4CLVLI","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WN74BB4CLVLIYRHK","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WN74BB4C","created_at":"2026-05-18T12:28:54.890064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WN74BB4CLVLIYRHKJGOYV2FQSG","json":"https://pith.science/pith/WN74BB4CLVLIYRHKJGOYV2FQSG.json","graph_json":"https://pith.science/api/pith-number/WN74BB4CLVLIYRHKJGOYV2FQSG/graph.json","events_json":"https://pith.science/api/pith-number/WN74BB4CLVLIYRHKJGOYV2FQSG/events.json","paper":"https://pith.science/paper/WN74BB4C"},"agent_actions":{"view_html":"https://pith.science/pith/WN74BB4CLVLIYRHKJGOYV2FQSG","download_json":"https://pith.science/pith/WN74BB4CLVLIYRHKJGOYV2FQSG.json","view_paper":"https://pith.science/paper/WN74BB4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.4798&json=true","fetch_graph":"https://pith.science/api/pith-number/WN74BB4CLVLIYRHKJGOYV2FQSG/graph.json","fetch_events":"https://pith.science/api/pith-number/WN74BB4CLVLIYRHKJGOYV2FQSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WN74BB4CLVLIYRHKJGOYV2FQSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WN74BB4CLVLIYRHKJGOYV2FQSG/action/storage_attestation","attest_author":"https://pith.science/pith/WN74BB4CLVLIYRHKJGOYV2FQSG/action/author_attestation","sign_citation":"https://pith.science/pith/WN74BB4CLVLIYRHKJGOYV2FQSG/action/citation_signature","submit_replication":"https://pith.science/pith/WN74BB4CLVLIYRHKJGOYV2FQSG/action/replication_record"}},"created_at":"2026-05-18T01:37:11.238838+00:00","updated_at":"2026-05-18T01:37:11.238838+00:00"}