{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:P62XTCYPMPQ7JT6KZRZ6Q6U4PZ","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":"28a8e1b59d1e0c52ba6fa583f40b503ede0d4bafb1e10e32f1a363c534168bcb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-08T16:54:51Z","title_canon_sha256":"75dc107df0adba229e64cbdedb47376d30eb6e2b4180944b835bb5fc3b987b81"},"schema_version":"1.0","source":{"id":"1602.02648","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02648","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02648v2","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02648","created_at":"2026-05-18T01:15:57Z"},{"alias_kind":"pith_short_12","alias_value":"P62XTCYPMPQ7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"P62XTCYPMPQ7JT6K","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"P62XTCYP","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:46f6951da33e3721ea349ece7b428e6e0a39d8d758b1edf12d55e7efb7cc7dc4","target":"graph","created_at":"2026-05-18T01:15:57Z","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":"Many statements from the classic information theory (the theory of Shannon's entropy) have natural counterparts in the algorithmic information theory (in the framework of Kolmogorov complexity). In this paper we discuss one simple instance of the parallelism between Shannon's and Kolmogorov's theories: we prove in the setting of Kolmogorov complexity a version of Wolf's characterization of admissible rates for the fork network.","authors_text":"Andrei Romashchenko","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-08T16:54:51Z","title":"Coding in the fork network in the framework of Kolmogorov complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02648","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:b68ada1f026c640a3d5dc82380aaaf3ea168b2ae56a66ebabda85bb005444954","target":"record","created_at":"2026-05-18T01:15:57Z","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":"28a8e1b59d1e0c52ba6fa583f40b503ede0d4bafb1e10e32f1a363c534168bcb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-08T16:54:51Z","title_canon_sha256":"75dc107df0adba229e64cbdedb47376d30eb6e2b4180944b835bb5fc3b987b81"},"schema_version":"1.0","source":{"id":"1602.02648","kind":"arxiv","version":2}},"canonical_sha256":"7fb5798b0f63e1f4cfcacc73e87a9c7e78b179b8cf165e12c79d086d7a8d1544","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fb5798b0f63e1f4cfcacc73e87a9c7e78b179b8cf165e12c79d086d7a8d1544","first_computed_at":"2026-05-18T01:15:57.578374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:57.578374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k9uWrYxhvPr53SJNUNtW1kv47vMglzm2+Z62ARtUHu0lWbvUl2JPtA58eMXVcZmn1JssrlB1gkRxG7NEW/nXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:57.578989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02648","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b68ada1f026c640a3d5dc82380aaaf3ea168b2ae56a66ebabda85bb005444954","sha256:46f6951da33e3721ea349ece7b428e6e0a39d8d758b1edf12d55e7efb7cc7dc4"],"state_sha256":"33c00e0c5871da143d716f93f537fa4531ab891a9f0786c51eaad9659dd2e627"}