{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LYNZN5E5OFSW6FTEKRQDU33BIO","short_pith_number":"pith:LYNZN5E5","schema_version":"1.0","canonical_sha256":"5e1b96f49d71656f166454603a6f61439be7563e6a49c51d23bb3d0c80b39f35","source":{"kind":"arxiv","id":"2406.10476","version":25},"attestation_state":"computed","paper":{"title":"Simulating Polynomial-Time Nondeterministic Turing Machines via Nondeterministic Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Tianrong Lin","submitted_at":"2024-06-15T02:54:55Z","abstract_excerpt":"We prove in this paper that there is a language $L_s$ accepted by some nondeterministic Turing machine that runs within time $O(n^k)$ for any positive integer $k\\in\\mathbb{N}_1$ but not by any ${\\rm co}\\mathcal{NP}$ machines. Then we further show that $L_s$ is in $\\mathcal{NP}$, thus proving a groundbreaking result that $$\\mathcal{NP}\\neq{\\rm co}\\mathcal{NP}. $$\n  The main techniques used in this paper are simulation and the novel new techniques developed in the author's recent work. Our main result has profound implications, such as $\\mathcal{P}\\neq\\mathcal{NP}$, etc. Further, if there exists"},"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":"2406.10476","kind":"arxiv","version":25},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-06-15T02:54:55Z","cross_cats_sorted":[],"title_canon_sha256":"292193e091cf3aa93e32c7fa187da4d0490a674258b42aaaaf87f3ff36f876a1","abstract_canon_sha256":"c27dfe5a74a8383e128004270df62f6caa4e251f4ad84fcd7cb80768f2fb7c3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-29T02:05:32.626705Z","signature_b64":"9CamnyJF9AEKSVLl554aUU/9uIiE7FtpUuNyL6JNPv793VJFYwejqZM4ud+vJc1EE+iWUeiLMvtXFIPcVjR0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e1b96f49d71656f166454603a6f61439be7563e6a49c51d23bb3d0c80b39f35","last_reissued_at":"2026-05-29T02:05:32.625885Z","signature_status":"signed_v1","first_computed_at":"2026-05-29T02:05:32.625885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simulating Polynomial-Time Nondeterministic Turing Machines via Nondeterministic Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Tianrong Lin","submitted_at":"2024-06-15T02:54:55Z","abstract_excerpt":"We prove in this paper that there is a language $L_s$ accepted by some nondeterministic Turing machine that runs within time $O(n^k)$ for any positive integer $k\\in\\mathbb{N}_1$ but not by any ${\\rm co}\\mathcal{NP}$ machines. Then we further show that $L_s$ is in $\\mathcal{NP}$, thus proving a groundbreaking result that $$\\mathcal{NP}\\neq{\\rm co}\\mathcal{NP}. $$\n  The main techniques used in this paper are simulation and the novel new techniques developed in the author's recent work. Our main result has profound implications, such as $\\mathcal{P}\\neq\\mathcal{NP}$, etc. Further, if there exists"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10476","kind":"arxiv","version":25},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.10476/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2406.10476","created_at":"2026-05-29T02:05:32.625991+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.10476v25","created_at":"2026-05-29T02:05:32.625991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10476","created_at":"2026-05-29T02:05:32.625991+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYNZN5E5OFSW","created_at":"2026-05-29T02:05:32.625991+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYNZN5E5OFSW6FTE","created_at":"2026-05-29T02:05:32.625991+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYNZN5E5","created_at":"2026-05-29T02:05:32.625991+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/LYNZN5E5OFSW6FTEKRQDU33BIO","json":"https://pith.science/pith/LYNZN5E5OFSW6FTEKRQDU33BIO.json","graph_json":"https://pith.science/api/pith-number/LYNZN5E5OFSW6FTEKRQDU33BIO/graph.json","events_json":"https://pith.science/api/pith-number/LYNZN5E5OFSW6FTEKRQDU33BIO/events.json","paper":"https://pith.science/paper/LYNZN5E5"},"agent_actions":{"view_html":"https://pith.science/pith/LYNZN5E5OFSW6FTEKRQDU33BIO","download_json":"https://pith.science/pith/LYNZN5E5OFSW6FTEKRQDU33BIO.json","view_paper":"https://pith.science/paper/LYNZN5E5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.10476&json=true","fetch_graph":"https://pith.science/api/pith-number/LYNZN5E5OFSW6FTEKRQDU33BIO/graph.json","fetch_events":"https://pith.science/api/pith-number/LYNZN5E5OFSW6FTEKRQDU33BIO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYNZN5E5OFSW6FTEKRQDU33BIO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYNZN5E5OFSW6FTEKRQDU33BIO/action/storage_attestation","attest_author":"https://pith.science/pith/LYNZN5E5OFSW6FTEKRQDU33BIO/action/author_attestation","sign_citation":"https://pith.science/pith/LYNZN5E5OFSW6FTEKRQDU33BIO/action/citation_signature","submit_replication":"https://pith.science/pith/LYNZN5E5OFSW6FTEKRQDU33BIO/action/replication_record"}},"created_at":"2026-05-29T02:05:32.625991+00:00","updated_at":"2026-05-29T02:05:32.625991+00:00"}