{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KUJPNBYLEMVQG64JBA6NZ2GTID","short_pith_number":"pith:KUJPNBYL","canonical_record":{"source":{"id":"1703.05170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-03-15T14:21:40Z","cross_cats_sorted":[],"title_canon_sha256":"c49a6606fb3879588363a6e5ff4e0ef063fcf2fa647bad4fb545d4a48b74d33a","abstract_canon_sha256":"46a065df18fa44c0b5c4c2673e1cab38b6fa13aac47f5384e14fe8f719662003"},"schema_version":"1.0"},"canonical_sha256":"5512f6870b232b037b89083cdce8d340db4bcf03f4a27e880f5be13dc1e423cf","source":{"kind":"arxiv","id":"1703.05170","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05170","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05170v1","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05170","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"KUJPNBYLEMVQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KUJPNBYLEMVQG64J","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KUJPNBYL","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KUJPNBYLEMVQG64JBA6NZ2GTID","target":"record","payload":{"canonical_record":{"source":{"id":"1703.05170","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-03-15T14:21:40Z","cross_cats_sorted":[],"title_canon_sha256":"c49a6606fb3879588363a6e5ff4e0ef063fcf2fa647bad4fb545d4a48b74d33a","abstract_canon_sha256":"46a065df18fa44c0b5c4c2673e1cab38b6fa13aac47f5384e14fe8f719662003"},"schema_version":"1.0"},"canonical_sha256":"5512f6870b232b037b89083cdce8d340db4bcf03f4a27e880f5be13dc1e423cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:38.166916Z","signature_b64":"ElJoobzkk/j2zSveoYz/twtogar/gUPsBG8JfqiwP+FI+a8BuJLM02218RG2+0CGACcR8owYbZvA0VnRQMk8DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5512f6870b232b037b89083cdce8d340db4bcf03f4a27e880f5be13dc1e423cf","last_reissued_at":"2026-05-18T00:48:38.166221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:38.166221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.05170","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-18T00:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w2w861UImd7CddIMLKUWodaRh50oQd+60AyOfJBTMT8/NVkohFQsxPrRZE4tDQMOO+8N3TLAWsYKD+eG2NhCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:40:03.013175Z"},"content_sha256":"1df8b60adffd15cf2192ec3741528fb2e6c271fcf6fba20ab30392804afd50c6","schema_version":"1.0","event_id":"sha256:1df8b60adffd15cf2192ec3741528fb2e6c271fcf6fba20ab30392804afd50c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KUJPNBYLEMVQG64JBA6NZ2GTID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Busy beavers and Kolmogorov complexity","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mikhail Andreev","submitted_at":"2017-03-15T14:21:40Z","abstract_excerpt":"The idea to find the \"maximal number that can be named\" can be traced back to Archimedes (see his Psammit). From the viewpoint of computation theory the natural question is \"which number can be described by at most n bits\"? This question led to the definition of the so-called \"busy beaver\" numbers (introduced by T. Rado). In this note we consider different versions of the busy beaver-like notions defined in terms of Kolmogorov complexity. We show that these versions differ depending on the version of complexity used (plain, prefix, or a priori complexities) and find out how these notions are r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05170","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-18T00:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P68sxpLaFFa1mwCG0z7CMnDuu0jGsjXo3JQRpYlJlTgKu7rhVtHqYiLKeKKXO9zoBUunrrcUCLyw6fj/XRX9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:40:03.013545Z"},"content_sha256":"3252da70421ea61962ebffa415f514d4205dbb00b61940324523144abbdcdee6","schema_version":"1.0","event_id":"sha256:3252da70421ea61962ebffa415f514d4205dbb00b61940324523144abbdcdee6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUJPNBYLEMVQG64JBA6NZ2GTID/bundle.json","state_url":"https://pith.science/pith/KUJPNBYLEMVQG64JBA6NZ2GTID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUJPNBYLEMVQG64JBA6NZ2GTID/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-05-31T09:40:03Z","links":{"resolver":"https://pith.science/pith/KUJPNBYLEMVQG64JBA6NZ2GTID","bundle":"https://pith.science/pith/KUJPNBYLEMVQG64JBA6NZ2GTID/bundle.json","state":"https://pith.science/pith/KUJPNBYLEMVQG64JBA6NZ2GTID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUJPNBYLEMVQG64JBA6NZ2GTID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KUJPNBYLEMVQG64JBA6NZ2GTID","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":"46a065df18fa44c0b5c4c2673e1cab38b6fa13aac47f5384e14fe8f719662003","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-03-15T14:21:40Z","title_canon_sha256":"c49a6606fb3879588363a6e5ff4e0ef063fcf2fa647bad4fb545d4a48b74d33a"},"schema_version":"1.0","source":{"id":"1703.05170","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05170","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05170v1","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05170","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"KUJPNBYLEMVQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KUJPNBYLEMVQG64J","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KUJPNBYL","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:3252da70421ea61962ebffa415f514d4205dbb00b61940324523144abbdcdee6","target":"graph","created_at":"2026-05-18T00:48:38Z","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 idea to find the \"maximal number that can be named\" can be traced back to Archimedes (see his Psammit). From the viewpoint of computation theory the natural question is \"which number can be described by at most n bits\"? This question led to the definition of the so-called \"busy beaver\" numbers (introduced by T. Rado). In this note we consider different versions of the busy beaver-like notions defined in terms of Kolmogorov complexity. We show that these versions differ depending on the version of complexity used (plain, prefix, or a priori complexities) and find out how these notions are r","authors_text":"Mikhail Andreev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-03-15T14:21:40Z","title":"Busy beavers and Kolmogorov complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05170","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:1df8b60adffd15cf2192ec3741528fb2e6c271fcf6fba20ab30392804afd50c6","target":"record","created_at":"2026-05-18T00:48:38Z","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":"46a065df18fa44c0b5c4c2673e1cab38b6fa13aac47f5384e14fe8f719662003","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-03-15T14:21:40Z","title_canon_sha256":"c49a6606fb3879588363a6e5ff4e0ef063fcf2fa647bad4fb545d4a48b74d33a"},"schema_version":"1.0","source":{"id":"1703.05170","kind":"arxiv","version":1}},"canonical_sha256":"5512f6870b232b037b89083cdce8d340db4bcf03f4a27e880f5be13dc1e423cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5512f6870b232b037b89083cdce8d340db4bcf03f4a27e880f5be13dc1e423cf","first_computed_at":"2026-05-18T00:48:38.166221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:38.166221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ElJoobzkk/j2zSveoYz/twtogar/gUPsBG8JfqiwP+FI+a8BuJLM02218RG2+0CGACcR8owYbZvA0VnRQMk8DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:38.166916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05170","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1df8b60adffd15cf2192ec3741528fb2e6c271fcf6fba20ab30392804afd50c6","sha256:3252da70421ea61962ebffa415f514d4205dbb00b61940324523144abbdcdee6"],"state_sha256":"97fae799b2c82b07ae2826b576a74710c59caf04640768061ff3e8ac21355743"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQcovURAHfpNzCvVoVA3DAU3fN06hKJm/PKN32+Jx60SldAtba2Yq29aMVuYd9HMn6t9bTiu8eavRZN2oeCiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:40:03.015823Z","bundle_sha256":"06ae056bb0a4d57e25a328abd30d4b21c083e320c4d1ccb4b5a363b7b6371a17"}}