{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:T2Z22PBJKUC4IWPXIND6RJ3U22","short_pith_number":"pith:T2Z22PBJ","schema_version":"1.0","canonical_sha256":"9eb3ad3c295505c459f74347e8a774d6b5dcf6b20c0ede873322747f4495b7ef","source":{"kind":"arxiv","id":"cs/0410002","version":1},"attestation_state":"computed","paper":{"title":"Shannon Information and Kolmogorov Complexity","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Paul Vitanyi (CWI, Peter Grunwald (CWI), University of Amsterdam)","submitted_at":"2004-10-01T16:54:45Z","abstract_excerpt":"We compare the elementary theories of Shannon information and Kolmogorov complexity, the extent to which they have a common purpose, and where they are fundamentally different. We discuss and relate the basic notions of both theories: Shannon entropy versus Kolmogorov complexity, the relation of both to universal coding, Shannon mutual information versus Kolmogorov (`algorithmic') mutual information, probabilistic sufficient statistic versus algorithmic sufficient statistic (related to lossy compression in the Shannon theory versus meaningful information in the Kolmogorov theory), and rate dis"},"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":"cs/0410002","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2004-10-01T16:54:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2b7d7270fa79bccca0e1d27e7e993408f5f52bac2d50041c4ecf6ce6c05c418c","abstract_canon_sha256":"9fe4237f7941a21846042819b0381d587168b15e3a6cf3d065fd2f918cafd1b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:20:35.887282Z","signature_b64":"3Mg7aDn/QpveggOPGgF1K3HfTnmc38a1++/KTtUZNa8sUd/65bx3PUk8pUlLm0wWgAQRoe0oBWAXW/SztRX3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eb3ad3c295505c459f74347e8a774d6b5dcf6b20c0ede873322747f4495b7ef","last_reissued_at":"2026-07-05T01:20:35.886830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:20:35.886830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shannon Information and Kolmogorov Complexity","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Paul Vitanyi (CWI, Peter Grunwald (CWI), University of Amsterdam)","submitted_at":"2004-10-01T16:54:45Z","abstract_excerpt":"We compare the elementary theories of Shannon information and Kolmogorov complexity, the extent to which they have a common purpose, and where they are fundamentally different. We discuss and relate the basic notions of both theories: Shannon entropy versus Kolmogorov complexity, the relation of both to universal coding, Shannon mutual information versus Kolmogorov (`algorithmic') mutual information, probabilistic sufficient statistic versus algorithmic sufficient statistic (related to lossy compression in the Shannon theory versus meaningful information in the Kolmogorov theory), and rate dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0410002","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0410002/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":"cs/0410002","created_at":"2026-07-05T01:20:35.886889+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0410002v1","created_at":"2026-07-05T01:20:35.886889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0410002","created_at":"2026-07-05T01:20:35.886889+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2Z22PBJKUC4","created_at":"2026-07-05T01:20:35.886889+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2Z22PBJKUC4IWPX","created_at":"2026-07-05T01:20:35.886889+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2Z22PBJ","created_at":"2026-07-05T01:20:35.886889+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23471","citing_title":"Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2511.01202","citing_title":"Forget BIT, It is All about TOKEN: Towards Semantic Information Theory for LLMs","ref_index":75,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05115","citing_title":"Manifold Steering Reveals the Shared Geometry of Neural Network Representation and Behavior","ref_index":218,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22","json":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22.json","graph_json":"https://pith.science/api/pith-number/T2Z22PBJKUC4IWPXIND6RJ3U22/graph.json","events_json":"https://pith.science/api/pith-number/T2Z22PBJKUC4IWPXIND6RJ3U22/events.json","paper":"https://pith.science/paper/T2Z22PBJ"},"agent_actions":{"view_html":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22","download_json":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22.json","view_paper":"https://pith.science/paper/T2Z22PBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0410002&json=true","fetch_graph":"https://pith.science/api/pith-number/T2Z22PBJKUC4IWPXIND6RJ3U22/graph.json","fetch_events":"https://pith.science/api/pith-number/T2Z22PBJKUC4IWPXIND6RJ3U22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/action/storage_attestation","attest_author":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/action/author_attestation","sign_citation":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/action/citation_signature","submit_replication":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/action/replication_record"}},"created_at":"2026-07-05T01:20:35.886889+00:00","updated_at":"2026-07-05T01:20:35.886889+00:00"}