{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VELHJRMLAW5MYTZYNJ4NMIZKID","short_pith_number":"pith:VELHJRML","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"},"canonical_sha256":"a91674c58b05bacc4f386a78d6232a40c1d91868c3bda33452d733d2c1f6bc20","source":{"kind":"arxiv","id":"1211.1302","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1302","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1302v2","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1302","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"VELHJRMLAW5M","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VELHJRMLAW5MYTZY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VELHJRML","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VELHJRMLAW5MYTZYNJ4NMIZKID","target":"record","payload":{"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"},"canonical_sha256":"a91674c58b05bacc4f386a78d6232a40c1d91868c3bda33452d733d2c1f6bc20","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"},"source_kind":"arxiv","source_id":"1211.1302","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzhFF4sNlH+z7GMsq4P7Eoi6DJ9SZtaCwFrQDk/1Attd34HIPAEPmekg2TU8rh6ojdszbH73QihNGC1olloUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:57.547724Z"},"content_sha256":"2c5939bbd78c361db5ed255c82920f41683ba94767dc7caa25e8cf2f0e57a101","schema_version":"1.0","event_id":"sha256:2c5939bbd78c361db5ed255c82920f41683ba94767dc7caa25e8cf2f0e57a101"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VELHJRMLAW5MYTZYNJ4NMIZKID","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qEbnDSY6Geh4tpnL4LMhij9AkJO2N3JBb8iJgZThyHVRop6rQbJK0mba3c1MuQdYMxOLVapyXfoZIAHLFzhQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:59:57.548396Z"},"content_sha256":"fd9ee6b4eba0f6087b59c6f7495ab3eab39144d59b71b185d268f22bcaea680e","schema_version":"1.0","event_id":"sha256:fd9ee6b4eba0f6087b59c6f7495ab3eab39144d59b71b185d268f22bcaea680e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/bundle.json","state_url":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T18:59:57Z","links":{"resolver":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID","bundle":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/bundle.json","state":"https://pith.science/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VELHJRMLAW5MYTZYNJ4NMIZKID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VELHJRMLAW5MYTZYNJ4NMIZKID","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":"e40a83ad00ada66832539b12aa9dcd97d8217e05564c08d7cb9d80cf00ea8370","cross_cats_sorted":["cs.CC","math.IT","nlin.PS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-06T16:39:17Z","title_canon_sha256":"62c5ec92be8ffb9d1da5083db1a00ebc9986de9fa0f2890681003142f3d3540a"},"schema_version":"1.0","source":{"id":"1211.1302","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.1302","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"arxiv_version","alias_value":"1211.1302v2","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.1302","created_at":"2026-05-18T02:25:05Z"},{"alias_kind":"pith_short_12","alias_value":"VELHJRMLAW5M","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VELHJRMLAW5MYTZY","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VELHJRML","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:fd9ee6b4eba0f6087b59c6f7495ab3eab39144d59b71b185d268f22bcaea680e","target":"graph","created_at":"2026-05-18T02:25:05Z","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":"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","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","cross_cats":["cs.CC","math.IT","nlin.PS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-06T16:39:17Z","title":"Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.1302","kind":"arxiv","version":2},"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:2c5939bbd78c361db5ed255c82920f41683ba94767dc7caa25e8cf2f0e57a101","target":"record","created_at":"2026-05-18T02:25:05Z","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":"e40a83ad00ada66832539b12aa9dcd97d8217e05564c08d7cb9d80cf00ea8370","cross_cats_sorted":["cs.CC","math.IT","nlin.PS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-06T16:39:17Z","title_canon_sha256":"62c5ec92be8ffb9d1da5083db1a00ebc9986de9fa0f2890681003142f3d3540a"},"schema_version":"1.0","source":{"id":"1211.1302","kind":"arxiv","version":2}},"canonical_sha256":"a91674c58b05bacc4f386a78d6232a40c1d91868c3bda33452d733d2c1f6bc20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a91674c58b05bacc4f386a78d6232a40c1d91868c3bda33452d733d2c1f6bc20","first_computed_at":"2026-05-18T02:25:05.510779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:05.510779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cC2dhMFbml8pfVraMtUWk/b8G2gQ+2fKCjbz6xpCFZ2RCcpW89ytpneFI7wIUeIPxxH+Cuh+cnkANZCxUEbQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:05.511136Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.1302","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c5939bbd78c361db5ed255c82920f41683ba94767dc7caa25e8cf2f0e57a101","sha256:fd9ee6b4eba0f6087b59c6f7495ab3eab39144d59b71b185d268f22bcaea680e"],"state_sha256":"2e178d17db2abf3e74339fba97bacf874413669486c82854b74ee47fb4f5f9d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qRt7BF8B2H0JZl8l+VAT1SjJ/r+vvMKOeCXdP7lnHMXH4plfbYDgPOtrdaUQ94BJCDeQpqkz3RwIb6Fcfv+/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:59:57.551968Z","bundle_sha256":"57aed878de96f0f64abb6905155d343e531a33ba4f65547495d2a3d141ccb292"}}