{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YVTROF2LCOO3HLCE7T552373AZ","short_pith_number":"pith:YVTROF2L","schema_version":"1.0","canonical_sha256":"c56717174b139db3ac44fcfbdd6ffb0672b278d6a209884519fe6e735b7c3290","source":{"kind":"arxiv","id":"1512.05064","version":2},"attestation_state":"computed","paper":{"title":"Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cs.CC"],"primary_cat":"cs.ET","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra","submitted_at":"2015-12-16T06:35:32Z","abstract_excerpt":"We introduce a class of digital machines we name Digital Memcomputing Machines (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space and energy). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We initially prove this by introducing the complexity classes for these machines. We then make a connection with dynamical systems theory. This leads to the set of physical constraints for poly-resource resolvability. Once the mathematical req"},"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":"1512.05064","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2015-12-16T06:35:32Z","cross_cats_sorted":["cond-mat.mes-hall","cs.CC"],"title_canon_sha256":"5736f28be6ffed362f890734337fccba6deb7b32991b1363dc6cab8ba426a89c","abstract_canon_sha256":"066e2dbdd74dfba9ffa0db9f647f2e4701ccb9ce84a7852c87129e76f47705ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:08.581905Z","signature_b64":"0JTanPnNoiwOrhFERT69p2vxnYy+LuZ+fKEkD+zBdH570oUY/pnA/xcZvOEyL3KKb5yRDGOajwLBP3lbi8FJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c56717174b139db3ac44fcfbdd6ffb0672b278d6a209884519fe6e735b7c3290","last_reissued_at":"2026-05-18T00:49:08.581415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:08.581415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cs.CC"],"primary_cat":"cs.ET","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra","submitted_at":"2015-12-16T06:35:32Z","abstract_excerpt":"We introduce a class of digital machines we name Digital Memcomputing Machines (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space and energy). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We initially prove this by introducing the complexity classes for these machines. We then make a connection with dynamical systems theory. This leads to the set of physical constraints for poly-resource resolvability. Once the mathematical req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05064","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.05064","created_at":"2026-05-18T00:49:08.581485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.05064v2","created_at":"2026-05-18T00:49:08.581485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05064","created_at":"2026-05-18T00:49:08.581485+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVTROF2LCOO3","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVTROF2LCOO3HLCE","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVTROF2L","created_at":"2026-05-18T12:29:52.810259+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/YVTROF2LCOO3HLCE7T552373AZ","json":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ.json","graph_json":"https://pith.science/api/pith-number/YVTROF2LCOO3HLCE7T552373AZ/graph.json","events_json":"https://pith.science/api/pith-number/YVTROF2LCOO3HLCE7T552373AZ/events.json","paper":"https://pith.science/paper/YVTROF2L"},"agent_actions":{"view_html":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ","download_json":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ.json","view_paper":"https://pith.science/paper/YVTROF2L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.05064&json=true","fetch_graph":"https://pith.science/api/pith-number/YVTROF2LCOO3HLCE7T552373AZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YVTROF2LCOO3HLCE7T552373AZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ/action/storage_attestation","attest_author":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ/action/author_attestation","sign_citation":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ/action/citation_signature","submit_replication":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ/action/replication_record"}},"created_at":"2026-05-18T00:49:08.581485+00:00","updated_at":"2026-05-18T00:49:08.581485+00:00"}