{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NXH6V3UW3UEO2JC4TMVGDDJDCO","short_pith_number":"pith:NXH6V3UW","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"},"canonical_sha256":"6dcfeaee96dd08ed245c9b2a618d23138c3282ab9b506fa8a8f259cfccf3a075","source":{"kind":"arxiv","id":"1409.4080","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4080","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4080v2","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4080","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"NXH6V3UW3UEO","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NXH6V3UW3UEO2JC4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NXH6V3UW","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NXH6V3UW3UEO2JC4TMVGDDJDCO","target":"record","payload":{"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"},"canonical_sha256":"6dcfeaee96dd08ed245c9b2a618d23138c3282ab9b506fa8a8f259cfccf3a075","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"},"source_kind":"arxiv","source_id":"1409.4080","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:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYNccMb1aGHJcwjN4Te2nwA8AJhfceBEnYzNQApH9lsb0lA/O2snYbnrnZnQMNqSSr620zW0j32dkFTe28X3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:40:19.087779Z"},"content_sha256":"b574a17047b18388a33994c75e845df68c78c8adcdb201717f5acda3307e1b3f","schema_version":"1.0","event_id":"sha256:b574a17047b18388a33994c75e845df68c78c8adcdb201717f5acda3307e1b3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NXH6V3UW3UEO2JC4TMVGDDJDCO","target":"graph","payload":{"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"},"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:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X70IQiybXMct6xo505wLSa9BX9ZvYGp15F6/GKAAV6Ek4Cycth0V6rpUg8BzygqOR2zUm0EEsqgKy9uIxYRzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:40:19.088482Z"},"content_sha256":"b016f95dd6874a547442c3a451554f35fe9a1c7c1134fcd6280e811270eed225","schema_version":"1.0","event_id":"sha256:b016f95dd6874a547442c3a451554f35fe9a1c7c1134fcd6280e811270eed225"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/bundle.json","state_url":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/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-25T17:40:19Z","links":{"resolver":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO","bundle":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/bundle.json","state":"https://pith.science/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXH6V3UW3UEO2JC4TMVGDDJDCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NXH6V3UW3UEO2JC4TMVGDDJDCO","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":"c4de4786ffaa79c19e8ca2be45171a8e8ca81254858855b7c779ef44502e64a2","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-14T17:31:40Z","title_canon_sha256":"2fc1beed75de8b67c5e57252619be28b3286ad81b3828bd2ef7d157b137a0a30"},"schema_version":"1.0","source":{"id":"1409.4080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4080","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4080v2","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4080","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"NXH6V3UW3UEO","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NXH6V3UW3UEO2JC4","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NXH6V3UW","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:b016f95dd6874a547442c3a451554f35fe9a1c7c1134fcd6280e811270eed225","target":"graph","created_at":"2026-05-18T02:26:45Z","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":"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","authors_text":"Fernando Soler-Toscano, Hector Zenil, Henrik Singmann, Nicolas Gauvrit","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-14T17:31:40Z","title":"Algorithmic complexity for psychology: A user-friendly implementation of the coding theorem method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4080","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:b574a17047b18388a33994c75e845df68c78c8adcdb201717f5acda3307e1b3f","target":"record","created_at":"2026-05-18T02:26:45Z","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":"c4de4786ffaa79c19e8ca2be45171a8e8ca81254858855b7c779ef44502e64a2","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-14T17:31:40Z","title_canon_sha256":"2fc1beed75de8b67c5e57252619be28b3286ad81b3828bd2ef7d157b137a0a30"},"schema_version":"1.0","source":{"id":"1409.4080","kind":"arxiv","version":2}},"canonical_sha256":"6dcfeaee96dd08ed245c9b2a618d23138c3282ab9b506fa8a8f259cfccf3a075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dcfeaee96dd08ed245c9b2a618d23138c3282ab9b506fa8a8f259cfccf3a075","first_computed_at":"2026-05-18T02:26:45.308277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:45.308277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zrvv6iB9fmImOPpCUwRAjOYptC51F23siD1h3S8BR0eml5k7f4HmMbQkItFcL+vvMw11wlU74Cqx2v2iabdnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:45.308743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b574a17047b18388a33994c75e845df68c78c8adcdb201717f5acda3307e1b3f","sha256:b016f95dd6874a547442c3a451554f35fe9a1c7c1134fcd6280e811270eed225"],"state_sha256":"71948280536c044c9ecb283e9a313f13f1e75efb4af542c8bd6853e761c0d888"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4gc4w7Xs9hcy7yegzFY7O/ZExioYJFPXB7lmbuxVnZ9aNGrtvuKD1Z6YAJ5jhC3WaIH3O464xUCSGhvc0GZjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:40:19.092230Z","bundle_sha256":"d2a95c4d94d0c8d5d0f0d81f47d6eb4474847705cc64e5ad0aa3fe8055076953"}}