{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KX66GG2D6OHBQGZ7ID3YJNWGR2","short_pith_number":"pith:KX66GG2D","schema_version":"1.0","canonical_sha256":"55fde31b43f38e181b3f40f784b6c68ebecccf100056712629efca30da5b136d","source":{"kind":"arxiv","id":"1301.4451","version":2},"attestation_state":"computed","paper":{"title":"On the logical depth function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"A. Souto (Technical University of Lissabon), A. Teixeira (University of Porto), L. Antunes (University of Porto), P.M.B. Vitanyi (CWI, University of Amsterdam)","submitted_at":"2013-01-18T18:20:34Z","abstract_excerpt":"For a finite binary string $x$ its logical depth $d$ for significance $b$ is the shortest running time of a program for $x$ of length $K(x)+b$. There is another definition of logical depth. We give a new proof that the two versions are close. There is an infinite sequence of strings of consecutive lengths such that for every string there is a $b$ such that incrementing $b$ by 1 makes the associated depths go from incomputable to computable. The maximal gap between depths resulting from incrementing appropriate $b$'s by 1 is incomputable. The size of this gap is upper bounded by the Busy Beaver"},"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":"1301.4451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-18T18:20:34Z","cross_cats_sorted":[],"title_canon_sha256":"1902d220f0270904af877a13005733d1a7630a67d4f79f88d026de8980304aac","abstract_canon_sha256":"214893fe3568665301992e09feac95b5d97171a55cadad277609d166ffc5b18e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:13.205777Z","signature_b64":"AShn4dYDC6ZMhkGYFMr7OIOZWHU8XfQzWzPh7aOVLLXIHCjz38XiBjJipxM9j0vgRtMZV7iINWWC0gAjAmn0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55fde31b43f38e181b3f40f784b6c68ebecccf100056712629efca30da5b136d","last_reissued_at":"2026-05-18T03:19:13.205049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:13.205049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the logical depth function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"A. Souto (Technical University of Lissabon), A. Teixeira (University of Porto), L. Antunes (University of Porto), P.M.B. Vitanyi (CWI, University of Amsterdam)","submitted_at":"2013-01-18T18:20:34Z","abstract_excerpt":"For a finite binary string $x$ its logical depth $d$ for significance $b$ is the shortest running time of a program for $x$ of length $K(x)+b$. There is another definition of logical depth. We give a new proof that the two versions are close. There is an infinite sequence of strings of consecutive lengths such that for every string there is a $b$ such that incrementing $b$ by 1 makes the associated depths go from incomputable to computable. The maximal gap between depths resulting from incrementing appropriate $b$'s by 1 is incomputable. The size of this gap is upper bounded by the Busy Beaver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4451","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":"1301.4451","created_at":"2026-05-18T03:19:13.205165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4451v2","created_at":"2026-05-18T03:19:13.205165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4451","created_at":"2026-05-18T03:19:13.205165+00:00"},{"alias_kind":"pith_short_12","alias_value":"KX66GG2D6OHB","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KX66GG2D6OHBQGZ7","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KX66GG2D","created_at":"2026-05-18T12:27:51.066281+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/KX66GG2D6OHBQGZ7ID3YJNWGR2","json":"https://pith.science/pith/KX66GG2D6OHBQGZ7ID3YJNWGR2.json","graph_json":"https://pith.science/api/pith-number/KX66GG2D6OHBQGZ7ID3YJNWGR2/graph.json","events_json":"https://pith.science/api/pith-number/KX66GG2D6OHBQGZ7ID3YJNWGR2/events.json","paper":"https://pith.science/paper/KX66GG2D"},"agent_actions":{"view_html":"https://pith.science/pith/KX66GG2D6OHBQGZ7ID3YJNWGR2","download_json":"https://pith.science/pith/KX66GG2D6OHBQGZ7ID3YJNWGR2.json","view_paper":"https://pith.science/paper/KX66GG2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4451&json=true","fetch_graph":"https://pith.science/api/pith-number/KX66GG2D6OHBQGZ7ID3YJNWGR2/graph.json","fetch_events":"https://pith.science/api/pith-number/KX66GG2D6OHBQGZ7ID3YJNWGR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KX66GG2D6OHBQGZ7ID3YJNWGR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KX66GG2D6OHBQGZ7ID3YJNWGR2/action/storage_attestation","attest_author":"https://pith.science/pith/KX66GG2D6OHBQGZ7ID3YJNWGR2/action/author_attestation","sign_citation":"https://pith.science/pith/KX66GG2D6OHBQGZ7ID3YJNWGR2/action/citation_signature","submit_replication":"https://pith.science/pith/KX66GG2D6OHBQGZ7ID3YJNWGR2/action/replication_record"}},"created_at":"2026-05-18T03:19:13.205165+00:00","updated_at":"2026-05-18T03:19:13.205165+00:00"}