{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NXH6V3UW3UEO2JC4TMVGDDJDCO","short_pith_number":"pith:NXH6V3UW","schema_version":"1.0","canonical_sha256":"6dcfeaee96dd08ed245c9b2a618d23138c3282ab9b506fa8a8f259cfccf3a075","source":{"kind":"arxiv","id":"1409.4080","version":2},"attestation_state":"computed","paper":{"title":"Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.CC","authors_text":"Fernando Soler-Toscano, Hector Zenil, Henrik Singmann, Nicolas Gauvrit","submitted_at":"2014-09-14T17:31:40Z","abstract_excerpt":"Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \\emph{coding theorem method} the complexity of strings of length 2-11 can now be numerically estimated. We present the theoretical basis of algorithmic complexity for short strings (ACSS) and describe an R-package providing functions based on ACSS that will cover psychologists' needs and improve upon previous methods in three ways: (1) ACSS is now available not only for binary strings, but for strings based on up to 9 dif"},"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":"1409.4080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-14T17:31:40Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"2fc1beed75de8b67c5e57252619be28b3286ad81b3828bd2ef7d157b137a0a30","abstract_canon_sha256":"c4de4786ffaa79c19e8ca2be45171a8e8ca81254858855b7c779ef44502e64a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:45.308743Z","signature_b64":"zrvv6iB9fmImOPpCUwRAjOYptC51F23siD1h3S8BR0eml5k7f4HmMbQkItFcL+vvMw11wlU74Cqx2v2iabdnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dcfeaee96dd08ed245c9b2a618d23138c3282ab9b506fa8a8f259cfccf3a075","last_reissued_at":"2026-05-18T02:26:45.308277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:45.308277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.CC","authors_text":"Fernando Soler-Toscano, Hector Zenil, Henrik Singmann, Nicolas Gauvrit","submitted_at":"2014-09-14T17:31:40Z","abstract_excerpt":"Kolmogorov-Chaitin complexity has long been believed to be impossible to approximate when it comes to short sequences (e.g. of length 5-50). However, with the newly developed \\emph{coding theorem method} the complexity of strings of length 2-11 can now be numerically estimated. We present the theoretical basis of algorithmic complexity for short strings (ACSS) and describe an R-package providing functions based on ACSS that will cover psychologists' needs and improve upon previous methods in three ways: (1) ACSS is now available not only for binary strings, but for strings based on up to 9 dif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4080","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":"1409.4080","created_at":"2026-05-18T02:26:45.308353+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.4080v2","created_at":"2026-05-18T02:26:45.308353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4080","created_at":"2026-05-18T02:26:45.308353+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXH6V3UW3UEO","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXH6V3UW3UEO2JC4","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXH6V3UW","created_at":"2026-05-18T12:28:41.024544+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/NXH6V3UW3UEO2JC4TMVGDDJDCO","json":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO.json","graph_json":"https://pith.science/api/pith-number/NXH6V3UW3UEO2JC4TMVGDDJDCO/graph.json","events_json":"https://pith.science/api/pith-number/NXH6V3UW3UEO2JC4TMVGDDJDCO/events.json","paper":"https://pith.science/paper/NXH6V3UW"},"agent_actions":{"view_html":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO","download_json":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO.json","view_paper":"https://pith.science/paper/NXH6V3UW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.4080&json=true","fetch_graph":"https://pith.science/api/pith-number/NXH6V3UW3UEO2JC4TMVGDDJDCO/graph.json","fetch_events":"https://pith.science/api/pith-number/NXH6V3UW3UEO2JC4TMVGDDJDCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/action/storage_attestation","attest_author":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/action/author_attestation","sign_citation":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/action/citation_signature","submit_replication":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/action/replication_record"}},"created_at":"2026-05-18T02:26:45.308353+00:00","updated_at":"2026-05-18T02:26:45.308353+00:00"}