{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:P6A2AS7RJUKWHLX2XWZTL77UBT","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":"3f37d260928348f668c16cc7ed2c70c1d496fa83f7d1c2bf6ae9ac4d89a2756b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-08T14:41:49Z","title_canon_sha256":"16d270d02263d0c6dc7af140f5fa1e5a13a31eed3486fb8fb983b5f3dfb8f4ba"},"schema_version":"1.0","source":{"id":"1301.1547","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1547","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1547v3","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1547","created_at":"2026-05-18T00:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"P6A2AS7RJUKW","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P6A2AS7RJUKWHLX2","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P6A2AS7R","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:1d911fbb29797917c64bf2345f60e3be1d06c0e1ded93f7b451ad9e1f96b981f","target":"graph","created_at":"2026-05-18T00:47:37Z","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":"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","authors_text":"Anton Makhlin, Bruno Bauwens, Marius Zimand, Nikolay Vereshchagin","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-08T14:41:49Z","title":"Short lists with short programs in short time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1547","kind":"arxiv","version":3},"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:6199de9ea153ef67d68d2e50f290a56e58c23df452ad50d3a166d23d062a08f8","target":"record","created_at":"2026-05-18T00:47:37Z","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":"3f37d260928348f668c16cc7ed2c70c1d496fa83f7d1c2bf6ae9ac4d89a2756b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-08T14:41:49Z","title_canon_sha256":"16d270d02263d0c6dc7af140f5fa1e5a13a31eed3486fb8fb983b5f3dfb8f4ba"},"schema_version":"1.0","source":{"id":"1301.1547","kind":"arxiv","version":3}},"canonical_sha256":"7f81a04bf14d1563aefabdb335fff40cea2309a98b4d91392611f0fc7cc4b4d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f81a04bf14d1563aefabdb335fff40cea2309a98b4d91392611f0fc7cc4b4d9","first_computed_at":"2026-05-18T00:47:37.104505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:37.104505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sYARQJspBKAlrwWkUESqUcy8Qy0mMNiX+iHEYTY3wLX5gGFwHzGoIWmHhzly+W3JNh+gYxuri7Azt8T8r85dAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:37.105049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1547","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6199de9ea153ef67d68d2e50f290a56e58c23df452ad50d3a166d23d062a08f8","sha256:1d911fbb29797917c64bf2345f60e3be1d06c0e1ded93f7b451ad9e1f96b981f"],"state_sha256":"92029f7bb22d3a3da147141f5f818208d51ed75d94d00f50417d41429d6f9fd2"}