{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:T2Z22PBJKUC4IWPXIND6RJ3U22","short_pith_number":"pith:T2Z22PBJ","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"},"canonical_sha256":"9eb3ad3c295505c459f74347e8a774d6b5dcf6b20c0ede873322747f4495b7ef","source":{"kind":"arxiv","id":"cs/0410002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0410002","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0410002v1","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0410002","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"pith_short_12","alias_value":"T2Z22PBJKUC4","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"pith_short_16","alias_value":"T2Z22PBJKUC4IWPX","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"pith_short_8","alias_value":"T2Z22PBJ","created_at":"2026-07-05T01:20:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:T2Z22PBJKUC4IWPXIND6RJ3U22","target":"record","payload":{"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"},"canonical_sha256":"9eb3ad3c295505c459f74347e8a774d6b5dcf6b20c0ede873322747f4495b7ef","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"},"source_kind":"arxiv","source_id":"cs/0410002","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-07-05T01:20:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57RFC/kjYANsGgxS34HLF3n8iM/YDVddK6KL2KVuvntANAYCb5kRgbmg0ILM/wyZLBT1VHqyIv5aKbv+AjjOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:13:37.547925Z"},"content_sha256":"ce9b2784413b5914ecba7bf259043db8fd8c4ba42d092ba022e5ddfb0d22e2d2","schema_version":"1.0","event_id":"sha256:ce9b2784413b5914ecba7bf259043db8fd8c4ba42d092ba022e5ddfb0d22e2d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:T2Z22PBJKUC4IWPXIND6RJ3U22","target":"graph","payload":{"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"},"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-07-05T01:20:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cXZuiBK1XkG+mPSmHRASyH05VHN2YtNQByDbN/i25XbJv309Fc6GYPkT9A4ZOYaqx5EpBtL0JZhwOHy8QSSPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T11:13:37.552195Z"},"content_sha256":"3a9eb9a116027a7636474079d47bdf1b3282c132484c065970f3f10be8c64ca4","schema_version":"1.0","event_id":"sha256:3a9eb9a116027a7636474079d47bdf1b3282c132484c065970f3f10be8c64ca4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/bundle.json","state_url":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/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-08-04T11:13:37Z","links":{"resolver":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22","bundle":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/bundle.json","state":"https://pith.science/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2Z22PBJKUC4IWPXIND6RJ3U22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:T2Z22PBJKUC4IWPXIND6RJ3U22","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":"9fe4237f7941a21846042819b0381d587168b15e3a6cf3d065fd2f918cafd1b6","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2004-10-01T16:54:45Z","title_canon_sha256":"2b7d7270fa79bccca0e1d27e7e993408f5f52bac2d50041c4ecf6ce6c05c418c"},"schema_version":"1.0","source":{"id":"cs/0410002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0410002","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0410002v1","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0410002","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"pith_short_12","alias_value":"T2Z22PBJKUC4","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"pith_short_16","alias_value":"T2Z22PBJKUC4IWPX","created_at":"2026-07-05T01:20:35Z"},{"alias_kind":"pith_short_8","alias_value":"T2Z22PBJ","created_at":"2026-07-05T01:20:35Z"}],"graph_snapshots":[{"event_id":"sha256:3a9eb9a116027a7636474079d47bdf1b3282c132484c065970f3f10be8c64ca4","target":"graph","created_at":"2026-07-05T01:20:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0410002/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Paul Vitanyi (CWI, Peter Grunwald (CWI), University of Amsterdam)","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2004-10-01T16:54:45Z","title":"Shannon Information and Kolmogorov Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0410002","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:ce9b2784413b5914ecba7bf259043db8fd8c4ba42d092ba022e5ddfb0d22e2d2","target":"record","created_at":"2026-07-05T01:20:35Z","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":"9fe4237f7941a21846042819b0381d587168b15e3a6cf3d065fd2f918cafd1b6","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2004-10-01T16:54:45Z","title_canon_sha256":"2b7d7270fa79bccca0e1d27e7e993408f5f52bac2d50041c4ecf6ce6c05c418c"},"schema_version":"1.0","source":{"id":"cs/0410002","kind":"arxiv","version":1}},"canonical_sha256":"9eb3ad3c295505c459f74347e8a774d6b5dcf6b20c0ede873322747f4495b7ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eb3ad3c295505c459f74347e8a774d6b5dcf6b20c0ede873322747f4495b7ef","first_computed_at":"2026-07-05T01:20:35.886830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:20:35.886830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Mg7aDn/QpveggOPGgF1K3HfTnmc38a1++/KTtUZNa8sUd/65bx3PUk8pUlLm0wWgAQRoe0oBWAXW/SztRX3Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:20:35.887282Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0410002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce9b2784413b5914ecba7bf259043db8fd8c4ba42d092ba022e5ddfb0d22e2d2","sha256:3a9eb9a116027a7636474079d47bdf1b3282c132484c065970f3f10be8c64ca4"],"state_sha256":"4f016cfb9953a475b684319020ead80c000a140cf5c402124302007fd632aeca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VItWu48kRCedQRnTFdBMlH+UfIHqp/C/fyYZc0hQ3tuSXWIO10jD8ucVOGXXuFJ5eW8Wl7FIBU+EhwYtTqFAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T11:13:37.557756Z","bundle_sha256":"41e6dd2591127a0f5d49186f8966794f134cc09a61c59365214c7afdaf00f8ee"}}