{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EPDNPW27SVYFVLVI7DAEORY6FH","short_pith_number":"pith:EPDNPW27","schema_version":"1.0","canonical_sha256":"23c6d7db5f95705aaea8f8c047471e29fe44945dbba39c4a616adc8f4c6ad160","source":{"kind":"arxiv","id":"1802.03937","version":1},"attestation_state":"computed","paper":{"title":"Compression for Multiple Reconstructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Alfred M. Bruckstein, Michael Elad, Yehuda Dar","submitted_at":"2018-02-12T08:51:04Z","abstract_excerpt":"In this work we propose a method for optimizing the lossy compression for a network of diverse reconstruction systems. We focus on adapting a standard image compression method to a set of candidate displays, presenting the decompressed signals to viewers. Each display is modeled as a linear operator applied after decompression, and its probability to serve a network user. We formulate a complicated operational rate-distortion optimization trading-off the network's expected mean-squared reconstruction error and the compression bit-cost. Using the alternating direction method of multipliers (ADM"},"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":"1802.03937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2018-02-12T08:51:04Z","cross_cats_sorted":[],"title_canon_sha256":"2bf350f1cc641f9d5912f78760b69d81e50795eb2f5492ff1f7470caec1c5cf4","abstract_canon_sha256":"c358377c442e544f163e413716cac167c679f125486d13ce7f0084bbcd85e2d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:49.947887Z","signature_b64":"gJ/kdMy0qy81cXNmcekHLz5ytXefXakkbxkULCUc44yFAwDg5Fq11yFiUMZQE9P/Q5z1EDE9ZWFkcvjQWl13CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23c6d7db5f95705aaea8f8c047471e29fe44945dbba39c4a616adc8f4c6ad160","last_reissued_at":"2026-05-18T00:23:49.947221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:49.947221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compression for Multiple Reconstructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Alfred M. Bruckstein, Michael Elad, Yehuda Dar","submitted_at":"2018-02-12T08:51:04Z","abstract_excerpt":"In this work we propose a method for optimizing the lossy compression for a network of diverse reconstruction systems. We focus on adapting a standard image compression method to a set of candidate displays, presenting the decompressed signals to viewers. Each display is modeled as a linear operator applied after decompression, and its probability to serve a network user. We formulate a complicated operational rate-distortion optimization trading-off the network's expected mean-squared reconstruction error and the compression bit-cost. Using the alternating direction method of multipliers (ADM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03937","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":"1802.03937","created_at":"2026-05-18T00:23:49.947335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03937v1","created_at":"2026-05-18T00:23:49.947335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03937","created_at":"2026-05-18T00:23:49.947335+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPDNPW27SVYF","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPDNPW27SVYFVLVI","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPDNPW27","created_at":"2026-05-18T12:32:22.470017+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/EPDNPW27SVYFVLVI7DAEORY6FH","json":"https://pith.science/pith/EPDNPW27SVYFVLVI7DAEORY6FH.json","graph_json":"https://pith.science/api/pith-number/EPDNPW27SVYFVLVI7DAEORY6FH/graph.json","events_json":"https://pith.science/api/pith-number/EPDNPW27SVYFVLVI7DAEORY6FH/events.json","paper":"https://pith.science/paper/EPDNPW27"},"agent_actions":{"view_html":"https://pith.science/pith/EPDNPW27SVYFVLVI7DAEORY6FH","download_json":"https://pith.science/pith/EPDNPW27SVYFVLVI7DAEORY6FH.json","view_paper":"https://pith.science/paper/EPDNPW27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03937&json=true","fetch_graph":"https://pith.science/api/pith-number/EPDNPW27SVYFVLVI7DAEORY6FH/graph.json","fetch_events":"https://pith.science/api/pith-number/EPDNPW27SVYFVLVI7DAEORY6FH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPDNPW27SVYFVLVI7DAEORY6FH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPDNPW27SVYFVLVI7DAEORY6FH/action/storage_attestation","attest_author":"https://pith.science/pith/EPDNPW27SVYFVLVI7DAEORY6FH/action/author_attestation","sign_citation":"https://pith.science/pith/EPDNPW27SVYFVLVI7DAEORY6FH/action/citation_signature","submit_replication":"https://pith.science/pith/EPDNPW27SVYFVLVI7DAEORY6FH/action/replication_record"}},"created_at":"2026-05-18T00:23:49.947335+00:00","updated_at":"2026-05-18T00:23:49.947335+00:00"}