{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HEI36JMZFTX7BDVRHGOFUXMUAQ","short_pith_number":"pith:HEI36JMZ","canonical_record":{"source":{"id":"1301.6190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-25T23:02:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c83da5a1f7324683955ad414c327b04748eae7331bdba5cb212d49b9820f8ee9","abstract_canon_sha256":"e10cd417b67ac022d951ad0e77fe4c352b5f558de90292b3bc18df8d946fd2e5"},"schema_version":"1.0"},"canonical_sha256":"3911bf25992ceff08eb1399c5a5d94043cb69e6f894f7a59631762c7b4847d9f","source":{"kind":"arxiv","id":"1301.6190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6190","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6190v1","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6190","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"HEI36JMZFTX7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HEI36JMZFTX7BDVR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HEI36JMZ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HEI36JMZFTX7BDVRHGOFUXMUAQ","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-25T23:02:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c83da5a1f7324683955ad414c327b04748eae7331bdba5cb212d49b9820f8ee9","abstract_canon_sha256":"e10cd417b67ac022d951ad0e77fe4c352b5f558de90292b3bc18df8d946fd2e5"},"schema_version":"1.0"},"canonical_sha256":"3911bf25992ceff08eb1399c5a5d94043cb69e6f894f7a59631762c7b4847d9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:33.241130Z","signature_b64":"L2gc9Ye5JLIKCag9dgGYedvFR+AhskPSU/6Qj9aPEh0aAhn+x3TGH0dULHLc3T2UYCOYUWlxM0xs9MVubQEjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3911bf25992ceff08eb1399c5a5d94043cb69e6f894f7a59631762c7b4847d9f","last_reissued_at":"2026-05-18T01:09:33.240621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:33.240621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6190","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-18T01:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L5EZLRD1CU8bXGMVgibYqM7bekcxzk5nzu1CymiPS0PfwgMjTua/sUzMHLYFqWOtK+LXBeiFLllpbkIGUp0yAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:25.671782Z"},"content_sha256":"7d2bec26cc55da0e79ebccdfcc90f97f9d786c139e0a9b54dd1faaa08c502349","schema_version":"1.0","event_id":"sha256:7d2bec26cc55da0e79ebccdfcc90f97f9d786c139e0a9b54dd1faaa08c502349"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HEI36JMZFTX7BDVRHGOFUXMUAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blahut-Arimoto Algorithm and Code Design for Action-Dependent Source Coding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kasper Fl{\\o}e Trillingsgaard, Osvaldo Simeone, Petar Popovski, Torben Larsen","submitted_at":"2013-01-25T23:02:15Z","abstract_excerpt":"The source coding problem with action-dependent side information at the decoder has recently been introduced to model data acquisition in resource-constrained systems. In this paper, an efficient algorithm for numerical computation of the rate-distortion-cost function for this problem is proposed, and a convergence proof is provided. Moreover, a two-stage code design based on multiplexing is put forth, whereby the first stage encodes the actions and the second stage is composed of an array of classical Wyner-Ziv codes, one for each action. Specific coding/decoding strategies are designed based"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6190","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-18T01:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nqM78M7NDnyKrdFw4ur9cKO7AGJwDRBrf2LRKukAEXoPcAX0OAbKjbJ8amUbkferEXtDZuB+5pt2PT4vb9jbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:25.672390Z"},"content_sha256":"521fa58222edd4efd5264a8cf13f50e7d1ea0fd525a203afb5766ea6a83cfb55","schema_version":"1.0","event_id":"sha256:521fa58222edd4efd5264a8cf13f50e7d1ea0fd525a203afb5766ea6a83cfb55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/bundle.json","state_url":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/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-26T11:54:25Z","links":{"resolver":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ","bundle":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/bundle.json","state":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HEI36JMZFTX7BDVRHGOFUXMUAQ","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":"e10cd417b67ac022d951ad0e77fe4c352b5f558de90292b3bc18df8d946fd2e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-25T23:02:15Z","title_canon_sha256":"c83da5a1f7324683955ad414c327b04748eae7331bdba5cb212d49b9820f8ee9"},"schema_version":"1.0","source":{"id":"1301.6190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6190","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6190v1","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6190","created_at":"2026-05-18T01:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"HEI36JMZFTX7","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HEI36JMZFTX7BDVR","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HEI36JMZ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:521fa58222edd4efd5264a8cf13f50e7d1ea0fd525a203afb5766ea6a83cfb55","target":"graph","created_at":"2026-05-18T01:09:33Z","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":"The source coding problem with action-dependent side information at the decoder has recently been introduced to model data acquisition in resource-constrained systems. In this paper, an efficient algorithm for numerical computation of the rate-distortion-cost function for this problem is proposed, and a convergence proof is provided. Moreover, a two-stage code design based on multiplexing is put forth, whereby the first stage encodes the actions and the second stage is composed of an array of classical Wyner-Ziv codes, one for each action. Specific coding/decoding strategies are designed based","authors_text":"Kasper Fl{\\o}e Trillingsgaard, Osvaldo Simeone, Petar Popovski, Torben Larsen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-25T23:02:15Z","title":"Blahut-Arimoto Algorithm and Code Design for Action-Dependent Source Coding Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6190","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:7d2bec26cc55da0e79ebccdfcc90f97f9d786c139e0a9b54dd1faaa08c502349","target":"record","created_at":"2026-05-18T01:09:33Z","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":"e10cd417b67ac022d951ad0e77fe4c352b5f558de90292b3bc18df8d946fd2e5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-25T23:02:15Z","title_canon_sha256":"c83da5a1f7324683955ad414c327b04748eae7331bdba5cb212d49b9820f8ee9"},"schema_version":"1.0","source":{"id":"1301.6190","kind":"arxiv","version":1}},"canonical_sha256":"3911bf25992ceff08eb1399c5a5d94043cb69e6f894f7a59631762c7b4847d9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3911bf25992ceff08eb1399c5a5d94043cb69e6f894f7a59631762c7b4847d9f","first_computed_at":"2026-05-18T01:09:33.240621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:33.240621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L2gc9Ye5JLIKCag9dgGYedvFR+AhskPSU/6Qj9aPEh0aAhn+x3TGH0dULHLc3T2UYCOYUWlxM0xs9MVubQEjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:33.241130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d2bec26cc55da0e79ebccdfcc90f97f9d786c139e0a9b54dd1faaa08c502349","sha256:521fa58222edd4efd5264a8cf13f50e7d1ea0fd525a203afb5766ea6a83cfb55"],"state_sha256":"85abd2cbbfe13d23b08505e6635c7225a007039152c05ccbec7d0827aad74399"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P+6DxDIdH90qYUazwhbojx/ZE3z4VT1zzZNNpwpIUmJngtjuP3WoI1tAS7+N9YnVfV8Q6V3STmtmNlyX+whgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:54:25.675433Z","bundle_sha256":"2dd3be5b7974ee64e63018cce18e06ccaf57759901e14fba1a658392ba76ad55"}}