{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L2PPC2RWGBNV2GX6JZCTMFRDWY","short_pith_number":"pith:L2PPC2RW","canonical_record":{"source":{"id":"1207.1238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-05T12:25:06Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"9f40dc506691af1b55020b16a3d6124aa31ca880a8bb93ee6074e9d7179e2c50","abstract_canon_sha256":"2dd16b7781c1cc23bfaee4bd54dd7eee8183bbd5e969163e32c2d9ac1e067754"},"schema_version":"1.0"},"canonical_sha256":"5e9ef16a36305b5d1afe4e45361623b635c9c73038bd5c1b003ca83dc0e46723","source":{"kind":"arxiv","id":"1207.1238","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1238","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1238v1","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1238","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"L2PPC2RWGBNV","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"L2PPC2RWGBNV2GX6","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"L2PPC2RW","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L2PPC2RWGBNV2GX6JZCTMFRDWY","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-05T12:25:06Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"9f40dc506691af1b55020b16a3d6124aa31ca880a8bb93ee6074e9d7179e2c50","abstract_canon_sha256":"2dd16b7781c1cc23bfaee4bd54dd7eee8183bbd5e969163e32c2d9ac1e067754"},"schema_version":"1.0"},"canonical_sha256":"5e9ef16a36305b5d1afe4e45361623b635c9c73038bd5c1b003ca83dc0e46723","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:44.791328Z","signature_b64":"vXXlw7d/kBnTKYBSCS0LYHKv7GEJDvkhLdGZ6h3ikYL7PIVYj2ubdVoX+GxiX3rH7zeVHZLc698qnmHBT+BWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e9ef16a36305b5d1afe4e45361623b635c9c73038bd5c1b003ca83dc0e46723","last_reissued_at":"2026-05-18T03:03:44.790605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:44.790605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1238","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-05-18T03:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cRCDgWwqH3fBjtJLDGJPKlEkfAb520jLJo2zD5enqZvQxjyLNfs6M2QLhyHAk/pZVEl9H9QkDhWM7h2SVpNpCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:05:33.927770Z"},"content_sha256":"ba71c4459b4d791e11961d7638968bf71de239d6102425985276a3a40ce299a1","schema_version":"1.0","event_id":"sha256:ba71c4459b4d791e11961d7638968bf71de239d6102425985276a3a40ce299a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L2PPC2RWGBNV2GX6JZCTMFRDWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Hardness of Entropy Minimization and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ivan Stanojevi\\'c, Mladen Kova\\v{c}evi\\'c, Vojin \\v{S}enk","submitted_at":"2012-07-05T12:25:06Z","abstract_excerpt":"We investigate certain optimization problems for Shannon information measures, namely, minimization of joint and conditional entropies $H(X,Y)$, $H(X|Y)$, $H(Y|X)$, and maximization of mutual information $I(X;Y)$, over convex regions. When restricted to the so-called transportation polytopes (sets of distributions with fixed marginals), very simple proofs of NP-hardness are obtained for these problems because in that case they are all equivalent, and their connection to the well-known \\textsc{Subset sum} and \\textsc{Partition} problems is revealed. The computational intractability of the more "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1238","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"},"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-18T03:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJc7eN105T31sxgYISC5uQqL8wxc0Njxt8yQPMbUVgCSH8QRDmTSfz4AysOP6AsKoE/vUMR/FI/GTYgWMqrpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:05:33.928405Z"},"content_sha256":"8fa70f7a89b8f16449120e2da557af9a06f151bb47277ceed6a9f282baa28a99","schema_version":"1.0","event_id":"sha256:8fa70f7a89b8f16449120e2da557af9a06f151bb47277ceed6a9f282baa28a99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L2PPC2RWGBNV2GX6JZCTMFRDWY/bundle.json","state_url":"https://pith.science/pith/L2PPC2RWGBNV2GX6JZCTMFRDWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L2PPC2RWGBNV2GX6JZCTMFRDWY/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-05-27T08:05:33Z","links":{"resolver":"https://pith.science/pith/L2PPC2RWGBNV2GX6JZCTMFRDWY","bundle":"https://pith.science/pith/L2PPC2RWGBNV2GX6JZCTMFRDWY/bundle.json","state":"https://pith.science/pith/L2PPC2RWGBNV2GX6JZCTMFRDWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L2PPC2RWGBNV2GX6JZCTMFRDWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L2PPC2RWGBNV2GX6JZCTMFRDWY","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":"2dd16b7781c1cc23bfaee4bd54dd7eee8183bbd5e969163e32c2d9ac1e067754","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-05T12:25:06Z","title_canon_sha256":"9f40dc506691af1b55020b16a3d6124aa31ca880a8bb93ee6074e9d7179e2c50"},"schema_version":"1.0","source":{"id":"1207.1238","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1238","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1238v1","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1238","created_at":"2026-05-18T03:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"L2PPC2RWGBNV","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"L2PPC2RWGBNV2GX6","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"L2PPC2RW","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:8fa70f7a89b8f16449120e2da557af9a06f151bb47277ceed6a9f282baa28a99","target":"graph","created_at":"2026-05-18T03:03:44Z","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 investigate certain optimization problems for Shannon information measures, namely, minimization of joint and conditional entropies $H(X,Y)$, $H(X|Y)$, $H(Y|X)$, and maximization of mutual information $I(X;Y)$, over convex regions. When restricted to the so-called transportation polytopes (sets of distributions with fixed marginals), very simple proofs of NP-hardness are obtained for these problems because in that case they are all equivalent, and their connection to the well-known \\textsc{Subset sum} and \\textsc{Partition} problems is revealed. The computational intractability of the more ","authors_text":"Ivan Stanojevi\\'c, Mladen Kova\\v{c}evi\\'c, Vojin \\v{S}enk","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-05T12:25:06Z","title":"On the Hardness of Entropy Minimization and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1238","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:ba71c4459b4d791e11961d7638968bf71de239d6102425985276a3a40ce299a1","target":"record","created_at":"2026-05-18T03:03:44Z","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":"2dd16b7781c1cc23bfaee4bd54dd7eee8183bbd5e969163e32c2d9ac1e067754","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-05T12:25:06Z","title_canon_sha256":"9f40dc506691af1b55020b16a3d6124aa31ca880a8bb93ee6074e9d7179e2c50"},"schema_version":"1.0","source":{"id":"1207.1238","kind":"arxiv","version":1}},"canonical_sha256":"5e9ef16a36305b5d1afe4e45361623b635c9c73038bd5c1b003ca83dc0e46723","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e9ef16a36305b5d1afe4e45361623b635c9c73038bd5c1b003ca83dc0e46723","first_computed_at":"2026-05-18T03:03:44.790605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:44.790605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vXXlw7d/kBnTKYBSCS0LYHKv7GEJDvkhLdGZ6h3ikYL7PIVYj2ubdVoX+GxiX3rH7zeVHZLc698qnmHBT+BWBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:44.791328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1238","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba71c4459b4d791e11961d7638968bf71de239d6102425985276a3a40ce299a1","sha256:8fa70f7a89b8f16449120e2da557af9a06f151bb47277ceed6a9f282baa28a99"],"state_sha256":"3ac899817b5f21c62bfa4f5872069249cbeec8ea1f64bcf810a7bc78a96ea923"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J0mHaaiSHW02dnFNFCsTIpU3TGh4K/4xYsvnS3+8ign7j1wmzxcmopJNblbbIl31wWnwJJ9wcD++nyinoBRHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:05:33.931792Z","bundle_sha256":"a0784450555730caf9e5da062dad12d34ce70d950be767ca9c68936c0d996488"}}