{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2NG6YU76QCWRPJYKMOTOXNXRJQ","short_pith_number":"pith:2NG6YU76","schema_version":"1.0","canonical_sha256":"d34dec53fe80ad17a70a63a6ebb6f14c1674928e1f1e13fab0498a38e1c47f2a","source":{"kind":"arxiv","id":"1702.02980","version":2},"attestation_state":"computed","paper":{"title":"Computability and Complexity of Unconventional Computing Devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Goran Wendin, Hajo Broersma, Susan Stepney","submitted_at":"2017-02-09T20:57:37Z","abstract_excerpt":"We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve NP-complete problems in polynomial time). We discover that all these claims rely on the provision of one or more unphysical resources."},"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":"1702.02980","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2017-02-09T20:57:37Z","cross_cats_sorted":[],"title_canon_sha256":"ca6414f28df70e90ad9a0ac426e3dbc1fb4ac893d6f3fb3c42e2339cceeef119","abstract_canon_sha256":"a4d50da3b090dbee04a19ecd22d0d8cd2c0ca2e9a0a80ea0244900876f7182d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:04.990924Z","signature_b64":"DXN3pLXt5WQQyp+Eh9gExTqlzz8kpVUFHjG/pgkzvvokhlHym2E7v0jISNCR4k7i79/cVXfff3KPWOEZBA7lCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d34dec53fe80ad17a70a63a6ebb6f14c1674928e1f1e13fab0498a38e1c47f2a","last_reissued_at":"2026-05-18T00:48:04.990222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:04.990222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computability and Complexity of Unconventional Computing Devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.ET","authors_text":"Goran Wendin, Hajo Broersma, Susan Stepney","submitted_at":"2017-02-09T20:57:37Z","abstract_excerpt":"We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve NP-complete problems in polynomial time). We discover that all these claims rely on the provision of one or more unphysical resources."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02980","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":"1702.02980","created_at":"2026-05-18T00:48:04.990338+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02980v2","created_at":"2026-05-18T00:48:04.990338+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02980","created_at":"2026-05-18T00:48:04.990338+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NG6YU76QCWR","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NG6YU76QCWRPJYK","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NG6YU76","created_at":"2026-05-18T12:30:55.937587+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/2NG6YU76QCWRPJYKMOTOXNXRJQ","json":"https://pith.science/pith/2NG6YU76QCWRPJYKMOTOXNXRJQ.json","graph_json":"https://pith.science/api/pith-number/2NG6YU76QCWRPJYKMOTOXNXRJQ/graph.json","events_json":"https://pith.science/api/pith-number/2NG6YU76QCWRPJYKMOTOXNXRJQ/events.json","paper":"https://pith.science/paper/2NG6YU76"},"agent_actions":{"view_html":"https://pith.science/pith/2NG6YU76QCWRPJYKMOTOXNXRJQ","download_json":"https://pith.science/pith/2NG6YU76QCWRPJYKMOTOXNXRJQ.json","view_paper":"https://pith.science/paper/2NG6YU76","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02980&json=true","fetch_graph":"https://pith.science/api/pith-number/2NG6YU76QCWRPJYKMOTOXNXRJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2NG6YU76QCWRPJYKMOTOXNXRJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NG6YU76QCWRPJYKMOTOXNXRJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NG6YU76QCWRPJYKMOTOXNXRJQ/action/storage_attestation","attest_author":"https://pith.science/pith/2NG6YU76QCWRPJYKMOTOXNXRJQ/action/author_attestation","sign_citation":"https://pith.science/pith/2NG6YU76QCWRPJYKMOTOXNXRJQ/action/citation_signature","submit_replication":"https://pith.science/pith/2NG6YU76QCWRPJYKMOTOXNXRJQ/action/replication_record"}},"created_at":"2026-05-18T00:48:04.990338+00:00","updated_at":"2026-05-18T00:48:04.990338+00:00"}