{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HFX63AWKEGUQCF5XIBWUQHCNDJ","short_pith_number":"pith:HFX63AWK","canonical_record":{"source":{"id":"1603.06123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-03-19T18:02:17Z","cross_cats_sorted":[],"title_canon_sha256":"bcdb6f8255fafa87bc63dccfd4ecf10c84f06bfc3aebb8277dd18d44b5bddd23","abstract_canon_sha256":"ed8b52d7ef391d80db8918c69aa2dba937ab3e95076d671ed932a07596fbb372"},"schema_version":"1.0"},"canonical_sha256":"396fed82ca21a90117b7406d481c4d1a7d13b893d8bdd557e8bc26b8d4ddb934","source":{"kind":"arxiv","id":"1603.06123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06123","created_at":"2026-05-18T01:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06123v1","created_at":"2026-05-18T01:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06123","created_at":"2026-05-18T01:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"HFX63AWKEGUQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HFX63AWKEGUQCF5X","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HFX63AWK","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HFX63AWKEGUQCF5XIBWUQHCNDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.06123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-03-19T18:02:17Z","cross_cats_sorted":[],"title_canon_sha256":"bcdb6f8255fafa87bc63dccfd4ecf10c84f06bfc3aebb8277dd18d44b5bddd23","abstract_canon_sha256":"ed8b52d7ef391d80db8918c69aa2dba937ab3e95076d671ed932a07596fbb372"},"schema_version":"1.0"},"canonical_sha256":"396fed82ca21a90117b7406d481c4d1a7d13b893d8bdd557e8bc26b8d4ddb934","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:51.741775Z","signature_b64":"huydmnuqv2YqGSArlVyfqvbZLFiBnFSKnTR9yi/Tv09zLwSCsYLB8mPfKtLZZRwMit+hZ5dbJl5DbcN19MQrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"396fed82ca21a90117b7406d481c4d1a7d13b893d8bdd557e8bc26b8d4ddb934","last_reissued_at":"2026-05-18T01:18:51.741334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:51.741334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.06123","source_version":1,"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:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UoTe/9XSib0rk13FgiNBfaL18L8Rq+C5qK3DA7NLIGIUx+RhsXrAjVX1QWbzboFvZyqgDunX9JOi7EpkTYINCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:01:04.627269Z"},"content_sha256":"db298b21bf26a30b7902661f09c6d960d0aa40c4f5886909c52c83769c684917","schema_version":"1.0","event_id":"sha256:db298b21bf26a30b7902661f09c6d960d0aa40c4f5886909c52c83769c684917"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HFX63AWKEGUQCF5XIBWUQHCNDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Lagrange Multipliers for Dependent Rate Allocation in Video Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MM","authors_text":"Ana De Abreu, Fernando Pereira, Gene Cheung, Pascal Frossard","submitted_at":"2016-03-19T18:02:17Z","abstract_excerpt":"In a typical video rate allocation problem, the objective is to optimally distribute a source rate budget among a set of (in)dependently coded data units to minimize the total distortion of all units. Conventional Lagrangian approaches convert the lone rate constraint to a linear rate penalty scaled by a multiplier in the objective, resulting in a simpler unconstrained formulation. However, the search for the \"optimal\" multiplier, one that results in a distortion-minimizing solution among all Lagrangian solutions that satisfy the original rate constraint, remains an elusive open problem in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06123","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"},"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:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCRFs9keaXYdSdu5Y/oMNseUKkelsaOhm5qSZ6TX1aUi/V057Fx/4tN6dw4U/AA7AhNjfXBNpqjAYM6qOZO8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:01:04.627638Z"},"content_sha256":"4752ef6e58501d5757f9c4d59b31f8df7b2f224dfd18338a3ee9b63a0f3ae039","schema_version":"1.0","event_id":"sha256:4752ef6e58501d5757f9c4d59b31f8df7b2f224dfd18338a3ee9b63a0f3ae039"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/bundle.json","state_url":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/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-28T05:01:04Z","links":{"resolver":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ","bundle":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/bundle.json","state":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HFX63AWKEGUQCF5XIBWUQHCNDJ","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":"ed8b52d7ef391d80db8918c69aa2dba937ab3e95076d671ed932a07596fbb372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-03-19T18:02:17Z","title_canon_sha256":"bcdb6f8255fafa87bc63dccfd4ecf10c84f06bfc3aebb8277dd18d44b5bddd23"},"schema_version":"1.0","source":{"id":"1603.06123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.06123","created_at":"2026-05-18T01:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1603.06123v1","created_at":"2026-05-18T01:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06123","created_at":"2026-05-18T01:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"HFX63AWKEGUQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HFX63AWKEGUQCF5X","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HFX63AWK","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:4752ef6e58501d5757f9c4d59b31f8df7b2f224dfd18338a3ee9b63a0f3ae039","target":"graph","created_at":"2026-05-18T01:18:51Z","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 a typical video rate allocation problem, the objective is to optimally distribute a source rate budget among a set of (in)dependently coded data units to minimize the total distortion of all units. Conventional Lagrangian approaches convert the lone rate constraint to a linear rate penalty scaled by a multiplier in the objective, resulting in a simpler unconstrained formulation. However, the search for the \"optimal\" multiplier, one that results in a distortion-minimizing solution among all Lagrangian solutions that satisfy the original rate constraint, remains an elusive open problem in the","authors_text":"Ana De Abreu, Fernando Pereira, Gene Cheung, Pascal Frossard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-03-19T18:02:17Z","title":"Optimal Lagrange Multipliers for Dependent Rate Allocation in Video Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.06123","kind":"arxiv","version":1},"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:db298b21bf26a30b7902661f09c6d960d0aa40c4f5886909c52c83769c684917","target":"record","created_at":"2026-05-18T01:18:51Z","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":"ed8b52d7ef391d80db8918c69aa2dba937ab3e95076d671ed932a07596fbb372","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2016-03-19T18:02:17Z","title_canon_sha256":"bcdb6f8255fafa87bc63dccfd4ecf10c84f06bfc3aebb8277dd18d44b5bddd23"},"schema_version":"1.0","source":{"id":"1603.06123","kind":"arxiv","version":1}},"canonical_sha256":"396fed82ca21a90117b7406d481c4d1a7d13b893d8bdd557e8bc26b8d4ddb934","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"396fed82ca21a90117b7406d481c4d1a7d13b893d8bdd557e8bc26b8d4ddb934","first_computed_at":"2026-05-18T01:18:51.741334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:51.741334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"huydmnuqv2YqGSArlVyfqvbZLFiBnFSKnTR9yi/Tv09zLwSCsYLB8mPfKtLZZRwMit+hZ5dbJl5DbcN19MQrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:51.741775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.06123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db298b21bf26a30b7902661f09c6d960d0aa40c4f5886909c52c83769c684917","sha256:4752ef6e58501d5757f9c4d59b31f8df7b2f224dfd18338a3ee9b63a0f3ae039"],"state_sha256":"1478255f973ae9d7a1b5cda332ac872d2612b10aeeb53b6a2acd55f68f77a10d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3XEe4P1jjYtDYc4Vv6AtMm02KclUmjf2y5oEjLRdtHYt5s4RboAI7nnoCwVbaClIiCouMiczvHUwhwyooktODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:01:04.629613Z","bundle_sha256":"939ad75f88d10a038da770a582e08949aaaae28f1b5d9a3e71c106ec23c923ef"}}