{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RGJHMQWYUSRWRT5XOHN5PCCLMF","short_pith_number":"pith:RGJHMQWY","canonical_record":{"source":{"id":"1304.6969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-25T17:41:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e38fba57f94ce927e904ade3fb576de6b8812b8a286aaff26d8ad3d563ed853b","abstract_canon_sha256":"8798f3c70d85b5bd920c9ea7d97f51ab596da234910bf9bf89637bfe0885156d"},"schema_version":"1.0"},"canonical_sha256":"89927642d8a4a368cfb771dbd7884b616676160c40ef74a8f1cd9a9af1e1a331","source":{"kind":"arxiv","id":"1304.6969","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6969","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6969v1","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6969","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"RGJHMQWYUSRW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RGJHMQWYUSRWRT5X","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RGJHMQWY","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RGJHMQWYUSRWRT5XOHN5PCCLMF","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-25T17:41:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e38fba57f94ce927e904ade3fb576de6b8812b8a286aaff26d8ad3d563ed853b","abstract_canon_sha256":"8798f3c70d85b5bd920c9ea7d97f51ab596da234910bf9bf89637bfe0885156d"},"schema_version":"1.0"},"canonical_sha256":"89927642d8a4a368cfb771dbd7884b616676160c40ef74a8f1cd9a9af1e1a331","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:10.701543Z","signature_b64":"kWV4V52z+SMZLSe63VFwqrhudD9tzC5b2PtUABh4teCs0Suqme7DHusqnxxDW7D0w5Wblj7jHAEZ+J2q40xTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89927642d8a4a368cfb771dbd7884b616676160c40ef74a8f1cd9a9af1e1a331","last_reissued_at":"2026-05-18T03:27:10.700716Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:10.700716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6969","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:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ke9TSuzNSY4TsJ+eGBpQiGOIdWw1nKFd7mCUDNEw+fsx7A4UhCXC/dNlSYmBoZ7hw1ynrBoZc+AnnJi4nzqVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:54:09.795207Z"},"content_sha256":"b5d01fc6f5ec1a7f4a4a7c0613fc77c066566e3329125fc4bacd26425dca8941","schema_version":"1.0","event_id":"sha256:b5d01fc6f5ec1a7f4a4a7c0613fc77c066566e3329125fc4bacd26425dca8941"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RGJHMQWYUSRWRT5XOHN5PCCLMF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Deterministic Annealing Approach to Optimization of Zero-delay Source-Channel Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emrah Akyol, Kenneth Rose, Mustafa S. Mehmetoglu","submitted_at":"2013-04-25T17:41:19Z","abstract_excerpt":"This paper studies optimization of zero-delay source-channel codes, and specifically the problem of obtaining globally optimal transformations that map between the source space and the channel space, under a given transmission power constraint and for the mean square error distortion. Particularly, we focus on the setting where the decoder has access to side information, whose cost surface is known to be riddled with local minima. Prior work derived the necessary conditions for optimality of the encoder and decoder mappings, along with a greedy optimization algorithm that imposes these conditi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6969","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:27:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FqGmwE3WUSdAnzzhAKYQYecIfCApTGteWbzoa9Zci9Dy12ZJvBnBJWUgtTKUtVWfseJoI5ICmLedA1B5NSgCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:54:09.795889Z"},"content_sha256":"632a698f447b61f19a82bbc7e02e2efdd960127e205cc8efb04c667889c3ba61","schema_version":"1.0","event_id":"sha256:632a698f447b61f19a82bbc7e02e2efdd960127e205cc8efb04c667889c3ba61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGJHMQWYUSRWRT5XOHN5PCCLMF/bundle.json","state_url":"https://pith.science/pith/RGJHMQWYUSRWRT5XOHN5PCCLMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGJHMQWYUSRWRT5XOHN5PCCLMF/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-09T08:54:09Z","links":{"resolver":"https://pith.science/pith/RGJHMQWYUSRWRT5XOHN5PCCLMF","bundle":"https://pith.science/pith/RGJHMQWYUSRWRT5XOHN5PCCLMF/bundle.json","state":"https://pith.science/pith/RGJHMQWYUSRWRT5XOHN5PCCLMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGJHMQWYUSRWRT5XOHN5PCCLMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RGJHMQWYUSRWRT5XOHN5PCCLMF","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":"8798f3c70d85b5bd920c9ea7d97f51ab596da234910bf9bf89637bfe0885156d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-25T17:41:19Z","title_canon_sha256":"e38fba57f94ce927e904ade3fb576de6b8812b8a286aaff26d8ad3d563ed853b"},"schema_version":"1.0","source":{"id":"1304.6969","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6969","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6969v1","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6969","created_at":"2026-05-18T03:27:10Z"},{"alias_kind":"pith_short_12","alias_value":"RGJHMQWYUSRW","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RGJHMQWYUSRWRT5X","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RGJHMQWY","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:632a698f447b61f19a82bbc7e02e2efdd960127e205cc8efb04c667889c3ba61","target":"graph","created_at":"2026-05-18T03:27:10Z","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 optimization of zero-delay source-channel codes, and specifically the problem of obtaining globally optimal transformations that map between the source space and the channel space, under a given transmission power constraint and for the mean square error distortion. Particularly, we focus on the setting where the decoder has access to side information, whose cost surface is known to be riddled with local minima. Prior work derived the necessary conditions for optimality of the encoder and decoder mappings, along with a greedy optimization algorithm that imposes these conditi","authors_text":"Emrah Akyol, Kenneth Rose, Mustafa S. Mehmetoglu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-25T17:41:19Z","title":"A Deterministic Annealing Approach to Optimization of Zero-delay Source-Channel Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6969","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:b5d01fc6f5ec1a7f4a4a7c0613fc77c066566e3329125fc4bacd26425dca8941","target":"record","created_at":"2026-05-18T03:27:10Z","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":"8798f3c70d85b5bd920c9ea7d97f51ab596da234910bf9bf89637bfe0885156d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-25T17:41:19Z","title_canon_sha256":"e38fba57f94ce927e904ade3fb576de6b8812b8a286aaff26d8ad3d563ed853b"},"schema_version":"1.0","source":{"id":"1304.6969","kind":"arxiv","version":1}},"canonical_sha256":"89927642d8a4a368cfb771dbd7884b616676160c40ef74a8f1cd9a9af1e1a331","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89927642d8a4a368cfb771dbd7884b616676160c40ef74a8f1cd9a9af1e1a331","first_computed_at":"2026-05-18T03:27:10.700716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:10.700716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kWV4V52z+SMZLSe63VFwqrhudD9tzC5b2PtUABh4teCs0Suqme7DHusqnxxDW7D0w5Wblj7jHAEZ+J2q40xTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:10.701543Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6969","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5d01fc6f5ec1a7f4a4a7c0613fc77c066566e3329125fc4bacd26425dca8941","sha256:632a698f447b61f19a82bbc7e02e2efdd960127e205cc8efb04c667889c3ba61"],"state_sha256":"c8dabc190fed4b04c6aa1b11c4e40a0dc3a9e0a13b69290b7be3e67b44a7cadc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+8AVn2qaj88MQKx3m9W48RlRF6XBx0fbBLtfAaQIne9tAfKaJabuawDl9Xu+aswE0oU/q7nw0JKB9ghX5yRlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:54:09.800266Z","bundle_sha256":"e6dfbf4705fb740649a7eeb4f3428e9735de7f9dee1d7b744798f62627382024"}}