{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:P6A2AS7RJUKWHLX2XWZTL77UBT","short_pith_number":"pith:P6A2AS7R","schema_version":"1.0","canonical_sha256":"7f81a04bf14d1563aefabdb335fff40cea2309a98b4d91392611f0fc7cc4b4d9","source":{"kind":"arxiv","id":"1301.1547","version":3},"attestation_state":"computed","paper":{"title":"Short lists with short programs in short time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Anton Makhlin, Bruno Bauwens, Marius Zimand, Nikolay Vereshchagin","submitted_at":"2013-01-08T14:41:49Z","abstract_excerpt":"Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that $U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest program for $x$). We show that for any standard Turing machine, it is possible to compute in polynomial time on input $x$ a list of polynomial size guaranteed to contain a O$(\\log |x|)$-short program for $x$. We also show that there exists a computable function that maps every $x$ to a list of size $|x|^2$ containing a O$(1)$-short program for $x$. This is essentially optimal because we prove that for each such function there is a $c$ and infin"},"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":"1301.1547","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-08T14:41:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"16d270d02263d0c6dc7af140f5fa1e5a13a31eed3486fb8fb983b5f3dfb8f4ba","abstract_canon_sha256":"3f37d260928348f668c16cc7ed2c70c1d496fa83f7d1c2bf6ae9ac4d89a2756b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:37.105049Z","signature_b64":"sYARQJspBKAlrwWkUESqUcy8Qy0mMNiX+iHEYTY3wLX5gGFwHzGoIWmHhzly+W3JNh+gYxuri7Azt8T8r85dAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f81a04bf14d1563aefabdb335fff40cea2309a98b4d91392611f0fc7cc4b4d9","last_reissued_at":"2026-05-18T00:47:37.104505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:37.104505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short lists with short programs in short time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Anton Makhlin, Bruno Bauwens, Marius Zimand, Nikolay Vereshchagin","submitted_at":"2013-01-08T14:41:49Z","abstract_excerpt":"Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that $U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest program for $x$). We show that for any standard Turing machine, it is possible to compute in polynomial time on input $x$ a list of polynomial size guaranteed to contain a O$(\\log |x|)$-short program for $x$. We also show that there exists a computable function that maps every $x$ to a list of size $|x|^2$ containing a O$(1)$-short program for $x$. This is essentially optimal because we prove that for each such function there is a $c$ and infin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1547","kind":"arxiv","version":3},"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":"1301.1547","created_at":"2026-05-18T00:47:37.104587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1547v3","created_at":"2026-05-18T00:47:37.104587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1547","created_at":"2026-05-18T00:47:37.104587+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6A2AS7RJUKW","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6A2AS7RJUKWHLX2","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6A2AS7R","created_at":"2026-05-18T12:27:54.935989+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/P6A2AS7RJUKWHLX2XWZTL77UBT","json":"https://pith.science/pith/P6A2AS7RJUKWHLX2XWZTL77UBT.json","graph_json":"https://pith.science/api/pith-number/P6A2AS7RJUKWHLX2XWZTL77UBT/graph.json","events_json":"https://pith.science/api/pith-number/P6A2AS7RJUKWHLX2XWZTL77UBT/events.json","paper":"https://pith.science/paper/P6A2AS7R"},"agent_actions":{"view_html":"https://pith.science/pith/P6A2AS7RJUKWHLX2XWZTL77UBT","download_json":"https://pith.science/pith/P6A2AS7RJUKWHLX2XWZTL77UBT.json","view_paper":"https://pith.science/paper/P6A2AS7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1547&json=true","fetch_graph":"https://pith.science/api/pith-number/P6A2AS7RJUKWHLX2XWZTL77UBT/graph.json","fetch_events":"https://pith.science/api/pith-number/P6A2AS7RJUKWHLX2XWZTL77UBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6A2AS7RJUKWHLX2XWZTL77UBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6A2AS7RJUKWHLX2XWZTL77UBT/action/storage_attestation","attest_author":"https://pith.science/pith/P6A2AS7RJUKWHLX2XWZTL77UBT/action/author_attestation","sign_citation":"https://pith.science/pith/P6A2AS7RJUKWHLX2XWZTL77UBT/action/citation_signature","submit_replication":"https://pith.science/pith/P6A2AS7RJUKWHLX2XWZTL77UBT/action/replication_record"}},"created_at":"2026-05-18T00:47:37.104587+00:00","updated_at":"2026-05-18T00:47:37.104587+00:00"}