{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NZT7SH5HWTASHOEJ752SMUYQKM","short_pith_number":"pith:NZT7SH5H","schema_version":"1.0","canonical_sha256":"6e67f91fa7b4c123b889ff75265310531f7872ed92895c0111517ef2c8f3e29d","source":{"kind":"arxiv","id":"1304.8046","version":3},"attestation_state":"computed","paper":{"title":"Sophistication vs Logical Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Andreia Teixeira, Andre Souto, Bruno Bauwens, Lu\\'is Antunes","submitted_at":"2013-04-30T16:06:39Z","abstract_excerpt":"Sophistication and logical depth are two measures that express how complicated the structure in a string is. Sophistication is defined as the minimal complexity of a computable function that defines a two-part description for the string that is shortest within some precision; the second can be defined as the minimal computation time of a program that is shortest within some precision. We show that the Busy Beaver function of the sophistication of a string exceeds its logical depth with logarithmically bigger precision, and that logical depth exceeds the Busy Beaver function of sophistication w"},"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":"1304.8046","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T16:06:39Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"439aa25626f8bcf918ce4b3cebbb59562ffcad812c67a2437a0cd337f7a780e7","abstract_canon_sha256":"f86de1d441ba0dcd99b83c460dbbb733571d2b63ede0ed24b9b49ec640196d88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:02.467096Z","signature_b64":"Yd2Iaax/vzVCVUG1plH65HFicf92EIlawamn6vTBold2rR8oapvJo6IBQpJBhgUCK6mixJFsfn9HLjcKchxqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e67f91fa7b4c123b889ff75265310531f7872ed92895c0111517ef2c8f3e29d","last_reissued_at":"2026-05-18T00:52:02.466553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:02.466553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sophistication vs Logical Depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Andreia Teixeira, Andre Souto, Bruno Bauwens, Lu\\'is Antunes","submitted_at":"2013-04-30T16:06:39Z","abstract_excerpt":"Sophistication and logical depth are two measures that express how complicated the structure in a string is. Sophistication is defined as the minimal complexity of a computable function that defines a two-part description for the string that is shortest within some precision; the second can be defined as the minimal computation time of a program that is shortest within some precision. We show that the Busy Beaver function of the sophistication of a string exceeds its logical depth with logarithmically bigger precision, and that logical depth exceeds the Busy Beaver function of sophistication w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8046","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":"1304.8046","created_at":"2026-05-18T00:52:02.466636+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.8046v3","created_at":"2026-05-18T00:52:02.466636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8046","created_at":"2026-05-18T00:52:02.466636+00:00"},{"alias_kind":"pith_short_12","alias_value":"NZT7SH5HWTAS","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"NZT7SH5HWTASHOEJ","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"NZT7SH5H","created_at":"2026-05-18T12:27:54.935989+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/NZT7SH5HWTASHOEJ752SMUYQKM","json":"https://pith.science/pith/NZT7SH5HWTASHOEJ752SMUYQKM.json","graph_json":"https://pith.science/api/pith-number/NZT7SH5HWTASHOEJ752SMUYQKM/graph.json","events_json":"https://pith.science/api/pith-number/NZT7SH5HWTASHOEJ752SMUYQKM/events.json","paper":"https://pith.science/paper/NZT7SH5H"},"agent_actions":{"view_html":"https://pith.science/pith/NZT7SH5HWTASHOEJ752SMUYQKM","download_json":"https://pith.science/pith/NZT7SH5HWTASHOEJ752SMUYQKM.json","view_paper":"https://pith.science/paper/NZT7SH5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.8046&json=true","fetch_graph":"https://pith.science/api/pith-number/NZT7SH5HWTASHOEJ752SMUYQKM/graph.json","fetch_events":"https://pith.science/api/pith-number/NZT7SH5HWTASHOEJ752SMUYQKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NZT7SH5HWTASHOEJ752SMUYQKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NZT7SH5HWTASHOEJ752SMUYQKM/action/storage_attestation","attest_author":"https://pith.science/pith/NZT7SH5HWTASHOEJ752SMUYQKM/action/author_attestation","sign_citation":"https://pith.science/pith/NZT7SH5HWTASHOEJ752SMUYQKM/action/citation_signature","submit_replication":"https://pith.science/pith/NZT7SH5HWTASHOEJ752SMUYQKM/action/replication_record"}},"created_at":"2026-05-18T00:52:02.466636+00:00","updated_at":"2026-05-18T00:52:02.466636+00:00"}