{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QGYCEKKYTW4Z4YJ7JVNXB3AKL4","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":"2930a96dfbb812fd3853e53eb731fbc104e259129d07f556d6149233b989b7d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-07T18:30:52Z","title_canon_sha256":"fc31071bbd7fef34ece6e7c7e870f025fe278da9637112d1c488012a173083bd"},"schema_version":"1.0","source":{"id":"1401.1467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.1467","created_at":"2026-05-18T03:03:08Z"},{"alias_kind":"arxiv_version","alias_value":"1401.1467v1","created_at":"2026-05-18T03:03:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1467","created_at":"2026-05-18T03:03:08Z"},{"alias_kind":"pith_short_12","alias_value":"QGYCEKKYTW4Z","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QGYCEKKYTW4Z4YJ7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QGYCEKKY","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:191e14de996e7e4ff2b18b11f5f904059a6fc6aedc5bab328e2c2729b69e893f","target":"graph","created_at":"2026-05-18T03:03:08Z","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":"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.","authors_text":"Akim Kumok, Mikhail Andreev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-07T18:30:52Z","title":"The sum $2^{\\mathit{KA}(x)-\\mathit{KP}(x)}$ over all prefixes $x$ of some binary sequence can be infinite"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1467","kind":"arxiv","version":1},"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:be781dd5e266da8aa9a9d37657f5df2f7da92f33b4a072eab28657c8d07c502a","target":"record","created_at":"2026-05-18T03:03:08Z","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":"2930a96dfbb812fd3853e53eb731fbc104e259129d07f556d6149233b989b7d2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-07T18:30:52Z","title_canon_sha256":"fc31071bbd7fef34ece6e7c7e870f025fe278da9637112d1c488012a173083bd"},"schema_version":"1.0","source":{"id":"1401.1467","kind":"arxiv","version":1}},"canonical_sha256":"81b02229589db99e613f4d5b70ec0a5f320a513b2d662e71cf4585ec21cb6e48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81b02229589db99e613f4d5b70ec0a5f320a513b2d662e71cf4585ec21cb6e48","first_computed_at":"2026-05-18T03:03:08.321724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:08.321724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F9P85F1tMVBMsm1Gd2aO/LWbueoH8pZr88fM/P342UIRIslEgKLGWlEFyaNTnr4BAP8rk3kqu66bLb+sBc30CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:08.322241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.1467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be781dd5e266da8aa9a9d37657f5df2f7da92f33b4a072eab28657c8d07c502a","sha256:191e14de996e7e4ff2b18b11f5f904059a6fc6aedc5bab328e2c2729b69e893f"],"state_sha256":"27e17b51b198f9ebca06d0875ddb6c8d060b7be5812af4c06e3f35338fb27f86"}