{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HU2IWALRTDG7BBIPEGOVHVRNG7","short_pith_number":"pith:HU2IWALR","schema_version":"1.0","canonical_sha256":"3d348b017198cdf0850f219d53d62d37e7ccf9e22ed7734c5c51f2ceb8f8c6da","source":{"kind":"arxiv","id":"1212.6745","version":4},"attestation_state":"computed","paper":{"title":"Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","submitted_at":"2012-12-30T17:06:59Z","abstract_excerpt":"We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complex $n$-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. Algorithmic probability also elegantly connects the frequ"},"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":"1212.6745","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-12-30T17:06:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"24ff211cca76b9b5b662acb1a8ba6b93fca9db1646652f132737f0573258ac8a","abstract_canon_sha256":"3f31203f2c09403e24b6f95e1475e292f13397701335edc044640727760a47aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:45.862665Z","signature_b64":"1meRy1ZBcjAX8I0U6AALYSRALVGnsUEHIfnYaoi3m6gp2gjpoSwaFeYSH3B/evVJcYbVNNyRN+oxJDFScFhdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d348b017198cdf0850f219d53d62d37e7ccf9e22ed7734c5c51f2ceb8f8c6da","last_reissued_at":"2026-05-18T01:34:45.861890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:45.861890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Fernando Soler-Toscano, Hector Zenil, Jean-Paul Delahaye, Nicolas Gauvrit","submitted_at":"2012-12-30T17:06:59Z","abstract_excerpt":"We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing machine. The technique is interesting because it provides a natural algorithmic process for symmetry breaking generating complex $n$-dimensional structures from perfectly symmetric and fully deterministic computational rules producing a distribution of patterns as described by algorithmic probability. Algorithmic probability also elegantly connects the frequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6745","kind":"arxiv","version":4},"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":"1212.6745","created_at":"2026-05-18T01:34:45.861999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6745v4","created_at":"2026-05-18T01:34:45.861999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6745","created_at":"2026-05-18T01:34:45.861999+00:00"},{"alias_kind":"pith_short_12","alias_value":"HU2IWALRTDG7","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HU2IWALRTDG7BBIP","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HU2IWALR","created_at":"2026-05-18T12:27:09.501522+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.15551","citing_title":"Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7","json":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7.json","graph_json":"https://pith.science/api/pith-number/HU2IWALRTDG7BBIPEGOVHVRNG7/graph.json","events_json":"https://pith.science/api/pith-number/HU2IWALRTDG7BBIPEGOVHVRNG7/events.json","paper":"https://pith.science/paper/HU2IWALR"},"agent_actions":{"view_html":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7","download_json":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7.json","view_paper":"https://pith.science/paper/HU2IWALR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6745&json=true","fetch_graph":"https://pith.science/api/pith-number/HU2IWALRTDG7BBIPEGOVHVRNG7/graph.json","fetch_events":"https://pith.science/api/pith-number/HU2IWALRTDG7BBIPEGOVHVRNG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/action/storage_attestation","attest_author":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/action/author_attestation","sign_citation":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/action/citation_signature","submit_replication":"https://pith.science/pith/HU2IWALRTDG7BBIPEGOVHVRNG7/action/replication_record"}},"created_at":"2026-05-18T01:34:45.861999+00:00","updated_at":"2026-05-18T01:34:45.861999+00:00"}