{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7PUKQWZYOEMMV4MVJ4ZKYY5FFU","short_pith_number":"pith:7PUKQWZY","canonical_record":{"source":{"id":"1301.3392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-15T16:06:59Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b34cc8ce3dd84c1c08bf1a3f6b1bbf78ddf02e89bfb0da5a1133245cc1e48c51","abstract_canon_sha256":"518a785a8720189488a2ba9ce92d6e5f260fa3c4a08427bbcfd2f5cc44d5c38e"},"schema_version":"1.0"},"canonical_sha256":"fbe8a85b387118caf1954f32ac63a52d18ae1b3a9e6b2dbe70a6d044da795238","source":{"kind":"arxiv","id":"1301.3392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3392","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3392v1","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3392","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"7PUKQWZYOEMM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7PUKQWZYOEMMV4MV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7PUKQWZY","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7PUKQWZYOEMMV4MVJ4ZKYY5FFU","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-15T16:06:59Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b34cc8ce3dd84c1c08bf1a3f6b1bbf78ddf02e89bfb0da5a1133245cc1e48c51","abstract_canon_sha256":"518a785a8720189488a2ba9ce92d6e5f260fa3c4a08427bbcfd2f5cc44d5c38e"},"schema_version":"1.0"},"canonical_sha256":"fbe8a85b387118caf1954f32ac63a52d18ae1b3a9e6b2dbe70a6d044da795238","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:25.685387Z","signature_b64":"7x6KMHWl7MXflINywTUlq5HLv039DCvh0WBYbL4H29MjbHjN/ryie5hKzKG97TNmtZk08QmbMtD8uq85fhZyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbe8a85b387118caf1954f32ac63a52d18ae1b3a9e6b2dbe70a6d044da795238","last_reissued_at":"2026-05-18T03:36:25.684945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:25.684945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3392","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-18T03:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUQGRnvv8KOt2gDC9wfQ0DjaJszRH4T1Vw1Xvwwc58LDTwcKvOppvelRAxSQavBUxMM11QaGBQKmHeDmrxCpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:16:29.162212Z"},"content_sha256":"ad2392dab2c265f04ebcae7297e19859b10e18d8884c73821720e01be4b79546","schema_version":"1.0","event_id":"sha256:ad2392dab2c265f04ebcae7297e19859b10e18d8884c73821720e01be4b79546"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7PUKQWZYOEMMV4MVJ4ZKYY5FFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The axiomatic power of Kolmogorov complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Alexander Shen, Andrei Romashchenko, Antoine Taveneaux, Laurent Bienvenu, Stijn Vermeeren","submitted_at":"2013-01-15T16:06:59Z","abstract_excerpt":"The famous G\\\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but how can we obtain them? One classical (and well studied) approach is to add to some theory T an axiom that claims the consistency of T. In this paper we discuss another approach motivated by Chaitin's version of G\\\"odel's theorem where axioms claiming the randomness (or incompressibility) of some strings are probabilistically added, and show that it is not r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3392","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-18T03:36:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ln5h8iq1pNCm6ZIbKoRSzb9204J8SZZ8SGhBj7xGZy1p1DVlq5+3XBcwHVu5ZlKb7Mebej1bXbNIgPxwGdAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:16:29.162885Z"},"content_sha256":"41092e192e8d66f78da7e121e9558ba7e4a8d245b620921539a443a5c348961d","schema_version":"1.0","event_id":"sha256:41092e192e8d66f78da7e121e9558ba7e4a8d245b620921539a443a5c348961d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7PUKQWZYOEMMV4MVJ4ZKYY5FFU/bundle.json","state_url":"https://pith.science/pith/7PUKQWZYOEMMV4MVJ4ZKYY5FFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7PUKQWZYOEMMV4MVJ4ZKYY5FFU/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-26T03:16:29Z","links":{"resolver":"https://pith.science/pith/7PUKQWZYOEMMV4MVJ4ZKYY5FFU","bundle":"https://pith.science/pith/7PUKQWZYOEMMV4MVJ4ZKYY5FFU/bundle.json","state":"https://pith.science/pith/7PUKQWZYOEMMV4MVJ4ZKYY5FFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7PUKQWZYOEMMV4MVJ4ZKYY5FFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7PUKQWZYOEMMV4MVJ4ZKYY5FFU","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":"518a785a8720189488a2ba9ce92d6e5f260fa3c4a08427bbcfd2f5cc44d5c38e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-15T16:06:59Z","title_canon_sha256":"b34cc8ce3dd84c1c08bf1a3f6b1bbf78ddf02e89bfb0da5a1133245cc1e48c51"},"schema_version":"1.0","source":{"id":"1301.3392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3392","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3392v1","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3392","created_at":"2026-05-18T03:36:25Z"},{"alias_kind":"pith_short_12","alias_value":"7PUKQWZYOEMM","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7PUKQWZYOEMMV4MV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7PUKQWZY","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:41092e192e8d66f78da7e121e9558ba7e4a8d245b620921539a443a5c348961d","target":"graph","created_at":"2026-05-18T03:36: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":"The famous G\\\"odel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements would be natural candidates for being added as axioms, but how can we obtain them? One classical (and well studied) approach is to add to some theory T an axiom that claims the consistency of T. In this paper we discuss another approach motivated by Chaitin's version of G\\\"odel's theorem where axioms claiming the randomness (or incompressibility) of some strings are probabilistically added, and show that it is not r","authors_text":"Alexander Shen, Andrei Romashchenko, Antoine Taveneaux, Laurent Bienvenu, Stijn Vermeeren","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-15T16:06:59Z","title":"The axiomatic power of Kolmogorov complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3392","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:ad2392dab2c265f04ebcae7297e19859b10e18d8884c73821720e01be4b79546","target":"record","created_at":"2026-05-18T03:36: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":"518a785a8720189488a2ba9ce92d6e5f260fa3c4a08427bbcfd2f5cc44d5c38e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-15T16:06:59Z","title_canon_sha256":"b34cc8ce3dd84c1c08bf1a3f6b1bbf78ddf02e89bfb0da5a1133245cc1e48c51"},"schema_version":"1.0","source":{"id":"1301.3392","kind":"arxiv","version":1}},"canonical_sha256":"fbe8a85b387118caf1954f32ac63a52d18ae1b3a9e6b2dbe70a6d044da795238","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fbe8a85b387118caf1954f32ac63a52d18ae1b3a9e6b2dbe70a6d044da795238","first_computed_at":"2026-05-18T03:36:25.684945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:25.684945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7x6KMHWl7MXflINywTUlq5HLv039DCvh0WBYbL4H29MjbHjN/ryie5hKzKG97TNmtZk08QmbMtD8uq85fhZyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:25.685387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad2392dab2c265f04ebcae7297e19859b10e18d8884c73821720e01be4b79546","sha256:41092e192e8d66f78da7e121e9558ba7e4a8d245b620921539a443a5c348961d"],"state_sha256":"09c7cdd374896f5138f43501676e9b30aac78b174c55e86510a06f9169266e5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0LSvhS6Jyla0Nmhb3HsHttNZKLnpRuvdNzk0lhB150gwnl7+t59wWgcXAmb5URn0rCxU6rq6lTqYDpE9ofbvAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:16:29.166388Z","bundle_sha256":"4ba7820a0276739122d6eeb114576767468634847dd4e76b0bc4d2f2711b46fe"}}