{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SZ2NA76KN3ZTBHO4BFGOTU32QM","short_pith_number":"pith:SZ2NA76K","canonical_record":{"source":{"id":"1108.3832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-17T22:00:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"150b5e803d3dce7e97f3b3fa41a00506a05cff782586dff1c4e9e07e7d8181b9","abstract_canon_sha256":"fe27fbb172edf5ffa68b4301cbf666a48b53f6824a5d9acc641cd043f53d8049"},"schema_version":"1.0"},"canonical_sha256":"9674d07fca6ef3309ddc094ce9d37a8311151cf6444a503cea3d404230b151ab","source":{"kind":"arxiv","id":"1108.3832","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3832","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3832v1","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3832","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"pith_short_12","alias_value":"SZ2NA76KN3ZT","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SZ2NA76KN3ZTBHO4","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SZ2NA76K","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SZ2NA76KN3ZTBHO4BFGOTU32QM","target":"record","payload":{"canonical_record":{"source":{"id":"1108.3832","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-17T22:00:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"150b5e803d3dce7e97f3b3fa41a00506a05cff782586dff1c4e9e07e7d8181b9","abstract_canon_sha256":"fe27fbb172edf5ffa68b4301cbf666a48b53f6824a5d9acc641cd043f53d8049"},"schema_version":"1.0"},"canonical_sha256":"9674d07fca6ef3309ddc094ce9d37a8311151cf6444a503cea3d404230b151ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:37.135601Z","signature_b64":"LkRdXbKGZKcpDPjmmlsSKKsJw8bjmMoLh0n8snLIm92qoaYG2Q39RXUF6OK+N7bLVkhB8G4fGu57qUv+fIqfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9674d07fca6ef3309ddc094ce9d37a8311151cf6444a503cea3d404230b151ab","last_reissued_at":"2026-05-18T02:21:37.135177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:37.135177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.3832","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-18T02:21:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xSpqVTIJWh/buIwPC98TlLfpaDbU3qVjKS75W7O0OfIFtHIRy05Xndj/6e7ORcxrSX/YsE4GMutgAiSPpKjOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:41:52.828176Z"},"content_sha256":"2a05a33cd5ad42b205926ddc98f91b2cdcbe1a7428e2410b42b00d24c9b1948e","schema_version":"1.0","event_id":"sha256:2a05a33cd5ad42b205926ddc98f91b2cdcbe1a7428e2410b42b00d24c9b1948e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SZ2NA76KN3ZTBHO4BFGOTU32QM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coding in the Presence of Semantic Value of Information: Unequal Error Protection Using Poset Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Laura Rifo, Luciano Panek, Marcelo Firer","submitted_at":"2011-08-17T22:00:25Z","abstract_excerpt":"In this work we explore possibilities for coding when information worlds have different (semantic) values. We introduce a loss function that expresses the overall performance of a coding scheme for discrete channels and exchange the usual goal of minimizing the error probability to that of minimizing the expected loss. In this environment we explore the possibilities of using poset-decoders to make a message-wise unequal error protection (UEP), where the most valuable information is protected by placing in its proximity information words that differ by small valued information. Similar definit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3832","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-18T02:21:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7X/GIucJbSHWNuybks4wdJR5nXV0rAPMeFf/JPq8EJa5+ELe7XgvqkyTllwrBFQj26LPTUzisLEdd8KvQyVfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T20:41:52.828526Z"},"content_sha256":"33c12c2921e3db980a2ff0c4b5be333ee6b08a0662dbba87ba7c77a11721ce9f","schema_version":"1.0","event_id":"sha256:33c12c2921e3db980a2ff0c4b5be333ee6b08a0662dbba87ba7c77a11721ce9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZ2NA76KN3ZTBHO4BFGOTU32QM/bundle.json","state_url":"https://pith.science/pith/SZ2NA76KN3ZTBHO4BFGOTU32QM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZ2NA76KN3ZTBHO4BFGOTU32QM/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-20T20:41:52Z","links":{"resolver":"https://pith.science/pith/SZ2NA76KN3ZTBHO4BFGOTU32QM","bundle":"https://pith.science/pith/SZ2NA76KN3ZTBHO4BFGOTU32QM/bundle.json","state":"https://pith.science/pith/SZ2NA76KN3ZTBHO4BFGOTU32QM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZ2NA76KN3ZTBHO4BFGOTU32QM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SZ2NA76KN3ZTBHO4BFGOTU32QM","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":"fe27fbb172edf5ffa68b4301cbf666a48b53f6824a5d9acc641cd043f53d8049","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-17T22:00:25Z","title_canon_sha256":"150b5e803d3dce7e97f3b3fa41a00506a05cff782586dff1c4e9e07e7d8181b9"},"schema_version":"1.0","source":{"id":"1108.3832","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3832","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3832v1","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3832","created_at":"2026-05-18T02:21:37Z"},{"alias_kind":"pith_short_12","alias_value":"SZ2NA76KN3ZT","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SZ2NA76KN3ZTBHO4","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SZ2NA76K","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:33c12c2921e3db980a2ff0c4b5be333ee6b08a0662dbba87ba7c77a11721ce9f","target":"graph","created_at":"2026-05-18T02:21:37Z","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":"In this work we explore possibilities for coding when information worlds have different (semantic) values. We introduce a loss function that expresses the overall performance of a coding scheme for discrete channels and exchange the usual goal of minimizing the error probability to that of minimizing the expected loss. In this environment we explore the possibilities of using poset-decoders to make a message-wise unequal error protection (UEP), where the most valuable information is protected by placing in its proximity information words that differ by small valued information. Similar definit","authors_text":"Laura Rifo, Luciano Panek, Marcelo Firer","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-17T22:00:25Z","title":"Coding in the Presence of Semantic Value of Information: Unequal Error Protection Using Poset Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3832","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:2a05a33cd5ad42b205926ddc98f91b2cdcbe1a7428e2410b42b00d24c9b1948e","target":"record","created_at":"2026-05-18T02:21:37Z","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":"fe27fbb172edf5ffa68b4301cbf666a48b53f6824a5d9acc641cd043f53d8049","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-17T22:00:25Z","title_canon_sha256":"150b5e803d3dce7e97f3b3fa41a00506a05cff782586dff1c4e9e07e7d8181b9"},"schema_version":"1.0","source":{"id":"1108.3832","kind":"arxiv","version":1}},"canonical_sha256":"9674d07fca6ef3309ddc094ce9d37a8311151cf6444a503cea3d404230b151ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9674d07fca6ef3309ddc094ce9d37a8311151cf6444a503cea3d404230b151ab","first_computed_at":"2026-05-18T02:21:37.135177Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:37.135177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LkRdXbKGZKcpDPjmmlsSKKsJw8bjmMoLh0n8snLIm92qoaYG2Q39RXUF6OK+N7bLVkhB8G4fGu57qUv+fIqfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:37.135601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3832","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a05a33cd5ad42b205926ddc98f91b2cdcbe1a7428e2410b42b00d24c9b1948e","sha256:33c12c2921e3db980a2ff0c4b5be333ee6b08a0662dbba87ba7c77a11721ce9f"],"state_sha256":"2b58bfd383b11028caed3b0f26a17baeed33ca475c1800eb9d7b42c4c74c51e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEWNE2lgh1ZUqdae6y7Od2EotLHDXOCXLOQdj9kDlaB3+vD2+m3xbN6ML/npSWnv9WqrvcxHopoLcYp/NjW0DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T20:41:52.830440Z","bundle_sha256":"cd01133777413f8645ab6b13909c2f0a02c54bb69e9192624df2c1890083b470"}}