{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YVTROF2LCOO3HLCE7T552373AZ","short_pith_number":"pith:YVTROF2L","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"},"canonical_sha256":"c56717174b139db3ac44fcfbdd6ffb0672b278d6a209884519fe6e735b7c3290","source":{"kind":"arxiv","id":"1512.05064","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05064","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05064v2","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05064","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"YVTROF2LCOO3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YVTROF2LCOO3HLCE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YVTROF2L","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YVTROF2LCOO3HLCE7T552373AZ","target":"record","payload":{"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"},"canonical_sha256":"c56717174b139db3ac44fcfbdd6ffb0672b278d6a209884519fe6e735b7c3290","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"},"source_kind":"arxiv","source_id":"1512.05064","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-18T00:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/GnkB9ztdvdI15lPQDHSi0W2souASLctOReCso2dj/S1YC2UIivyCW7Yj3JUkGWTJThFN838faRG8gA8ARTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:59:16.753540Z"},"content_sha256":"491c4aed52d97107646c2acdc3276d784ac4d54f43205f567b319e7f3db54d45","schema_version":"1.0","event_id":"sha256:491c4aed52d97107646c2acdc3276d784ac4d54f43205f567b319e7f3db54d45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YVTROF2LCOO3HLCE7T552373AZ","target":"graph","payload":{"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"},"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-18T00:49:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pfNpq2NV2fgqqzXQU3/+m0W9uOJkXpjNW5QgKtd73HMy2PFdwGsSE3DIIeoXFAFDB8CHxyg5dnNtxrEp/OPQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:59:16.753882Z"},"content_sha256":"b5c229b1129d7b163633501f532118ded4a1d5da792e05b2036976cc2ffd7cab","schema_version":"1.0","event_id":"sha256:b5c229b1129d7b163633501f532118ded4a1d5da792e05b2036976cc2ffd7cab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ/bundle.json","state_url":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVTROF2LCOO3HLCE7T552373AZ/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-19T18:59:16Z","links":{"resolver":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ","bundle":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ/bundle.json","state":"https://pith.science/pith/YVTROF2LCOO3HLCE7T552373AZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVTROF2LCOO3HLCE7T552373AZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YVTROF2LCOO3HLCE7T552373AZ","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":"066e2dbdd74dfba9ffa0db9f647f2e4701ccb9ce84a7852c87129e76f47705ce","cross_cats_sorted":["cond-mat.mes-hall","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2015-12-16T06:35:32Z","title_canon_sha256":"5736f28be6ffed362f890734337fccba6deb7b32991b1363dc6cab8ba426a89c"},"schema_version":"1.0","source":{"id":"1512.05064","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05064","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05064v2","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05064","created_at":"2026-05-18T00:49:08Z"},{"alias_kind":"pith_short_12","alias_value":"YVTROF2LCOO3","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YVTROF2LCOO3HLCE","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YVTROF2L","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:b5c229b1129d7b163633501f532118ded4a1d5da792e05b2036976cc2ffd7cab","target":"graph","created_at":"2026-05-18T00:49:08Z","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 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","authors_text":"Fabio L. Traversa, Massimiliano Di Ventra","cross_cats":["cond-mat.mes-hall","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2015-12-16T06:35:32Z","title":"Polynomial-time solution of prime factorization and NP-hard problems with digital memcomputing machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05064","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:491c4aed52d97107646c2acdc3276d784ac4d54f43205f567b319e7f3db54d45","target":"record","created_at":"2026-05-18T00:49:08Z","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":"066e2dbdd74dfba9ffa0db9f647f2e4701ccb9ce84a7852c87129e76f47705ce","cross_cats_sorted":["cond-mat.mes-hall","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2015-12-16T06:35:32Z","title_canon_sha256":"5736f28be6ffed362f890734337fccba6deb7b32991b1363dc6cab8ba426a89c"},"schema_version":"1.0","source":{"id":"1512.05064","kind":"arxiv","version":2}},"canonical_sha256":"c56717174b139db3ac44fcfbdd6ffb0672b278d6a209884519fe6e735b7c3290","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c56717174b139db3ac44fcfbdd6ffb0672b278d6a209884519fe6e735b7c3290","first_computed_at":"2026-05-18T00:49:08.581415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:08.581415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0JTanPnNoiwOrhFERT69p2vxnYy+LuZ+fKEkD+zBdH570oUY/pnA/xcZvOEyL3KKb5yRDGOajwLBP3lbi8FJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:08.581905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05064","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:491c4aed52d97107646c2acdc3276d784ac4d54f43205f567b319e7f3db54d45","sha256:b5c229b1129d7b163633501f532118ded4a1d5da792e05b2036976cc2ffd7cab"],"state_sha256":"3799b3aeb853a0c8533ad902399c48ac391d37b47ec8d26c25604e289405256d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wz/rZdJMjsLxvNTYGr01ZQRl4kT0d9BoIJ0sRX2ZAVFtOfJuQENPzfDscm15jYvES60LCHb8TqPEZ1vc9rooCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T18:59:16.755936Z","bundle_sha256":"39406c3fffbf01a2c434f768982e9dcdc5dce53f01663c33dff5d7eb2023cb9c"}}