{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OTFBNQF7FYHKCCVQNZFIARNHG2","short_pith_number":"pith:OTFBNQF7","canonical_record":{"source":{"id":"1102.0686","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-03T13:58:28Z","cross_cats_sorted":["cs.CC","cs.LO","math.IT","math.LO"],"title_canon_sha256":"71e5f5eaafb76e72144d86cf8ea4474211e3c7082a14ad1be7d76d4df4fa4c3c","abstract_canon_sha256":"3ad433bbbb95e525e367290259f8baf644e1067ce5f13c0119e86936cadab2b7"},"schema_version":"1.0"},"canonical_sha256":"74ca16c0bf2e0ea10ab06e4a8045a7369853b70d664b8afae11a085d30c35479","source":{"kind":"arxiv","id":"1102.0686","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0686","created_at":"2026-05-18T04:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0686v2","created_at":"2026-05-18T04:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0686","created_at":"2026-05-18T04:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"OTFBNQF7FYHK","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OTFBNQF7FYHKCCVQ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OTFBNQF7","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OTFBNQF7FYHKCCVQNZFIARNHG2","target":"record","payload":{"canonical_record":{"source":{"id":"1102.0686","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-03T13:58:28Z","cross_cats_sorted":["cs.CC","cs.LO","math.IT","math.LO"],"title_canon_sha256":"71e5f5eaafb76e72144d86cf8ea4474211e3c7082a14ad1be7d76d4df4fa4c3c","abstract_canon_sha256":"3ad433bbbb95e525e367290259f8baf644e1067ce5f13c0119e86936cadab2b7"},"schema_version":"1.0"},"canonical_sha256":"74ca16c0bf2e0ea10ab06e4a8045a7369853b70d664b8afae11a085d30c35479","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:25.476307Z","signature_b64":"nwFqzy7dCJ+dAVABNq65TJa9nHy8FgbSZrWcwyHjv3xQpTtfHdjtSMP3kF+9rXFG+gScbfNB8WtoFpLkDF+4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74ca16c0bf2e0ea10ab06e4a8045a7369853b70d664b8afae11a085d30c35479","last_reissued_at":"2026-05-18T04:25:25.475498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:25.475498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.0686","source_version":2,"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-18T04:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oz+x3uKs7v4RzFAjl95stZdt6HqKRAIWCaXiUI1My+IA5U+x6wyIGiAeyYsaopKOudN17ivMHhrnq/06mwJ4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:37:16.473989Z"},"content_sha256":"84d0cbeb197b9f9c7ca35cb2a464c2ce56b1b398f2611a5207027a0309c65483","schema_version":"1.0","event_id":"sha256:84d0cbeb197b9f9c7ca35cb2a464c2ce56b1b398f2611a5207027a0309c65483"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OTFBNQF7FYHKCCVQNZFIARNHG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards an axiomatic system for Kolmogorov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LO","math.IT","math.LO"],"primary_cat":"cs.IT","authors_text":"Antoine Taveneaux","submitted_at":"2011-02-03T13:58:28Z","abstract_excerpt":"In [She82], it is shown that four basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization of this notion. In this paper, we try to extend this work, both by looking at alternative axiomatic systems for plain complexity and by considering potential axiomatic systems for other types of complexity. First we show that the axiomatic system given by Shen cannot be weakened (at least in any natural way). We then give an analogue of Shen's axiomatic system for conditional complexity. In a the second part of the paper, we look at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0686","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"},"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-18T04:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q6ePIO9p5qQ7Z+yunUGW7xj+JbF1mCma9Kfnc4BZJWxBZUuomAlyngIL03t5VvuAZSqwhjwHjWTSfAYW0efcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:37:16.474678Z"},"content_sha256":"6358acfb431305284527e397180f52ed3692e087cc89a54f525d5b0010d72055","schema_version":"1.0","event_id":"sha256:6358acfb431305284527e397180f52ed3692e087cc89a54f525d5b0010d72055"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTFBNQF7FYHKCCVQNZFIARNHG2/bundle.json","state_url":"https://pith.science/pith/OTFBNQF7FYHKCCVQNZFIARNHG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTFBNQF7FYHKCCVQNZFIARNHG2/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-27T03:37:16Z","links":{"resolver":"https://pith.science/pith/OTFBNQF7FYHKCCVQNZFIARNHG2","bundle":"https://pith.science/pith/OTFBNQF7FYHKCCVQNZFIARNHG2/bundle.json","state":"https://pith.science/pith/OTFBNQF7FYHKCCVQNZFIARNHG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTFBNQF7FYHKCCVQNZFIARNHG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OTFBNQF7FYHKCCVQNZFIARNHG2","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":"3ad433bbbb95e525e367290259f8baf644e1067ce5f13c0119e86936cadab2b7","cross_cats_sorted":["cs.CC","cs.LO","math.IT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-03T13:58:28Z","title_canon_sha256":"71e5f5eaafb76e72144d86cf8ea4474211e3c7082a14ad1be7d76d4df4fa4c3c"},"schema_version":"1.0","source":{"id":"1102.0686","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0686","created_at":"2026-05-18T04:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0686v2","created_at":"2026-05-18T04:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0686","created_at":"2026-05-18T04:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"OTFBNQF7FYHK","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"OTFBNQF7FYHKCCVQ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"OTFBNQF7","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:6358acfb431305284527e397180f52ed3692e087cc89a54f525d5b0010d72055","target":"graph","created_at":"2026-05-18T04:25:25Z","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":"In [She82], it is shown that four basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization of this notion. In this paper, we try to extend this work, both by looking at alternative axiomatic systems for plain complexity and by considering potential axiomatic systems for other types of complexity. First we show that the axiomatic system given by Shen cannot be weakened (at least in any natural way). We then give an analogue of Shen's axiomatic system for conditional complexity. In a the second part of the paper, we look at","authors_text":"Antoine Taveneaux","cross_cats":["cs.CC","cs.LO","math.IT","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-03T13:58:28Z","title":"Towards an axiomatic system for Kolmogorov complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0686","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:84d0cbeb197b9f9c7ca35cb2a464c2ce56b1b398f2611a5207027a0309c65483","target":"record","created_at":"2026-05-18T04:25:25Z","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":"3ad433bbbb95e525e367290259f8baf644e1067ce5f13c0119e86936cadab2b7","cross_cats_sorted":["cs.CC","cs.LO","math.IT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-03T13:58:28Z","title_canon_sha256":"71e5f5eaafb76e72144d86cf8ea4474211e3c7082a14ad1be7d76d4df4fa4c3c"},"schema_version":"1.0","source":{"id":"1102.0686","kind":"arxiv","version":2}},"canonical_sha256":"74ca16c0bf2e0ea10ab06e4a8045a7369853b70d664b8afae11a085d30c35479","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74ca16c0bf2e0ea10ab06e4a8045a7369853b70d664b8afae11a085d30c35479","first_computed_at":"2026-05-18T04:25:25.475498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:25.475498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nwFqzy7dCJ+dAVABNq65TJa9nHy8FgbSZrWcwyHjv3xQpTtfHdjtSMP3kF+9rXFG+gScbfNB8WtoFpLkDF+4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:25.476307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0686","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84d0cbeb197b9f9c7ca35cb2a464c2ce56b1b398f2611a5207027a0309c65483","sha256:6358acfb431305284527e397180f52ed3692e087cc89a54f525d5b0010d72055"],"state_sha256":"18fb533a2f9dba08b15bb710d6e245de29d0e1887df5528c86cdc2703be69496"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5E1HV6tiQcKEuQVS2I6ySgvXU8Cw1fnkOqrMYg5HXVi92mRXp5DMemzrWmDJrQpOYIDWjYYcPucEc+2qaTYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:37:16.482201Z","bundle_sha256":"42f77c61330d442c7bd69d20e10a7c2ca613e6aa8e11d565f6041d30deb9d281"}}