{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QC37FMPOA24FB5KHRN22LH6PIH","short_pith_number":"pith:QC37FMPO","canonical_record":{"source":{"id":"1601.04500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:10:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"58a41a399aa57b02a6745ccbcd11f7877002733ca1e76eb65f111ab520a30978","abstract_canon_sha256":"b46b964ff78035e3014d05ec4f58058287ddd100b9e523bf0599ae99ea762875"},"schema_version":"1.0"},"canonical_sha256":"80b7f2b1ee06b850f5478b75a59fcf41d0a15f1f454fc2046ed32771a356b167","source":{"kind":"arxiv","id":"1601.04500","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04500","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04500v2","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04500","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"QC37FMPOA24F","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QC37FMPOA24FB5KH","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QC37FMPO","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QC37FMPOA24FB5KHRN22LH6PIH","target":"record","payload":{"canonical_record":{"source":{"id":"1601.04500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:10:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"58a41a399aa57b02a6745ccbcd11f7877002733ca1e76eb65f111ab520a30978","abstract_canon_sha256":"b46b964ff78035e3014d05ec4f58058287ddd100b9e523bf0599ae99ea762875"},"schema_version":"1.0"},"canonical_sha256":"80b7f2b1ee06b850f5478b75a59fcf41d0a15f1f454fc2046ed32771a356b167","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:53.938421Z","signature_b64":"8HFk+iOA0FM6Amq6yiQBReu5h/Wu2y35wLpcs5B1dTB5pl9jGKsTNbHA+GY8j4ppne4m1p7yq6uqw90AnH0gAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80b7f2b1ee06b850f5478b75a59fcf41d0a15f1f454fc2046ed32771a356b167","last_reissued_at":"2026-05-18T01:07:53.938014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:53.938014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.04500","source_version":2,"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:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fAN8zQ6f3kPZRfsFTD66q1jvTIqaxI2reLpTuH5v2ANjpXWaBE5GtzIzWZexp046VM7iHZNhpZo1BU7juz0YBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:57.053679Z"},"content_sha256":"f6aa8c057213d3c83698bb075cbc750c492275144e7b0e9cd9dbb800e44ce057","schema_version":"1.0","event_id":"sha256:f6aa8c057213d3c83698bb075cbc750c492275144e7b0e9cd9dbb800e44ce057"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QC37FMPOA24FB5KHRN22LH6PIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second-Order and Moderate Deviation Asymptotics for Successive Refinement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lin Zhou, Mehul Motani, Vincent Y. F. Tan","submitted_at":"2016-01-18T13:10:26Z","abstract_excerpt":"We derive the optimal second-order coding region and moderate deviations constant for successive refinement source coding with a joint excess-distortion probability constraint. We consider two scenarios: (i) a discrete memoryless source (DMS) and arbitrary distortion measures at the decoders and (ii) a Gaussian memoryless source (GMS) and quadratic distortion measures at the decoders. For a DMS with arbitrary distortion measures, we prove an achievable second-order coding region, using type covering lemmas by Kanlis and Narayan and by No, Ingber and Weissman. We prove the converse using the pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04500","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"},"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:07:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OYBYhqKKjBe7TdQFZlCi51i196VjAIkBjOFstdeAJx1qBtKBLHpcXjH5AdGLvw9IcOkI5rKE38/Ne25cK3fBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:57.054034Z"},"content_sha256":"b08bcf909d76938e16703d86c5e5ab1a2fb50b93b02fbbdf6a5875f981e7be48","schema_version":"1.0","event_id":"sha256:b08bcf909d76938e16703d86c5e5ab1a2fb50b93b02fbbdf6a5875f981e7be48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QC37FMPOA24FB5KHRN22LH6PIH/bundle.json","state_url":"https://pith.science/pith/QC37FMPOA24FB5KHRN22LH6PIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QC37FMPOA24FB5KHRN22LH6PIH/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-30T23:51:57Z","links":{"resolver":"https://pith.science/pith/QC37FMPOA24FB5KHRN22LH6PIH","bundle":"https://pith.science/pith/QC37FMPOA24FB5KHRN22LH6PIH/bundle.json","state":"https://pith.science/pith/QC37FMPOA24FB5KHRN22LH6PIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QC37FMPOA24FB5KHRN22LH6PIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QC37FMPOA24FB5KHRN22LH6PIH","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":"b46b964ff78035e3014d05ec4f58058287ddd100b9e523bf0599ae99ea762875","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:10:26Z","title_canon_sha256":"58a41a399aa57b02a6745ccbcd11f7877002733ca1e76eb65f111ab520a30978"},"schema_version":"1.0","source":{"id":"1601.04500","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.04500","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"arxiv_version","alias_value":"1601.04500v2","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04500","created_at":"2026-05-18T01:07:53Z"},{"alias_kind":"pith_short_12","alias_value":"QC37FMPOA24F","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"QC37FMPOA24FB5KH","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"QC37FMPO","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:b08bcf909d76938e16703d86c5e5ab1a2fb50b93b02fbbdf6a5875f981e7be48","target":"graph","created_at":"2026-05-18T01:07:53Z","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 derive the optimal second-order coding region and moderate deviations constant for successive refinement source coding with a joint excess-distortion probability constraint. We consider two scenarios: (i) a discrete memoryless source (DMS) and arbitrary distortion measures at the decoders and (ii) a Gaussian memoryless source (GMS) and quadratic distortion measures at the decoders. For a DMS with arbitrary distortion measures, we prove an achievable second-order coding region, using type covering lemmas by Kanlis and Narayan and by No, Ingber and Weissman. We prove the converse using the pe","authors_text":"Lin Zhou, Mehul Motani, Vincent Y. F. Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:10:26Z","title":"Second-Order and Moderate Deviation Asymptotics for Successive Refinement"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04500","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:f6aa8c057213d3c83698bb075cbc750c492275144e7b0e9cd9dbb800e44ce057","target":"record","created_at":"2026-05-18T01:07:53Z","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":"b46b964ff78035e3014d05ec4f58058287ddd100b9e523bf0599ae99ea762875","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-18T13:10:26Z","title_canon_sha256":"58a41a399aa57b02a6745ccbcd11f7877002733ca1e76eb65f111ab520a30978"},"schema_version":"1.0","source":{"id":"1601.04500","kind":"arxiv","version":2}},"canonical_sha256":"80b7f2b1ee06b850f5478b75a59fcf41d0a15f1f454fc2046ed32771a356b167","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80b7f2b1ee06b850f5478b75a59fcf41d0a15f1f454fc2046ed32771a356b167","first_computed_at":"2026-05-18T01:07:53.938014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:53.938014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8HFk+iOA0FM6Amq6yiQBReu5h/Wu2y35wLpcs5B1dTB5pl9jGKsTNbHA+GY8j4ppne4m1p7yq6uqw90AnH0gAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:53.938421Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.04500","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6aa8c057213d3c83698bb075cbc750c492275144e7b0e9cd9dbb800e44ce057","sha256:b08bcf909d76938e16703d86c5e5ab1a2fb50b93b02fbbdf6a5875f981e7be48"],"state_sha256":"8899d7afc24b348aeb1fc4912aca67be43916c7b2431bf114e914a6e634dc105"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpxv/2v/Zsxm4EA2b+zBhu1bjB9Vebn3Te4z67rIUKKJj1fJn6/qgzUIeE6cBihveI6TOzyjnH125tN5EdOLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:51:57.056136Z","bundle_sha256":"d52b6b6869027dd0398f0ecd708eddd71e7842118359e521a226c51fd9ed371a"}}