{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QGYCEKKYTW4Z4YJ7JVNXB3AKL4","short_pith_number":"pith:QGYCEKKY","schema_version":"1.0","canonical_sha256":"81b02229589db99e613f4d5b70ec0a5f320a513b2d662e71cf4585ec21cb6e48","source":{"kind":"arxiv","id":"1401.1467","version":1},"attestation_state":"computed","paper":{"title":"The sum $2^{\\mathit{KA}(x)-\\mathit{KP}(x)}$ over all prefixes $x$ of some binary sequence can be infinite","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Akim Kumok, Mikhail Andreev","submitted_at":"2014-01-07T18:30:52Z","abstract_excerpt":"We consider two quantities that measure complexity of binary strings: $\\mathit{KA}(x)$ is defined as the minus logarithm of continuous a priori probability on the binary tree, and $\\mathit{KP}(x)$ denotes prefix complexity of a binary string $x$. In this paper we answer a question posed by Joseph Miller and prove that there exists an infinite binary sequence $\\omega$ such that the sum of $2^{\\mathit{KA}(x)-\\mathit{KP}(x)}$ over all prefixes $x$ of $\\omega$ is infinite. Such a sequence can be chosen among characteristic sequences of computably enumerable sets."},"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":"1401.1467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-07T18:30:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fc31071bbd7fef34ece6e7c7e870f025fe278da9637112d1c488012a173083bd","abstract_canon_sha256":"2930a96dfbb812fd3853e53eb731fbc104e259129d07f556d6149233b989b7d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:08.322241Z","signature_b64":"F9P85F1tMVBMsm1Gd2aO/LWbueoH8pZr88fM/P342UIRIslEgKLGWlEFyaNTnr4BAP8rk3kqu66bLb+sBc30CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81b02229589db99e613f4d5b70ec0a5f320a513b2d662e71cf4585ec21cb6e48","last_reissued_at":"2026-05-18T03:03:08.321724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:08.321724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The sum $2^{\\mathit{KA}(x)-\\mathit{KP}(x)}$ over all prefixes $x$ of some binary sequence can be infinite","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Akim Kumok, Mikhail Andreev","submitted_at":"2014-01-07T18:30:52Z","abstract_excerpt":"We consider two quantities that measure complexity of binary strings: $\\mathit{KA}(x)$ is defined as the minus logarithm of continuous a priori probability on the binary tree, and $\\mathit{KP}(x)$ denotes prefix complexity of a binary string $x$. In this paper we answer a question posed by Joseph Miller and prove that there exists an infinite binary sequence $\\omega$ such that the sum of $2^{\\mathit{KA}(x)-\\mathit{KP}(x)}$ over all prefixes $x$ of $\\omega$ is infinite. Such a sequence can be chosen among characteristic sequences of computably enumerable sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1467","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":"1401.1467","created_at":"2026-05-18T03:03:08.321788+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1467v1","created_at":"2026-05-18T03:03:08.321788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1467","created_at":"2026-05-18T03:03:08.321788+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGYCEKKYTW4Z","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGYCEKKYTW4Z4YJ7","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGYCEKKY","created_at":"2026-05-18T12:28:46.137349+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/QGYCEKKYTW4Z4YJ7JVNXB3AKL4","json":"https://pith.science/pith/QGYCEKKYTW4Z4YJ7JVNXB3AKL4.json","graph_json":"https://pith.science/api/pith-number/QGYCEKKYTW4Z4YJ7JVNXB3AKL4/graph.json","events_json":"https://pith.science/api/pith-number/QGYCEKKYTW4Z4YJ7JVNXB3AKL4/events.json","paper":"https://pith.science/paper/QGYCEKKY"},"agent_actions":{"view_html":"https://pith.science/pith/QGYCEKKYTW4Z4YJ7JVNXB3AKL4","download_json":"https://pith.science/pith/QGYCEKKYTW4Z4YJ7JVNXB3AKL4.json","view_paper":"https://pith.science/paper/QGYCEKKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1467&json=true","fetch_graph":"https://pith.science/api/pith-number/QGYCEKKYTW4Z4YJ7JVNXB3AKL4/graph.json","fetch_events":"https://pith.science/api/pith-number/QGYCEKKYTW4Z4YJ7JVNXB3AKL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGYCEKKYTW4Z4YJ7JVNXB3AKL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGYCEKKYTW4Z4YJ7JVNXB3AKL4/action/storage_attestation","attest_author":"https://pith.science/pith/QGYCEKKYTW4Z4YJ7JVNXB3AKL4/action/author_attestation","sign_citation":"https://pith.science/pith/QGYCEKKYTW4Z4YJ7JVNXB3AKL4/action/citation_signature","submit_replication":"https://pith.science/pith/QGYCEKKYTW4Z4YJ7JVNXB3AKL4/action/replication_record"}},"created_at":"2026-05-18T03:03:08.321788+00:00","updated_at":"2026-05-18T03:03:08.321788+00:00"}