{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7NNPBBPFUWNJGF73NCKPPUMXRJ","short_pith_number":"pith:7NNPBBPF","schema_version":"1.0","canonical_sha256":"fb5af085e5a59a9317fb6894f7d1978a45f6e4d576c5cbadb663a772108a2139","source":{"kind":"arxiv","id":"1206.5184","version":1},"attestation_state":"computed","paper":{"title":"Symmetry of Information: A Closer Look","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marius Zimand","submitted_at":"2012-06-22T15:50:57Z","abstract_excerpt":"Symmetry of information establishes a relation between the information that x has about y (denoted I(x : y)) and the information that y has about x (denoted I(y : x)). In classical information theory, the two are exactly equal, but in algorithmical information theory, there is a small excess quantity of information that differentiates the two terms, caused by the necessity of packaging information in a way that makes it accessible to algorithms. It was shown in [Zim11] that in the case of strings with simple complexity (that is the Kolmogorov complexity of their Kolmogorov complexity is small)"},"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":"1206.5184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-22T15:50:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"32a5cf97ac55fb895cb067048dff50b15dc256e23c5d85d299b6a91d6db7a09f","abstract_canon_sha256":"f9f191f567edd083b9dcce70c7af5714c388a26f4069a9c926cc7fac1769eae9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:51.983307Z","signature_b64":"WNrBFAFkbYcO/g08qSP9Tgl9Go3tpAgLs6lQZbuDI/NOxIysE9gHWuxqE1qyCwU0rmp75rAfvkufrmO1pgYPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb5af085e5a59a9317fb6894f7d1978a45f6e4d576c5cbadb663a772108a2139","last_reissued_at":"2026-05-18T03:52:51.982509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:51.982509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetry of Information: A Closer Look","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Marius Zimand","submitted_at":"2012-06-22T15:50:57Z","abstract_excerpt":"Symmetry of information establishes a relation between the information that x has about y (denoted I(x : y)) and the information that y has about x (denoted I(y : x)). In classical information theory, the two are exactly equal, but in algorithmical information theory, there is a small excess quantity of information that differentiates the two terms, caused by the necessity of packaging information in a way that makes it accessible to algorithms. It was shown in [Zim11] that in the case of strings with simple complexity (that is the Kolmogorov complexity of their Kolmogorov complexity is small)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5184","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.5184","created_at":"2026-05-18T03:52:51.982627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5184v1","created_at":"2026-05-18T03:52:51.982627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5184","created_at":"2026-05-18T03:52:51.982627+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NNPBBPFUWNJ","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NNPBBPFUWNJGF73","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NNPBBPF","created_at":"2026-05-18T12:26:58.693483+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/7NNPBBPFUWNJGF73NCKPPUMXRJ","json":"https://pith.science/pith/7NNPBBPFUWNJGF73NCKPPUMXRJ.json","graph_json":"https://pith.science/api/pith-number/7NNPBBPFUWNJGF73NCKPPUMXRJ/graph.json","events_json":"https://pith.science/api/pith-number/7NNPBBPFUWNJGF73NCKPPUMXRJ/events.json","paper":"https://pith.science/paper/7NNPBBPF"},"agent_actions":{"view_html":"https://pith.science/pith/7NNPBBPFUWNJGF73NCKPPUMXRJ","download_json":"https://pith.science/pith/7NNPBBPFUWNJGF73NCKPPUMXRJ.json","view_paper":"https://pith.science/paper/7NNPBBPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5184&json=true","fetch_graph":"https://pith.science/api/pith-number/7NNPBBPFUWNJGF73NCKPPUMXRJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7NNPBBPFUWNJGF73NCKPPUMXRJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NNPBBPFUWNJGF73NCKPPUMXRJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NNPBBPFUWNJGF73NCKPPUMXRJ/action/storage_attestation","attest_author":"https://pith.science/pith/7NNPBBPFUWNJGF73NCKPPUMXRJ/action/author_attestation","sign_citation":"https://pith.science/pith/7NNPBBPFUWNJGF73NCKPPUMXRJ/action/citation_signature","submit_replication":"https://pith.science/pith/7NNPBBPFUWNJGF73NCKPPUMXRJ/action/replication_record"}},"created_at":"2026-05-18T03:52:51.982627+00:00","updated_at":"2026-05-18T03:52:51.982627+00:00"}