{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JIC5KG5KBGREM5CXNJ7D2PTJGT","short_pith_number":"pith:JIC5KG5K","canonical_record":{"source":{"id":"1902.01279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-02-04T16:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"e0c3b05dc07a226e058aeb6ad708f1d1aedc332c7e05e6558b4ffebd564a0290","abstract_canon_sha256":"1826d56b7d2d1badfc185b82c2f5ca2db88f708dab1078e905b050b12bd9423a"},"schema_version":"1.0"},"canonical_sha256":"4a05d51baa09a24674576a7e3d3e6934e618828eb1f96dd7e173a5a99ba6096f","source":{"kind":"arxiv","id":"1902.01279","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01279","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01279v1","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01279","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"JIC5KG5KBGRE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JIC5KG5KBGREM5CX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JIC5KG5K","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JIC5KG5KBGREM5CXNJ7D2PTJGT","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-02-04T16:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"e0c3b05dc07a226e058aeb6ad708f1d1aedc332c7e05e6558b4ffebd564a0290","abstract_canon_sha256":"1826d56b7d2d1badfc185b82c2f5ca2db88f708dab1078e905b050b12bd9423a"},"schema_version":"1.0"},"canonical_sha256":"4a05d51baa09a24674576a7e3d3e6934e618828eb1f96dd7e173a5a99ba6096f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:49.275668Z","signature_b64":"Cwqn2zTjMw/CrkPf//fShPJBsdAe+fb1rBY+QPyZU6f+M60oBwH41dfb+PkNZnAB7vxUFss218v3nZthIuMHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a05d51baa09a24674576a7e3d3e6934e618828eb1f96dd7e173a5a99ba6096f","last_reissued_at":"2026-05-17T23:54:49.275080Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:49.275080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01279","source_version":1,"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-17T23:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a5k0bU8d+3EihJOAr4Zb2S5wAUmW1Mmrd71GPlMk33wOD2ZOJxe3zNOxC4S6XivLAb7+t8iXhB6fvl7rReN3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:03:53.758632Z"},"content_sha256":"8d6256e00cac64893659385ecd2b4537ca8e46517dfb8aa2b2246f651548265b","schema_version":"1.0","event_id":"sha256:8d6256e00cac64893659385ecd2b4537ca8e46517dfb8aa2b2246f651548265b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JIC5KG5KBGREM5CXNJ7D2PTJGT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Descriptive Complexity of Computable Sequences Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Nikolay Vereshchagin","submitted_at":"2019-02-04T16:13:01Z","abstract_excerpt":"The purpose of this paper is to answer two questions left open in [B. Durand, A. Shen, and N. Vereshchagin, Descriptive Complexity of Computable Sequences, Theoretical Computer Science 171 (2001), pp. 47--58]. Namely, we consider the following two complexities of an infinite computable 0-1-sequence $\\alpha$: $C^{0'}(\\alpha )$, defined as the minimal length of a program with oracle $0'$ that prints $\\alpha$, and $M_{\\infty}(\\alpha)$, defined as $\\liminf C(\\alpha_{1:n}|n)$, where $\\alpha_{1:n}$ denotes the length-$n$ prefix of $\\alpha$ and $C(x|y)$ stands for conditional Kolmogorov complexity. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01279","kind":"arxiv","version":1},"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-17T23:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ZVTCQ9RXT1EnQelcrH/3hDWY2Q5ZJ78ic0vGc0LvQG8+0g+SE2aGpzcDdOovUvCXRKGcAZjTmmqswsH+Hc7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:03:53.759209Z"},"content_sha256":"d4c520995c0f196928455062bd61410025e43d450964c80778b654d2a52cb8b8","schema_version":"1.0","event_id":"sha256:d4c520995c0f196928455062bd61410025e43d450964c80778b654d2a52cb8b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIC5KG5KBGREM5CXNJ7D2PTJGT/bundle.json","state_url":"https://pith.science/pith/JIC5KG5KBGREM5CXNJ7D2PTJGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIC5KG5KBGREM5CXNJ7D2PTJGT/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-06-07T09:03:53Z","links":{"resolver":"https://pith.science/pith/JIC5KG5KBGREM5CXNJ7D2PTJGT","bundle":"https://pith.science/pith/JIC5KG5KBGREM5CXNJ7D2PTJGT/bundle.json","state":"https://pith.science/pith/JIC5KG5KBGREM5CXNJ7D2PTJGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIC5KG5KBGREM5CXNJ7D2PTJGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JIC5KG5KBGREM5CXNJ7D2PTJGT","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":"1826d56b7d2d1badfc185b82c2f5ca2db88f708dab1078e905b050b12bd9423a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-02-04T16:13:01Z","title_canon_sha256":"e0c3b05dc07a226e058aeb6ad708f1d1aedc332c7e05e6558b4ffebd564a0290"},"schema_version":"1.0","source":{"id":"1902.01279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01279","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01279v1","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01279","created_at":"2026-05-17T23:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"JIC5KG5KBGRE","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JIC5KG5KBGREM5CX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JIC5KG5K","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:d4c520995c0f196928455062bd61410025e43d450964c80778b654d2a52cb8b8","target":"graph","created_at":"2026-05-17T23:54:49Z","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":"The purpose of this paper is to answer two questions left open in [B. Durand, A. Shen, and N. Vereshchagin, Descriptive Complexity of Computable Sequences, Theoretical Computer Science 171 (2001), pp. 47--58]. Namely, we consider the following two complexities of an infinite computable 0-1-sequence $\\alpha$: $C^{0'}(\\alpha )$, defined as the minimal length of a program with oracle $0'$ that prints $\\alpha$, and $M_{\\infty}(\\alpha)$, defined as $\\liminf C(\\alpha_{1:n}|n)$, where $\\alpha_{1:n}$ denotes the length-$n$ prefix of $\\alpha$ and $C(x|y)$ stands for conditional Kolmogorov complexity. W","authors_text":"Nikolay Vereshchagin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-02-04T16:13:01Z","title":"Descriptive Complexity of Computable Sequences Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01279","kind":"arxiv","version":1},"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:8d6256e00cac64893659385ecd2b4537ca8e46517dfb8aa2b2246f651548265b","target":"record","created_at":"2026-05-17T23:54:49Z","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":"1826d56b7d2d1badfc185b82c2f5ca2db88f708dab1078e905b050b12bd9423a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2019-02-04T16:13:01Z","title_canon_sha256":"e0c3b05dc07a226e058aeb6ad708f1d1aedc332c7e05e6558b4ffebd564a0290"},"schema_version":"1.0","source":{"id":"1902.01279","kind":"arxiv","version":1}},"canonical_sha256":"4a05d51baa09a24674576a7e3d3e6934e618828eb1f96dd7e173a5a99ba6096f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a05d51baa09a24674576a7e3d3e6934e618828eb1f96dd7e173a5a99ba6096f","first_computed_at":"2026-05-17T23:54:49.275080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:49.275080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cwqn2zTjMw/CrkPf//fShPJBsdAe+fb1rBY+QPyZU6f+M60oBwH41dfb+PkNZnAB7vxUFss218v3nZthIuMHDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:49.275668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d6256e00cac64893659385ecd2b4537ca8e46517dfb8aa2b2246f651548265b","sha256:d4c520995c0f196928455062bd61410025e43d450964c80778b654d2a52cb8b8"],"state_sha256":"0b204a3a773cede285abc91dffd63af83459bc849b1dda7ffe2fe4d0a970142a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K2teWCH+NwBA6ll/eHiTzzHr6qQOV9a3tT+M1M5FqY5CdEUqGfK4n4z6/u6eGVWKQCL+gRs6lVxTcZVw6l2aCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:03:53.762524Z","bundle_sha256":"834f62bb9df2323aef27d62655cf0655d53a9337a7e9ed7d215e36e7ee90075c"}}