{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UGNDJTFB5X4WVZCS2UEHKCYTDA","short_pith_number":"pith:UGNDJTFB","schema_version":"1.0","canonical_sha256":"a19a34cca1edf96ae452d508750b13182b4ff979a60bdbc1b0e91ce883d493f3","source":{"kind":"arxiv","id":"1211.4891","version":3},"attestation_state":"computed","paper":{"title":"Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL","math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","submitted_at":"2012-11-20T22:05:06Z","abstract_excerpt":"We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), is in agreement with the number of instructions used by the Turing machines producing s, which is consistent with strict integer-value program-size complexity. Nevertheless, K_m proves to be a finer-grained measure and a potential alternative approach to lossless compression algorithms for small entities, where compression fails. We also show that neither K_m nor"},"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.4891","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-11-20T22:05:06Z","cross_cats_sorted":["cs.CC","cs.FL","math.IT"],"title_canon_sha256":"0d4eea37e3abead75199af31b827befbf1e07e1a49e7b7545c8d1c58d9a9bf9b","abstract_canon_sha256":"0e10815ee97159123120881185c320f5fa928535ecff0d6eec843c4634696322"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:01.602503Z","signature_b64":"3csmIds9CczSpWJsadeSxPDiRgiQTbSwRWEq2dR8vWk+MANppQ9K2QrPu6nhi9zJhr4Xuhw9WEj2p/FoXXq0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a19a34cca1edf96ae452d508750b13182b4ff979a60bdbc1b0e91ce883d493f3","last_reissued_at":"2026-05-18T03:05:01.601999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:01.601999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Correspondence and Independence of Numerical Evaluations of Algorithmic Information Measures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL","math.IT"],"primary_cat":"cs.IT","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","submitted_at":"2012-11-20T22:05:06Z","abstract_excerpt":"We show that real-value approximations of Kolmogorov-Chaitin (K_m) using the algorithmic Coding theorem as calculated from the output frequency of a large set of small deterministic Turing machines with up to 5 states (and 2 symbols), is in agreement with the number of instructions used by the Turing machines producing s, which is consistent with strict integer-value program-size complexity. Nevertheless, K_m proves to be a finer-grained measure and a potential alternative approach to lossless compression algorithms for small entities, where compression fails. We also show that neither K_m nor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4891","kind":"arxiv","version":3},"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.4891","created_at":"2026-05-18T03:05:01.602084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.4891v3","created_at":"2026-05-18T03:05:01.602084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4891","created_at":"2026-05-18T03:05:01.602084+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGNDJTFB5X4W","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGNDJTFB5X4WVZCS","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGNDJTFB","created_at":"2026-05-18T12:27:23.164592+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/UGNDJTFB5X4WVZCS2UEHKCYTDA","json":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA.json","graph_json":"https://pith.science/api/pith-number/UGNDJTFB5X4WVZCS2UEHKCYTDA/graph.json","events_json":"https://pith.science/api/pith-number/UGNDJTFB5X4WVZCS2UEHKCYTDA/events.json","paper":"https://pith.science/paper/UGNDJTFB"},"agent_actions":{"view_html":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA","download_json":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA.json","view_paper":"https://pith.science/paper/UGNDJTFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.4891&json=true","fetch_graph":"https://pith.science/api/pith-number/UGNDJTFB5X4WVZCS2UEHKCYTDA/graph.json","fetch_events":"https://pith.science/api/pith-number/UGNDJTFB5X4WVZCS2UEHKCYTDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/action/storage_attestation","attest_author":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/action/author_attestation","sign_citation":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/action/citation_signature","submit_replication":"https://pith.science/pith/UGNDJTFB5X4WVZCS2UEHKCYTDA/action/replication_record"}},"created_at":"2026-05-18T03:05:01.602084+00:00","updated_at":"2026-05-18T03:05:01.602084+00:00"}