{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:72ESB76ZDHPVANWXDHUM5IX3FI","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":"8d2d2bd5dff505d769e274cd990959986fd641e0ee7f6dcc7e5695f1fe5769cc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T17:41:54Z","title_canon_sha256":"c9bf82d6012c9fdf8789f7f198e0f81fa42016b790e9b0fd9afee1b384890d29"},"schema_version":"1.0","source":{"id":"1506.03407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03407","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03407v2","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03407","created_at":"2026-05-18T01:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"72ESB76ZDHPV","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"72ESB76ZDHPVANWX","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"72ESB76Z","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:cb8fe100a84a30a567e9baabca2e8a0385bef9932ac38ca31d6da565cea871ad","target":"graph","created_at":"2026-05-18T01:19:06Z","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":"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","authors_text":"Albert No, Amir Ingber, Tsachy Weissman","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T17:41:54Z","title":"Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03407","kind":"arxiv","version":2},"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:b2ab27b3fd48a5eaa93160653b6e3fa1b0bb13817636dca4e2df50272614603a","target":"record","created_at":"2026-05-18T01:19:06Z","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":"8d2d2bd5dff505d769e274cd990959986fd641e0ee7f6dcc7e5695f1fe5769cc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T17:41:54Z","title_canon_sha256":"c9bf82d6012c9fdf8789f7f198e0f81fa42016b790e9b0fd9afee1b384890d29"},"schema_version":"1.0","source":{"id":"1506.03407","kind":"arxiv","version":2}},"canonical_sha256":"fe8920ffd919df5036d719e8cea2fb2a3c29dc6bfbcea22997ca9e100b5a9737","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe8920ffd919df5036d719e8cea2fb2a3c29dc6bfbcea22997ca9e100b5a9737","first_computed_at":"2026-05-18T01:19:06.053265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:06.053265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5gPQtxuNLJQBWviPIa14o4ueqqc+0+LBfkKpR6O56/11qjuZnOPVwnOocv7VukkvM2/5SG8K4w1BkmBzDaSACA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:06.053931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2ab27b3fd48a5eaa93160653b6e3fa1b0bb13817636dca4e2df50272614603a","sha256:cb8fe100a84a30a567e9baabca2e8a0385bef9932ac38ca31d6da565cea871ad"],"state_sha256":"fc32bb00ebcda323563b52ea11f399485121b6338ba9073cd91d77c4aa5ad9c9"}