{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HEI36JMZFTX7BDVRHGOFUXMUAQ","short_pith_number":"pith:HEI36JMZ","schema_version":"1.0","canonical_sha256":"3911bf25992ceff08eb1399c5a5d94043cb69e6f894f7a59631762c7b4847d9f","source":{"kind":"arxiv","id":"1301.6190","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.6190","created_at":"2026-05-18T01:09:33.240702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6190v1","created_at":"2026-05-18T01:09:33.240702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6190","created_at":"2026-05-18T01:09:33.240702+00:00"},{"alias_kind":"pith_short_12","alias_value":"HEI36JMZFTX7","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HEI36JMZFTX7BDVR","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HEI36JMZ","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ","json":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ.json","graph_json":"https://pith.science/api/pith-number/HEI36JMZFTX7BDVRHGOFUXMUAQ/graph.json","events_json":"https://pith.science/api/pith-number/HEI36JMZFTX7BDVRHGOFUXMUAQ/events.json","paper":"https://pith.science/paper/HEI36JMZ"},"agent_actions":{"view_html":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ","download_json":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ.json","view_paper":"https://pith.science/paper/HEI36JMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6190&json=true","fetch_graph":"https://pith.science/api/pith-number/HEI36JMZFTX7BDVRHGOFUXMUAQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HEI36JMZFTX7BDVRHGOFUXMUAQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/action/storage_attestation","attest_author":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/action/author_attestation","sign_citation":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/action/citation_signature","submit_replication":"https://pith.science/pith/HEI36JMZFTX7BDVRHGOFUXMUAQ/action/replication_record"}},"created_at":"2026-05-18T01:09:33.240702+00:00","updated_at":"2026-05-18T01:09:33.240702+00:00"}