{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VELHJRMLAW5MYTZYNJ4NMIZKID","short_pith_number":"pith:VELHJRML","schema_version":"1.0","canonical_sha256":"a91674c58b05bacc4f386a78d6232a40c1d91868c3bda33452d733d2c1f6bc20","source":{"kind":"arxiv","id":"1211.1302","version":2},"attestation_state":"computed","paper":{"title":"Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT","nlin.PS"],"primary_cat":"cs.IT","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","submitted_at":"2012-11-06T16:39:17Z","abstract_excerpt":"Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method is an alternative to the traditional lossless compression algorithms, which it may complement, the two being serviceable for different string lengths. We provide a thorough analysis for all $\\sum_{n=1}^{11} 2^n$ binary strings of length $n<12$ and for most strings of length $12\\leq n \\leq16$ by running all $\\sim 2.5 \\times 10^{13}$ Turing machines wi"},"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":"1211.1302","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-06T16:39:17Z","cross_cats_sorted":["cs.CC","math.IT","nlin.PS"],"title_canon_sha256":"62c5ec92be8ffb9d1da5083db1a00ebc9986de9fa0f2890681003142f3d3540a","abstract_canon_sha256":"e40a83ad00ada66832539b12aa9dcd97d8217e05564c08d7cb9d80cf00ea8370"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:05.511136Z","signature_b64":"cC2dhMFbml8pfVraMtUWk/b8G2gQ+2fKCjbz6xpCFZ2RCcpW89ytpneFI7wIUeIPxxH+Cuh+cnkANZCxUEbQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a91674c58b05bacc4f386a78d6232a40c1d91868c3bda33452d733d2c1f6bc20","last_reissued_at":"2026-05-18T02:25:05.510779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:05.510779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT","nlin.PS"],"primary_cat":"cs.IT","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","submitted_at":"2012-11-06T16:39:17Z","abstract_excerpt":"Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method is an alternative to the traditional lossless compression algorithms, which it may complement, the two being serviceable for different string lengths. We provide a thorough analysis for all $\\sum_{n=1}^{11} 2^n$ binary strings of length $n<12$ and for most strings of length $12\\leq n \\leq16$ by running all $\\sim 2.5 \\times 10^{13}$ Turing machines wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1302","kind":"arxiv","version":2},"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":"1211.1302","created_at":"2026-05-18T02:25:05.510833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.1302v2","created_at":"2026-05-18T02:25:05.510833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1302","created_at":"2026-05-18T02:25:05.510833+00:00"},{"alias_kind":"pith_short_12","alias_value":"VELHJRMLAW5M","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VELHJRMLAW5MYTZY","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VELHJRML","created_at":"2026-05-18T12:27:25.539911+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/VELHJRMLAW5MYTZYNJ4NMIZKID","json":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID.json","graph_json":"https://pith.science/api/pith-number/VELHJRMLAW5MYTZYNJ4NMIZKID/graph.json","events_json":"https://pith.science/api/pith-number/VELHJRMLAW5MYTZYNJ4NMIZKID/events.json","paper":"https://pith.science/paper/VELHJRML"},"agent_actions":{"view_html":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID","download_json":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID.json","view_paper":"https://pith.science/paper/VELHJRML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.1302&json=true","fetch_graph":"https://pith.science/api/pith-number/VELHJRMLAW5MYTZYNJ4NMIZKID/graph.json","fetch_events":"https://pith.science/api/pith-number/VELHJRMLAW5MYTZYNJ4NMIZKID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/action/storage_attestation","attest_author":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/action/author_attestation","sign_citation":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/action/citation_signature","submit_replication":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/action/replication_record"}},"created_at":"2026-05-18T02:25:05.510833+00:00","updated_at":"2026-05-18T02:25:05.510833+00:00"}