{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TAEP4TPUIZNVVUDMJ7XEEWMB7T","short_pith_number":"pith:TAEP4TPU","canonical_record":{"source":{"id":"1901.07476","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T17:17:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"451031a0e5d345efb383e482233b80eaab74cd3586adae1e4ba9e3450f24ca0e","abstract_canon_sha256":"07f8d79752ef0a704f7a87d7624c1ee21133f573e63cb0524a33de2a86257b08"},"schema_version":"1.0"},"canonical_sha256":"9808fe4df4465b5ad06c4fee425981fcdfa92779f7973e9e5d52a10932123ba9","source":{"kind":"arxiv","id":"1901.07476","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07476","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07476v3","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07476","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"TAEP4TPUIZNV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TAEP4TPUIZNVVUDM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TAEP4TPU","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TAEP4TPUIZNVVUDMJ7XEEWMB7T","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07476","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T17:17:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"451031a0e5d345efb383e482233b80eaab74cd3586adae1e4ba9e3450f24ca0e","abstract_canon_sha256":"07f8d79752ef0a704f7a87d7624c1ee21133f573e63cb0524a33de2a86257b08"},"schema_version":"1.0"},"canonical_sha256":"9808fe4df4465b5ad06c4fee425981fcdfa92779f7973e9e5d52a10932123ba9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:36.655836Z","signature_b64":"ogvF/eu8HWWO0IYrM4AzYLW1WQOsMXx33u9pBPw5smRrvD2qzyzZJaShNXyjH28QZTlkUTz4n/5uLrBCZjcFAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9808fe4df4465b5ad06c4fee425981fcdfa92779f7973e9e5d52a10932123ba9","last_reissued_at":"2026-05-17T23:41:36.655226Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:36.655226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07476","source_version":3,"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-05-17T23:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ikWKQLo6K04VK9Ju+SuY/oumdVUdotUS+NrpwQuC2678n7oH4YsEv4b5SVCnjDVhgxJfYb8mxjiQGKgugDfQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:30:54.509018Z"},"content_sha256":"8ad637b28313205f73416667b9a271c12dd0466f8fdd7cd9e998165b6c3034f7","schema_version":"1.0","event_id":"sha256:8ad637b28313205f73416667b9a271c12dd0466f8fdd7cd9e998165b6c3034f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TAEP4TPUIZNVVUDMJ7XEEWMB7T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrei Romashchenko, Emirhan G\\\"urp{\\i}nar","submitted_at":"2019-01-22T17:17:54Z","abstract_excerpt":"We discuss linear programming techniques that help to deduce corollaries of non classic inequalities for Shannon's entropy. We focus on direct applications of the copy lemma. These applications involve implicitly some (known or unknown) non-classic universal inequalities for Shannon's entropy, though we do not derive these inequalities explicitly. To reduce the computational complexity of these problems, we extensively use symmetry considerations. We present two examples of usage of these techniques: we provide a reduced size formal inference of the best known bound for the Ingleton score (ori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07476","kind":"arxiv","version":3},"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"},"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-05-17T23:41:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDToCgphiMPg1YCmsJ1y1Eq61csj8vI3tujpw8qYA0Z1C1i+wQ+dksmhHsca+KrU4mT41IRckpdMXviKyH9wAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:30:54.509378Z"},"content_sha256":"7ed12ef9406f1a512aaec983074ff7493718ed79eeafe2d211d4b3cee9da1f81","schema_version":"1.0","event_id":"sha256:7ed12ef9406f1a512aaec983074ff7493718ed79eeafe2d211d4b3cee9da1f81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TAEP4TPUIZNVVUDMJ7XEEWMB7T/bundle.json","state_url":"https://pith.science/pith/TAEP4TPUIZNVVUDMJ7XEEWMB7T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TAEP4TPUIZNVVUDMJ7XEEWMB7T/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-06-20T07:30:54Z","links":{"resolver":"https://pith.science/pith/TAEP4TPUIZNVVUDMJ7XEEWMB7T","bundle":"https://pith.science/pith/TAEP4TPUIZNVVUDMJ7XEEWMB7T/bundle.json","state":"https://pith.science/pith/TAEP4TPUIZNVVUDMJ7XEEWMB7T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TAEP4TPUIZNVVUDMJ7XEEWMB7T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TAEP4TPUIZNVVUDMJ7XEEWMB7T","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":"07f8d79752ef0a704f7a87d7624c1ee21133f573e63cb0524a33de2a86257b08","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T17:17:54Z","title_canon_sha256":"451031a0e5d345efb383e482233b80eaab74cd3586adae1e4ba9e3450f24ca0e"},"schema_version":"1.0","source":{"id":"1901.07476","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07476","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07476v3","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07476","created_at":"2026-05-17T23:41:36Z"},{"alias_kind":"pith_short_12","alias_value":"TAEP4TPUIZNV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TAEP4TPUIZNVVUDM","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TAEP4TPU","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:7ed12ef9406f1a512aaec983074ff7493718ed79eeafe2d211d4b3cee9da1f81","target":"graph","created_at":"2026-05-17T23:41:36Z","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":"We discuss linear programming techniques that help to deduce corollaries of non classic inequalities for Shannon's entropy. We focus on direct applications of the copy lemma. These applications involve implicitly some (known or unknown) non-classic universal inequalities for Shannon's entropy, though we do not derive these inequalities explicitly. To reduce the computational complexity of these problems, we extensively use symmetry considerations. We present two examples of usage of these techniques: we provide a reduced size formal inference of the best known bound for the Ingleton score (ori","authors_text":"Andrei Romashchenko, Emirhan G\\\"urp{\\i}nar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T17:17:54Z","title":"How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07476","kind":"arxiv","version":3},"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:8ad637b28313205f73416667b9a271c12dd0466f8fdd7cd9e998165b6c3034f7","target":"record","created_at":"2026-05-17T23:41:36Z","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":"07f8d79752ef0a704f7a87d7624c1ee21133f573e63cb0524a33de2a86257b08","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T17:17:54Z","title_canon_sha256":"451031a0e5d345efb383e482233b80eaab74cd3586adae1e4ba9e3450f24ca0e"},"schema_version":"1.0","source":{"id":"1901.07476","kind":"arxiv","version":3}},"canonical_sha256":"9808fe4df4465b5ad06c4fee425981fcdfa92779f7973e9e5d52a10932123ba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9808fe4df4465b5ad06c4fee425981fcdfa92779f7973e9e5d52a10932123ba9","first_computed_at":"2026-05-17T23:41:36.655226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:36.655226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ogvF/eu8HWWO0IYrM4AzYLW1WQOsMXx33u9pBPw5smRrvD2qzyzZJaShNXyjH28QZTlkUTz4n/5uLrBCZjcFAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:36.655836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07476","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ad637b28313205f73416667b9a271c12dd0466f8fdd7cd9e998165b6c3034f7","sha256:7ed12ef9406f1a512aaec983074ff7493718ed79eeafe2d211d4b3cee9da1f81"],"state_sha256":"853e95b799e10016e4b475138cc9ea13582cfc52930c637a2aa1e266881f9b6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hacKpxGPBbKMVgRvnVObTMYBFSrhTaAKMO2TGoEC2CReRab8gSeQ0+YR4gQers2iJoUgO30SuqMz5tvYVgE6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:30:54.511350Z","bundle_sha256":"73bf7b134d4bdf31b172bb60d4f985c2d3b1282ea57a80efad13bbaa8f457f85"}}