{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:72ESB76ZDHPVANWXDHUM5IX3FI","short_pith_number":"pith:72ESB76Z","schema_version":"1.0","canonical_sha256":"fe8920ffd919df5036d719e8cea2fb2a3c29dc6bfbcea22997ca9e100b5a9737","source":{"kind":"arxiv","id":"1506.03407","version":2},"attestation_state":"computed","paper":{"title":"Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert No, Amir Ingber, Tsachy Weissman","submitted_at":"2015-06-10T17:41:54Z","abstract_excerpt":"We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similarly to the classical definition of a successively refinable source, we say that a source is strongly successively refinable if successive refinement coding can achieve the second order optimum rate (including the dispersion terms) at both decoders. We establish a sufficient condition for strong successive refinability. We show that any discrete source under Hamming distortion and the Gaussian source under quadratic distortion are strongly successively refinable.\n  We also demonstrate how"},"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":"1506.03407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T17:41:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c9bf82d6012c9fdf8789f7f198e0f81fa42016b790e9b0fd9afee1b384890d29","abstract_canon_sha256":"8d2d2bd5dff505d769e274cd990959986fd641e0ee7f6dcc7e5695f1fe5769cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:06.053931Z","signature_b64":"5gPQtxuNLJQBWviPIa14o4ueqqc+0+LBfkKpR6O56/11qjuZnOPVwnOocv7VukkvM2/5SG8K4w1BkmBzDaSACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe8920ffd919df5036d719e8cea2fb2a3c29dc6bfbcea22997ca9e100b5a9737","last_reissued_at":"2026-05-18T01:19:06.053265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:06.053265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert No, Amir Ingber, Tsachy Weissman","submitted_at":"2015-06-10T17:41:54Z","abstract_excerpt":"We investigate the second order asymptotics (source dispersion) of the successive refinement problem. Similarly to the classical definition of a successively refinable source, we say that a source is strongly successively refinable if successive refinement coding can achieve the second order optimum rate (including the dispersion terms) at both decoders. We establish a sufficient condition for strong successive refinability. We show that any discrete source under Hamming distortion and the Gaussian source under quadratic distortion are strongly successively refinable.\n  We also demonstrate how"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03407","kind":"arxiv","version":2},"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":"1506.03407","created_at":"2026-05-18T01:19:06.053380+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03407v2","created_at":"2026-05-18T01:19:06.053380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03407","created_at":"2026-05-18T01:19:06.053380+00:00"},{"alias_kind":"pith_short_12","alias_value":"72ESB76ZDHPV","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"72ESB76ZDHPVANWX","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"72ESB76Z","created_at":"2026-05-18T12:29:07.941421+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/72ESB76ZDHPVANWXDHUM5IX3FI","json":"https://pith.science/pith/72ESB76ZDHPVANWXDHUM5IX3FI.json","graph_json":"https://pith.science/api/pith-number/72ESB76ZDHPVANWXDHUM5IX3FI/graph.json","events_json":"https://pith.science/api/pith-number/72ESB76ZDHPVANWXDHUM5IX3FI/events.json","paper":"https://pith.science/paper/72ESB76Z"},"agent_actions":{"view_html":"https://pith.science/pith/72ESB76ZDHPVANWXDHUM5IX3FI","download_json":"https://pith.science/pith/72ESB76ZDHPVANWXDHUM5IX3FI.json","view_paper":"https://pith.science/paper/72ESB76Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03407&json=true","fetch_graph":"https://pith.science/api/pith-number/72ESB76ZDHPVANWXDHUM5IX3FI/graph.json","fetch_events":"https://pith.science/api/pith-number/72ESB76ZDHPVANWXDHUM5IX3FI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/72ESB76ZDHPVANWXDHUM5IX3FI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/72ESB76ZDHPVANWXDHUM5IX3FI/action/storage_attestation","attest_author":"https://pith.science/pith/72ESB76ZDHPVANWXDHUM5IX3FI/action/author_attestation","sign_citation":"https://pith.science/pith/72ESB76ZDHPVANWXDHUM5IX3FI/action/citation_signature","submit_replication":"https://pith.science/pith/72ESB76ZDHPVANWXDHUM5IX3FI/action/replication_record"}},"created_at":"2026-05-18T01:19:06.053380+00:00","updated_at":"2026-05-18T01:19:06.053380+00:00"}