{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ACNJS2VDH4MQITTSO425TUGEY5","short_pith_number":"pith:ACNJS2VD","canonical_record":{"source":{"id":"1302.1484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T19:28:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de1fefe343f54e904ac86101ac89a58f070d7f5ba5423f90d027181fde190ae7","abstract_canon_sha256":"d0ab9958031a920d78919db0296e936e2819565f420be245571c7bfcc1b41552"},"schema_version":"1.0"},"canonical_sha256":"009a996aa33f19044e727735d9d0c4c76f0bcc4967a0aab563f7b234a5c3364c","source":{"kind":"arxiv","id":"1302.1484","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1484","created_at":"2026-05-18T03:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1484v1","created_at":"2026-05-18T03:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1484","created_at":"2026-05-18T03:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"ACNJS2VDH4MQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ACNJS2VDH4MQITTS","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ACNJS2VD","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ACNJS2VDH4MQITTSO425TUGEY5","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T19:28:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de1fefe343f54e904ac86101ac89a58f070d7f5ba5423f90d027181fde190ae7","abstract_canon_sha256":"d0ab9958031a920d78919db0296e936e2819565f420be245571c7bfcc1b41552"},"schema_version":"1.0"},"canonical_sha256":"009a996aa33f19044e727735d9d0c4c76f0bcc4967a0aab563f7b234a5c3364c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:11.874386Z","signature_b64":"hJ47ArX4nSFSqXnoAR5AAGawcu353k06LmvNFhji28CBm7Zuc51fhzeIgcpwLv4aqDbnig+kOmkhGSBN8PYTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"009a996aa33f19044e727735d9d0c4c76f0bcc4967a0aab563f7b234a5c3364c","last_reissued_at":"2026-05-18T03:10:11.873462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:11.873462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1484","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:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xat3Ezo42o6bN9R9qUymI7TbzX+A4Dxu1BpI6WXvTBcEBLHssHoQkBYPhbTtwWNII9EIa4zJLBVgrEtNPVkFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:33:58.339410Z"},"content_sha256":"604119d023c9f35caed17dcdaf7b879487a16cbf2e6399213a31c93e67e940fe","schema_version":"1.0","event_id":"sha256:604119d023c9f35caed17dcdaf7b879487a16cbf2e6399213a31c93e67e940fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ACNJS2VDH4MQITTSO425TUGEY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analytical and Numerical Characterizations of Shannon Ordering for Discrete Memoryless Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cihan Tepedelenlioglu, Yuan Zhang","submitted_at":"2013-02-06T19:28:39Z","abstract_excerpt":"This paper studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion between certain DMCs. Furthermore, under general conditions, channel equivalence defined through Shannon ordering is shown to be the same as permutation of input and output symbols. The determination of channel inclusion is considered as a convex optimization problem, and the sparsity of the weights related to the representation of the worse DMC in terms of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1484","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:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OoMmdkrxhnWVGujEQqCdybJz8xC4UPlg4rOLXjIfsm/7QV22ktpXxSTMhqYjQrFDR8FH4vKk8wNrO6jA7XKnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:33:58.340018Z"},"content_sha256":"c8d7cf4ca77888a7ee35f021dabf7b407dc785d274cf9bb46490a9d1eaae0357","schema_version":"1.0","event_id":"sha256:c8d7cf4ca77888a7ee35f021dabf7b407dc785d274cf9bb46490a9d1eaae0357"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACNJS2VDH4MQITTSO425TUGEY5/bundle.json","state_url":"https://pith.science/pith/ACNJS2VDH4MQITTSO425TUGEY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACNJS2VDH4MQITTSO425TUGEY5/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-30T08:33:58Z","links":{"resolver":"https://pith.science/pith/ACNJS2VDH4MQITTSO425TUGEY5","bundle":"https://pith.science/pith/ACNJS2VDH4MQITTSO425TUGEY5/bundle.json","state":"https://pith.science/pith/ACNJS2VDH4MQITTSO425TUGEY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACNJS2VDH4MQITTSO425TUGEY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ACNJS2VDH4MQITTSO425TUGEY5","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":"d0ab9958031a920d78919db0296e936e2819565f420be245571c7bfcc1b41552","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T19:28:39Z","title_canon_sha256":"de1fefe343f54e904ac86101ac89a58f070d7f5ba5423f90d027181fde190ae7"},"schema_version":"1.0","source":{"id":"1302.1484","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1484","created_at":"2026-05-18T03:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1484v1","created_at":"2026-05-18T03:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1484","created_at":"2026-05-18T03:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"ACNJS2VDH4MQ","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ACNJS2VDH4MQITTS","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ACNJS2VD","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:c8d7cf4ca77888a7ee35f021dabf7b407dc785d274cf9bb46490a9d1eaae0357","target":"graph","created_at":"2026-05-18T03:10:11Z","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":"This paper studies several problems concerning channel inclusion, which is a partial ordering between discrete memoryless channels (DMCs) proposed by Shannon. Specifically, majorization-based conditions are derived for channel inclusion between certain DMCs. Furthermore, under general conditions, channel equivalence defined through Shannon ordering is shown to be the same as permutation of input and output symbols. The determination of channel inclusion is considered as a convex optimization problem, and the sparsity of the weights related to the representation of the worse DMC in terms of the","authors_text":"Cihan Tepedelenlioglu, Yuan Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T19:28:39Z","title":"Analytical and Numerical Characterizations of Shannon Ordering for Discrete Memoryless Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1484","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:604119d023c9f35caed17dcdaf7b879487a16cbf2e6399213a31c93e67e940fe","target":"record","created_at":"2026-05-18T03:10:11Z","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":"d0ab9958031a920d78919db0296e936e2819565f420be245571c7bfcc1b41552","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-06T19:28:39Z","title_canon_sha256":"de1fefe343f54e904ac86101ac89a58f070d7f5ba5423f90d027181fde190ae7"},"schema_version":"1.0","source":{"id":"1302.1484","kind":"arxiv","version":1}},"canonical_sha256":"009a996aa33f19044e727735d9d0c4c76f0bcc4967a0aab563f7b234a5c3364c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"009a996aa33f19044e727735d9d0c4c76f0bcc4967a0aab563f7b234a5c3364c","first_computed_at":"2026-05-18T03:10:11.873462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:11.873462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hJ47ArX4nSFSqXnoAR5AAGawcu353k06LmvNFhji28CBm7Zuc51fhzeIgcpwLv4aqDbnig+kOmkhGSBN8PYTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:11.874386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1484","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:604119d023c9f35caed17dcdaf7b879487a16cbf2e6399213a31c93e67e940fe","sha256:c8d7cf4ca77888a7ee35f021dabf7b407dc785d274cf9bb46490a9d1eaae0357"],"state_sha256":"8c9d4a3d6129605a4761de0a65ad48b534d0b4f5f3a46071830c9cffdfc9bd1e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/2Ex5+uMS/14ijBUiNBGltwoUhK+YFMm8ozp/Jxc0IcZou+NnisFaHBBY9/tAedArun0EuBPSNsfbmckLr13BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:33:58.343396Z","bundle_sha256":"a91ea54189807c96c5c04432405da570be07bde7a7122e9737e7bd981f760715"}}