{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KX66GG2D6OHBQGZ7ID3YJNWGR2","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":"214893fe3568665301992e09feac95b5d97171a55cadad277609d166ffc5b18e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-18T18:20:34Z","title_canon_sha256":"1902d220f0270904af877a13005733d1a7630a67d4f79f88d026de8980304aac"},"schema_version":"1.0","source":{"id":"1301.4451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4451","created_at":"2026-05-18T03:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4451v2","created_at":"2026-05-18T03:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4451","created_at":"2026-05-18T03:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"KX66GG2D6OHB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KX66GG2D6OHBQGZ7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KX66GG2D","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:20a9d191f554f6002ed37104a7d68d19cbdd9f4e0d5ab2fdfc5bcd8ed851a307","target":"graph","created_at":"2026-05-18T03:19:13Z","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":"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","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)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-18T18:20:34Z","title":"On the logical depth function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4451","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:4fecf3d579202363e88bef333c0d48d6af4ade63da5e2107cb0e192cb88ba79d","target":"record","created_at":"2026-05-18T03:19:13Z","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":"214893fe3568665301992e09feac95b5d97171a55cadad277609d166ffc5b18e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-01-18T18:20:34Z","title_canon_sha256":"1902d220f0270904af877a13005733d1a7630a67d4f79f88d026de8980304aac"},"schema_version":"1.0","source":{"id":"1301.4451","kind":"arxiv","version":2}},"canonical_sha256":"55fde31b43f38e181b3f40f784b6c68ebecccf100056712629efca30da5b136d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55fde31b43f38e181b3f40f784b6c68ebecccf100056712629efca30da5b136d","first_computed_at":"2026-05-18T03:19:13.205049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:13.205049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AShn4dYDC6ZMhkGYFMr7OIOZWHU8XfQzWzPh7aOVLLXIHCjz38XiBjJipxM9j0vgRtMZV7iINWWC0gAjAmn0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:13.205777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fecf3d579202363e88bef333c0d48d6af4ade63da5e2107cb0e192cb88ba79d","sha256:20a9d191f554f6002ed37104a7d68d19cbdd9f4e0d5ab2fdfc5bcd8ed851a307"],"state_sha256":"6820561479e7735337b0121f0e8a862819dd00bd5bb69780c87f52e8564fc184"}