{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:Q65KRZ3HD6773DX4YUGJR4DBSX","short_pith_number":"pith:Q65KRZ3H","schema_version":"1.0","canonical_sha256":"87baa8e7671fbffd8efcc50c98f06195e840afbd49e04dc09578b1dba9ca5f7f","source":{"kind":"arxiv","id":"math/0303352","version":2},"attestation_state":"computed","paper":{"title":"From Philosophy to Program Size","license":"","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"G. J. Chaitin (IBM Research)","submitted_at":"2003-03-27T16:16:55Z","abstract_excerpt":"Most work on computational complexity is concerned with time. However this course will try to show that program-size complexity, which measures algorithmic information, is of much greater philosophical significance. I'll discuss how one can use this complexity measure to study what can and cannot be achieved by formal axiomatic mathematical theories. In particular, I'll show (a) that there are natural information-theoretic constraints on formal axiomatic theories, and that program-size complexity provides an alternative path to incompleteness from the one originally used by Kurt Godel. Further"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"math/0303352","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.HO","submitted_at":"2003-03-27T16:16:55Z","cross_cats_sorted":[],"title_canon_sha256":"3a82332482ce230f9185410290d9cf446756c346ea43cbed2f909a0288853da5","abstract_canon_sha256":"791a1019d7d44a61f309158b51ff3ec9bd671c35977f5d3f20e9ce2e0427df66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:37:10.788654Z","signature_b64":"T12jbuiDC1LRkKxRQSnuteZv2N3yNP5x7x3Y5NgAFlYVew7it8sPIe+aagwZSc92GkU5EyCkJ4+/n5uq/BTJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87baa8e7671fbffd8efcc50c98f06195e840afbd49e04dc09578b1dba9ca5f7f","last_reissued_at":"2026-07-04T14:37:10.788279Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:37:10.788279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Philosophy to Program Size","license":"","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"G. J. Chaitin (IBM Research)","submitted_at":"2003-03-27T16:16:55Z","abstract_excerpt":"Most work on computational complexity is concerned with time. However this course will try to show that program-size complexity, which measures algorithmic information, is of much greater philosophical significance. I'll discuss how one can use this complexity measure to study what can and cannot be achieved by formal axiomatic mathematical theories. In particular, I'll show (a) that there are natural information-theoretic constraints on formal axiomatic theories, and that program-size complexity provides an alternative path to incompleteness from the one originally used by Kurt Godel. Further"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0303352","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0303352/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0303352","created_at":"2026-07-04T14:37:10.788342+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0303352v2","created_at":"2026-07-04T14:37:10.788342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0303352","created_at":"2026-07-04T14:37:10.788342+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q65KRZ3HD677","created_at":"2026-07-04T14:37:10.788342+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q65KRZ3HD6773DX4","created_at":"2026-07-04T14:37:10.788342+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q65KRZ3H","created_at":"2026-07-04T14:37:10.788342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q65KRZ3HD6773DX4YUGJR4DBSX","json":"https://pith.science/pith/Q65KRZ3HD6773DX4YUGJR4DBSX.json","graph_json":"https://pith.science/api/pith-number/Q65KRZ3HD6773DX4YUGJR4DBSX/graph.json","events_json":"https://pith.science/api/pith-number/Q65KRZ3HD6773DX4YUGJR4DBSX/events.json","paper":"https://pith.science/paper/Q65KRZ3H"},"agent_actions":{"view_html":"https://pith.science/pith/Q65KRZ3HD6773DX4YUGJR4DBSX","download_json":"https://pith.science/pith/Q65KRZ3HD6773DX4YUGJR4DBSX.json","view_paper":"https://pith.science/paper/Q65KRZ3H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0303352&json=true","fetch_graph":"https://pith.science/api/pith-number/Q65KRZ3HD6773DX4YUGJR4DBSX/graph.json","fetch_events":"https://pith.science/api/pith-number/Q65KRZ3HD6773DX4YUGJR4DBSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q65KRZ3HD6773DX4YUGJR4DBSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q65KRZ3HD6773DX4YUGJR4DBSX/action/storage_attestation","attest_author":"https://pith.science/pith/Q65KRZ3HD6773DX4YUGJR4DBSX/action/author_attestation","sign_citation":"https://pith.science/pith/Q65KRZ3HD6773DX4YUGJR4DBSX/action/citation_signature","submit_replication":"https://pith.science/pith/Q65KRZ3HD6773DX4YUGJR4DBSX/action/replication_record"}},"created_at":"2026-07-04T14:37:10.788342+00:00","updated_at":"2026-07-04T14:37:10.788342+00:00"}