{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HOG6AOV4OR6KQNUZGFJKNDVAAT","short_pith_number":"pith:HOG6AOV4","canonical_record":{"source":{"id":"1802.07458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T08:00:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"859e027b08ec5fa56a32780f26202e4aa4dcb33b69877afc5d6c60d6a29e072f","abstract_canon_sha256":"02d065365b842ec361f7c29fc67f8bf7a280a890e41f7e72c2cf3ecd9d30b65b"},"schema_version":"1.0"},"canonical_sha256":"3b8de03abc747ca836993152a68ea004dce710e667db2c235624e34e1b8f6cfb","source":{"kind":"arxiv","id":"1802.07458","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07458","created_at":"2026-05-17T23:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07458v2","created_at":"2026-05-17T23:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07458","created_at":"2026-05-17T23:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"HOG6AOV4OR6K","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HOG6AOV4OR6KQNUZ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HOG6AOV4","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HOG6AOV4OR6KQNUZGFJKNDVAAT","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07458","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T08:00:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"859e027b08ec5fa56a32780f26202e4aa4dcb33b69877afc5d6c60d6a29e072f","abstract_canon_sha256":"02d065365b842ec361f7c29fc67f8bf7a280a890e41f7e72c2cf3ecd9d30b65b"},"schema_version":"1.0"},"canonical_sha256":"3b8de03abc747ca836993152a68ea004dce710e667db2c235624e34e1b8f6cfb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:42.054286Z","signature_b64":"wLzZi+oAn/2CLw5vaP5yS32i8GLOsm5abPj6q06a8DW16my5x5j5pFM1XXaiwYSRP5dS5Xj5xQVQ2lHmq+E5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8de03abc747ca836993152a68ea004dce710e667db2c235624e34e1b8f6cfb","last_reissued_at":"2026-05-17T23:57:42.053616Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:42.053616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07458","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-17T23:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWzgrPRqYaCu1x7iW8rnpqY1u2z2uJFecmA4SxU5WcaRTxthVTkS3gbfy+y5nT5lJ+bIxltOzNcYoWkZQ5WlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T22:49:39.576607Z"},"content_sha256":"c39286fca9c5f90dbafc28b3b17b6482545276e5ce68b41f3f70fc93c9aee3fd","schema_version":"1.0","event_id":"sha256:c39286fca9c5f90dbafc28b3b17b6482545276e5ce68b41f3f70fc93c9aee3fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HOG6AOV4OR6KQNUZGFJKNDVAAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tetsunao Matsuta, Tomohiko Uyematsu","submitted_at":"2018-02-21T08:00:15Z","abstract_excerpt":"In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by one of two codewords, and the other reconstruction is obtained by all two codewords. For this coding problem, we give non-asymptotic inner and outer bounds on pairs of numbers of codewords of two encoders such that each probability that a distortion exceeds a given distortion level is less than a given probability level. We also give a general formula for the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07458","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-17T23:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lDcji5pfDc/KFimCzbdx3amyB6Un19oaXVHq9PdzjvPQ6XbQhUO7n0O81AeJgwZk44yjQBXw3rM7jzi01t/9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-19T22:49:39.576963Z"},"content_sha256":"bce3917c920707bb6441a4701b7f3041ca0cf510af919b178594d045a1c6ae6b","schema_version":"1.0","event_id":"sha256:bce3917c920707bb6441a4701b7f3041ca0cf510af919b178594d045a1c6ae6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HOG6AOV4OR6KQNUZGFJKNDVAAT/bundle.json","state_url":"https://pith.science/pith/HOG6AOV4OR6KQNUZGFJKNDVAAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HOG6AOV4OR6KQNUZGFJKNDVAAT/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-06-19T22:49:39Z","links":{"resolver":"https://pith.science/pith/HOG6AOV4OR6KQNUZGFJKNDVAAT","bundle":"https://pith.science/pith/HOG6AOV4OR6KQNUZGFJKNDVAAT/bundle.json","state":"https://pith.science/pith/HOG6AOV4OR6KQNUZGFJKNDVAAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HOG6AOV4OR6KQNUZGFJKNDVAAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HOG6AOV4OR6KQNUZGFJKNDVAAT","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":"02d065365b842ec361f7c29fc67f8bf7a280a890e41f7e72c2cf3ecd9d30b65b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T08:00:15Z","title_canon_sha256":"859e027b08ec5fa56a32780f26202e4aa4dcb33b69877afc5d6c60d6a29e072f"},"schema_version":"1.0","source":{"id":"1802.07458","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07458","created_at":"2026-05-17T23:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07458v2","created_at":"2026-05-17T23:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07458","created_at":"2026-05-17T23:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"HOG6AOV4OR6K","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HOG6AOV4OR6KQNUZ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HOG6AOV4","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:bce3917c920707bb6441a4701b7f3041ca0cf510af919b178594d045a1c6ae6b","target":"graph","created_at":"2026-05-17T23:57:42Z","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":"In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by one of two codewords, and the other reconstruction is obtained by all two codewords. For this coding problem, we give non-asymptotic inner and outer bounds on pairs of numbers of codewords of two encoders such that each probability that a distortion exceeds a given distortion level is less than a given probability level. We also give a general formula for the","authors_text":"Tetsunao Matsuta, Tomohiko Uyematsu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T08:00:15Z","title":"Non-Asymptotic Bounds and a General Formula for the Rate-Distortion Region of the Successive Refinement Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07458","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:c39286fca9c5f90dbafc28b3b17b6482545276e5ce68b41f3f70fc93c9aee3fd","target":"record","created_at":"2026-05-17T23:57:42Z","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":"02d065365b842ec361f7c29fc67f8bf7a280a890e41f7e72c2cf3ecd9d30b65b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-02-21T08:00:15Z","title_canon_sha256":"859e027b08ec5fa56a32780f26202e4aa4dcb33b69877afc5d6c60d6a29e072f"},"schema_version":"1.0","source":{"id":"1802.07458","kind":"arxiv","version":2}},"canonical_sha256":"3b8de03abc747ca836993152a68ea004dce710e667db2c235624e34e1b8f6cfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b8de03abc747ca836993152a68ea004dce710e667db2c235624e34e1b8f6cfb","first_computed_at":"2026-05-17T23:57:42.053616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:42.053616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wLzZi+oAn/2CLw5vaP5yS32i8GLOsm5abPj6q06a8DW16my5x5j5pFM1XXaiwYSRP5dS5Xj5xQVQ2lHmq+E5Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:42.054286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07458","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c39286fca9c5f90dbafc28b3b17b6482545276e5ce68b41f3f70fc93c9aee3fd","sha256:bce3917c920707bb6441a4701b7f3041ca0cf510af919b178594d045a1c6ae6b"],"state_sha256":"618235a14d5c09bd45e6c1260cc143c885120277e20a867c2328e2da4394a8cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaMfabYbQR8pO6gjtdgll2dowDTt9351r0mgc4atq1QyqtaYglvHWDL4rcfapmAUaWDa12Bnfbbj8Q9dFjCfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-19T22:49:39.578981Z","bundle_sha256":"cf26565b285b61f176921e38f38b2055bf74564dce838a676638a437ba21cc69"}}