{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TE3QTLBSN5PGKHY2XKYAMYIMDX","short_pith_number":"pith:TE3QTLBS","canonical_record":{"source":{"id":"1312.0685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-03T02:56:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6a10f9bf2a471b5db41cb4f6766bfbe0769f39b4cc26342305593fac812a1bc","abstract_canon_sha256":"cf2dba7faf98839fe40610b9e17786cf950afcc6619a3de32bb493139353499e"},"schema_version":"1.0"},"canonical_sha256":"993709ac326f5e651f1abab006610c1df6502828c85f286b3cd4bbe4da9824f5","source":{"kind":"arxiv","id":"1312.0685","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0685","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0685v1","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0685","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"TE3QTLBSN5PG","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TE3QTLBSN5PGKHY2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TE3QTLBS","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TE3QTLBSN5PGKHY2XKYAMYIMDX","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-03T02:56:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b6a10f9bf2a471b5db41cb4f6766bfbe0769f39b4cc26342305593fac812a1bc","abstract_canon_sha256":"cf2dba7faf98839fe40610b9e17786cf950afcc6619a3de32bb493139353499e"},"schema_version":"1.0"},"canonical_sha256":"993709ac326f5e651f1abab006610c1df6502828c85f286b3cd4bbe4da9824f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:36.980386Z","signature_b64":"GBwuolzeicEtTf5p/sAgt4xEKcmkQSnMn8OkOHFT8llhO234wn/QNVo+ptBbGiyAauuuEtPC9mSrOJkjFW2yDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"993709ac326f5e651f1abab006610c1df6502828c85f286b3cd4bbe4da9824f5","last_reissued_at":"2026-05-18T03:05:36.979717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:36.979717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0685","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:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oXRGOC8bO3M/B+omr8tNrvz0lnIfSIZRn41A3IgmXMXdYU5CldAZqsc7N1PtIltTktntDmLmPD3zxIOJPxU7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:49:42.236750Z"},"content_sha256":"a50d66a051a1f87e261f2943b560a7fd07aee36659dfdb12d15a125c7ad83f94","schema_version":"1.0","event_id":"sha256:a50d66a051a1f87e261f2943b560a7fd07aee36659dfdb12d15a125c7ad83f94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TE3QTLBSN5PGKHY2XKYAMYIMDX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of zero-delay mappings for distributed coding by deterministic annealing","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-12-03T02:56:53Z","abstract_excerpt":"This paper studies the optimization of zero-delay analog mappings in a network setting that involves distributed coding. The cost surface is known to be non-convex, and known greedy methods tend to get trapped in poor locally optimal solutions that depend heavily on initialization. We derive an optimization algorithm based on the principles of \"deterministic annealing\", a powerful global optimization framework that has been successfully employed in several disciplines, including, in our recent work, to a simple zero-delay analog communications problem. We demonstrate strict superiority over th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0685","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:05:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TDsyRWHmE8H1EvN7DqHKZRT1E4yt1O0KdzhBb0HsY1+bzkHiqwrpBmhs+yC3YWtDEiOcBqdxLNqMddPy+jw1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:49:42.237505Z"},"content_sha256":"848b382704d65e57a099b7956e323ab5bb298994bbc9e40447d12454beff3751","schema_version":"1.0","event_id":"sha256:848b382704d65e57a099b7956e323ab5bb298994bbc9e40447d12454beff3751"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TE3QTLBSN5PGKHY2XKYAMYIMDX/bundle.json","state_url":"https://pith.science/pith/TE3QTLBSN5PGKHY2XKYAMYIMDX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TE3QTLBSN5PGKHY2XKYAMYIMDX/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-09T03:49:42Z","links":{"resolver":"https://pith.science/pith/TE3QTLBSN5PGKHY2XKYAMYIMDX","bundle":"https://pith.science/pith/TE3QTLBSN5PGKHY2XKYAMYIMDX/bundle.json","state":"https://pith.science/pith/TE3QTLBSN5PGKHY2XKYAMYIMDX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TE3QTLBSN5PGKHY2XKYAMYIMDX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TE3QTLBSN5PGKHY2XKYAMYIMDX","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":"cf2dba7faf98839fe40610b9e17786cf950afcc6619a3de32bb493139353499e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-03T02:56:53Z","title_canon_sha256":"b6a10f9bf2a471b5db41cb4f6766bfbe0769f39b4cc26342305593fac812a1bc"},"schema_version":"1.0","source":{"id":"1312.0685","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0685","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0685v1","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0685","created_at":"2026-05-18T03:05:36Z"},{"alias_kind":"pith_short_12","alias_value":"TE3QTLBSN5PG","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TE3QTLBSN5PGKHY2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TE3QTLBS","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:848b382704d65e57a099b7956e323ab5bb298994bbc9e40447d12454beff3751","target":"graph","created_at":"2026-05-18T03:05: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":"This paper studies the optimization of zero-delay analog mappings in a network setting that involves distributed coding. The cost surface is known to be non-convex, and known greedy methods tend to get trapped in poor locally optimal solutions that depend heavily on initialization. We derive an optimization algorithm based on the principles of \"deterministic annealing\", a powerful global optimization framework that has been successfully employed in several disciplines, including, in our recent work, to a simple zero-delay analog communications problem. We demonstrate strict superiority over th","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-12-03T02:56:53Z","title":"Optimization of zero-delay mappings for distributed coding by deterministic annealing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0685","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:a50d66a051a1f87e261f2943b560a7fd07aee36659dfdb12d15a125c7ad83f94","target":"record","created_at":"2026-05-18T03:05: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":"cf2dba7faf98839fe40610b9e17786cf950afcc6619a3de32bb493139353499e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-03T02:56:53Z","title_canon_sha256":"b6a10f9bf2a471b5db41cb4f6766bfbe0769f39b4cc26342305593fac812a1bc"},"schema_version":"1.0","source":{"id":"1312.0685","kind":"arxiv","version":1}},"canonical_sha256":"993709ac326f5e651f1abab006610c1df6502828c85f286b3cd4bbe4da9824f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"993709ac326f5e651f1abab006610c1df6502828c85f286b3cd4bbe4da9824f5","first_computed_at":"2026-05-18T03:05:36.979717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:36.979717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GBwuolzeicEtTf5p/sAgt4xEKcmkQSnMn8OkOHFT8llhO234wn/QNVo+ptBbGiyAauuuEtPC9mSrOJkjFW2yDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:36.980386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0685","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a50d66a051a1f87e261f2943b560a7fd07aee36659dfdb12d15a125c7ad83f94","sha256:848b382704d65e57a099b7956e323ab5bb298994bbc9e40447d12454beff3751"],"state_sha256":"f1130e53e8bcddabe30ff8fbb29ae664da2dd7b4caea99cf55a8b85aecf71827"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"USuHQwBAwUDiBdXNg7FR63NIJMURquI9ZaA+Bs6cWY1WGOx/OwcLBoj//1c4aMeQTuR1v+gkVXRfYPWoC0qcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:49:42.241477Z","bundle_sha256":"7e9e85a3f42ef4f81ce28f0aef9de553771a2d3fd68a4a15e134a9b4da23235f"}}