{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DAM7MFMTYG2WYQYM3BXFJUEURY","short_pith_number":"pith:DAM7MFMT","schema_version":"1.0","canonical_sha256":"1819f61593c1b56c430cd86e54d0948e3c35a434c75131b314e0fc8b93ce7ab0","source":{"kind":"arxiv","id":"1702.03152","version":1},"attestation_state":"computed","paper":{"title":"A Variation of Levin Search for All Well-Defined Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Fouad B. Chedid","submitted_at":"2017-02-10T12:43:46Z","abstract_excerpt":"In 1973, L.A. Levin published an algorithm that solves any inversion problem $\\pi$ as quickly as the fastest algorithm $p^*$ computing a solution for $\\pi$ in time bounded by $2^{l(p^*)}.t^*$, where $l(p^*)$ is the length of the binary encoding of $p^*$, and $t^*$ is the runtime of $p^*$ plus the time to verify its correctness. In 2002, M. Hutter published an algorithm that solves any well-defined problem $\\pi$ as quickly as the fastest algorithm $p^*$ computing a solution for $\\pi$ in time bounded by $5.t_{p}(x)+d_p.time_{t_{p}}(x)+c_p$, where $d_p=40.2^{l(p)+l(t_{p})}$ and $c_p=40.2^{l(f)+1}"},"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.03152","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-10T12:43:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b25581e98965b4a166bed105a5d805fd8bbfae5f68083a955f434ff4f6fa859e","abstract_canon_sha256":"b0e62737c2578026ea9768b3ace65f924e82c8f3e943199cf21ee926fdc899a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:58.565531Z","signature_b64":"OrJvkz8icLyYfI/wnBtbmLb6wA350iAQK/A4DCAURWh5uUr+a7KEunCCejeKIlrNFyN7rzl4COTOOPtjo1X+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1819f61593c1b56c430cd86e54d0948e3c35a434c75131b314e0fc8b93ce7ab0","last_reissued_at":"2026-05-18T00:50:58.565054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:58.565054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Variation of Levin Search for All Well-Defined Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Fouad B. Chedid","submitted_at":"2017-02-10T12:43:46Z","abstract_excerpt":"In 1973, L.A. Levin published an algorithm that solves any inversion problem $\\pi$ as quickly as the fastest algorithm $p^*$ computing a solution for $\\pi$ in time bounded by $2^{l(p^*)}.t^*$, where $l(p^*)$ is the length of the binary encoding of $p^*$, and $t^*$ is the runtime of $p^*$ plus the time to verify its correctness. In 2002, M. Hutter published an algorithm that solves any well-defined problem $\\pi$ as quickly as the fastest algorithm $p^*$ computing a solution for $\\pi$ in time bounded by $5.t_{p}(x)+d_p.time_{t_{p}}(x)+c_p$, where $d_p=40.2^{l(p)+l(t_{p})}$ and $c_p=40.2^{l(f)+1}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03152","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03152","created_at":"2026-05-18T00:50:58.565123+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03152v1","created_at":"2026-05-18T00:50:58.565123+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03152","created_at":"2026-05-18T00:50:58.565123+00:00"},{"alias_kind":"pith_short_12","alias_value":"DAM7MFMTYG2W","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DAM7MFMTYG2WYQYM","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DAM7MFMT","created_at":"2026-05-18T12:31:10.602751+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/DAM7MFMTYG2WYQYM3BXFJUEURY","json":"https://pith.science/pith/DAM7MFMTYG2WYQYM3BXFJUEURY.json","graph_json":"https://pith.science/api/pith-number/DAM7MFMTYG2WYQYM3BXFJUEURY/graph.json","events_json":"https://pith.science/api/pith-number/DAM7MFMTYG2WYQYM3BXFJUEURY/events.json","paper":"https://pith.science/paper/DAM7MFMT"},"agent_actions":{"view_html":"https://pith.science/pith/DAM7MFMTYG2WYQYM3BXFJUEURY","download_json":"https://pith.science/pith/DAM7MFMTYG2WYQYM3BXFJUEURY.json","view_paper":"https://pith.science/paper/DAM7MFMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03152&json=true","fetch_graph":"https://pith.science/api/pith-number/DAM7MFMTYG2WYQYM3BXFJUEURY/graph.json","fetch_events":"https://pith.science/api/pith-number/DAM7MFMTYG2WYQYM3BXFJUEURY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DAM7MFMTYG2WYQYM3BXFJUEURY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DAM7MFMTYG2WYQYM3BXFJUEURY/action/storage_attestation","attest_author":"https://pith.science/pith/DAM7MFMTYG2WYQYM3BXFJUEURY/action/author_attestation","sign_citation":"https://pith.science/pith/DAM7MFMTYG2WYQYM3BXFJUEURY/action/citation_signature","submit_replication":"https://pith.science/pith/DAM7MFMTYG2WYQYM3BXFJUEURY/action/replication_record"}},"created_at":"2026-05-18T00:50:58.565123+00:00","updated_at":"2026-05-18T00:50:58.565123+00:00"}