{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7AW3N7K7D5B5P3A7RJI2SDXN7M","short_pith_number":"pith:7AW3N7K7","canonical_record":{"source":{"id":"1807.00107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-06-30T02:06:57Z","cross_cats_sorted":["cs.PF","math.DS","math.OC"],"title_canon_sha256":"efa0904d7b87a5d2bac60baa6532ad70da32f3e26db32a7b3b82da923582b4ee","abstract_canon_sha256":"c8654d70d91797860e85aff92164824d56bc9398a0e91e826220ba0f0b93adf7"},"schema_version":"1.0"},"canonical_sha256":"f82db6fd5f1f43d7ec1f8a51a90eedfb0410c9acd38928a5dc3bc711218d7235","source":{"kind":"arxiv","id":"1807.00107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00107","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00107v1","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00107","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"7AW3N7K7D5B5","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7AW3N7K7D5B5P3A7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7AW3N7K7","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7AW3N7K7D5B5P3A7RJI2SDXN7M","target":"record","payload":{"canonical_record":{"source":{"id":"1807.00107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-06-30T02:06:57Z","cross_cats_sorted":["cs.PF","math.DS","math.OC"],"title_canon_sha256":"efa0904d7b87a5d2bac60baa6532ad70da32f3e26db32a7b3b82da923582b4ee","abstract_canon_sha256":"c8654d70d91797860e85aff92164824d56bc9398a0e91e826220ba0f0b93adf7"},"schema_version":"1.0"},"canonical_sha256":"f82db6fd5f1f43d7ec1f8a51a90eedfb0410c9acd38928a5dc3bc711218d7235","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:56.082002Z","signature_b64":"N4x2aIepDg5RZLjL1QnV0Wk8bSBqKbeL98C0FUnffgQQGSRhxRtK973PeEEWJcttQ/0kAkyBcGYMDHz7LBk0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f82db6fd5f1f43d7ec1f8a51a90eedfb0410c9acd38928a5dc3bc711218d7235","last_reissued_at":"2026-05-18T00:11:56.081217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:56.081217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.00107","source_version":1,"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:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E4mttNisyIdaGgJi1Tum6lZgquf3x1XvZuzpWpRVb0p7UJiYOuGomgPyYefaUAuMMEXvwB+lTK7WSZCrQkHhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:38:20.657965Z"},"content_sha256":"a5c5a271dec51476bd27f45e304d75e15c9715e6da59de908c5103347f334bfe","schema_version":"1.0","event_id":"sha256:a5c5a271dec51476bd27f45e304d75e15c9715e6da59de908c5103347f334bfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7AW3N7K7D5B5P3A7RJI2SDXN7M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stress-testing memcomputing on hard combinatorial optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.DS","math.OC"],"primary_cat":"cs.ET","authors_text":"Fabio L. Traversa, Forrest Sheldon, Massimiliano Di Ventra, Pietro Cicotti","submitted_at":"2018-06-30T02:06:57Z","abstract_excerpt":"Memcomputing is a novel paradigm of computation that utilizes dynamical elements with memory to both store and process information on the same physical location. Its building blocks can be fabricated in hardware with standard electronic circuits, thus offering a path to its practical realization. In addition, since memcomputing is based on non-quantum elements, the equations of motion describing these machines can be simulated efficiently on standard computers. In fact, it was recently realized that memcomputing, and in particular its digital (hence scalable) version, when simulated on a class"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00107","kind":"arxiv","version":1},"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:11:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4DrhArqXshYIl4MbkzD+Ss1q5S9Ej9TQMVjnKdxCPFYm50G4ao1HwGCwbk6r3VZ1cC7CFJMWja3YpNCeNsBlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:38:20.658334Z"},"content_sha256":"502756f8278c7b71bd94a3ec70870de4dc68f2b1e32730780a047c047dc8e1d0","schema_version":"1.0","event_id":"sha256:502756f8278c7b71bd94a3ec70870de4dc68f2b1e32730780a047c047dc8e1d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AW3N7K7D5B5P3A7RJI2SDXN7M/bundle.json","state_url":"https://pith.science/pith/7AW3N7K7D5B5P3A7RJI2SDXN7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AW3N7K7D5B5P3A7RJI2SDXN7M/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-31T01:38:20Z","links":{"resolver":"https://pith.science/pith/7AW3N7K7D5B5P3A7RJI2SDXN7M","bundle":"https://pith.science/pith/7AW3N7K7D5B5P3A7RJI2SDXN7M/bundle.json","state":"https://pith.science/pith/7AW3N7K7D5B5P3A7RJI2SDXN7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AW3N7K7D5B5P3A7RJI2SDXN7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7AW3N7K7D5B5P3A7RJI2SDXN7M","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":"c8654d70d91797860e85aff92164824d56bc9398a0e91e826220ba0f0b93adf7","cross_cats_sorted":["cs.PF","math.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-06-30T02:06:57Z","title_canon_sha256":"efa0904d7b87a5d2bac60baa6532ad70da32f3e26db32a7b3b82da923582b4ee"},"schema_version":"1.0","source":{"id":"1807.00107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.00107","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"arxiv_version","alias_value":"1807.00107v1","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00107","created_at":"2026-05-18T00:11:56Z"},{"alias_kind":"pith_short_12","alias_value":"7AW3N7K7D5B5","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7AW3N7K7D5B5P3A7","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7AW3N7K7","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:502756f8278c7b71bd94a3ec70870de4dc68f2b1e32730780a047c047dc8e1d0","target":"graph","created_at":"2026-05-18T00:11:56Z","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":"Memcomputing is a novel paradigm of computation that utilizes dynamical elements with memory to both store and process information on the same physical location. Its building blocks can be fabricated in hardware with standard electronic circuits, thus offering a path to its practical realization. In addition, since memcomputing is based on non-quantum elements, the equations of motion describing these machines can be simulated efficiently on standard computers. In fact, it was recently realized that memcomputing, and in particular its digital (hence scalable) version, when simulated on a class","authors_text":"Fabio L. Traversa, Forrest Sheldon, Massimiliano Di Ventra, Pietro Cicotti","cross_cats":["cs.PF","math.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-06-30T02:06:57Z","title":"Stress-testing memcomputing on hard combinatorial optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00107","kind":"arxiv","version":1},"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:a5c5a271dec51476bd27f45e304d75e15c9715e6da59de908c5103347f334bfe","target":"record","created_at":"2026-05-18T00:11:56Z","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":"c8654d70d91797860e85aff92164824d56bc9398a0e91e826220ba0f0b93adf7","cross_cats_sorted":["cs.PF","math.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2018-06-30T02:06:57Z","title_canon_sha256":"efa0904d7b87a5d2bac60baa6532ad70da32f3e26db32a7b3b82da923582b4ee"},"schema_version":"1.0","source":{"id":"1807.00107","kind":"arxiv","version":1}},"canonical_sha256":"f82db6fd5f1f43d7ec1f8a51a90eedfb0410c9acd38928a5dc3bc711218d7235","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f82db6fd5f1f43d7ec1f8a51a90eedfb0410c9acd38928a5dc3bc711218d7235","first_computed_at":"2026-05-18T00:11:56.081217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:56.081217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N4x2aIepDg5RZLjL1QnV0Wk8bSBqKbeL98C0FUnffgQQGSRhxRtK973PeEEWJcttQ/0kAkyBcGYMDHz7LBk0Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:56.082002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.00107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5c5a271dec51476bd27f45e304d75e15c9715e6da59de908c5103347f334bfe","sha256:502756f8278c7b71bd94a3ec70870de4dc68f2b1e32730780a047c047dc8e1d0"],"state_sha256":"8c2ade794ba3d8699af5d1f4da3b6d88a4653d97990323e9e43dec68994f6ba1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GwOpCOoK3BvrIdCfzIpqJQK0uaLxlDkyEM+JGGd0F4gKSZbOMBrhFbOMlLv5B3Vm0WQnBGoUXgSfb7ZYqk23AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:38:20.660931Z","bundle_sha256":"738a35c55984551ee19b199e08923fe55924abee9eb2e6f3fb1509b75672ba5c"}}