{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HFX63AWKEGUQCF5XIBWUQHCNDJ","short_pith_number":"pith:HFX63AWK","schema_version":"1.0","canonical_sha256":"396fed82ca21a90117b7406d481c4d1a7d13b893d8bdd557e8bc26b8d4ddb934","source":{"kind":"arxiv","id":"1603.06123","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1603.06123","created_at":"2026-05-18T01:18:51.741405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.06123v1","created_at":"2026-05-18T01:18:51.741405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.06123","created_at":"2026-05-18T01:18:51.741405+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFX63AWKEGUQ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFX63AWKEGUQCF5X","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFX63AWK","created_at":"2026-05-18T12:30:19.053100+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/HFX63AWKEGUQCF5XIBWUQHCNDJ","json":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ.json","graph_json":"https://pith.science/api/pith-number/HFX63AWKEGUQCF5XIBWUQHCNDJ/graph.json","events_json":"https://pith.science/api/pith-number/HFX63AWKEGUQCF5XIBWUQHCNDJ/events.json","paper":"https://pith.science/paper/HFX63AWK"},"agent_actions":{"view_html":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ","download_json":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ.json","view_paper":"https://pith.science/paper/HFX63AWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.06123&json=true","fetch_graph":"https://pith.science/api/pith-number/HFX63AWKEGUQCF5XIBWUQHCNDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HFX63AWKEGUQCF5XIBWUQHCNDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/action/storage_attestation","attest_author":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/action/author_attestation","sign_citation":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/action/citation_signature","submit_replication":"https://pith.science/pith/HFX63AWKEGUQCF5XIBWUQHCNDJ/action/replication_record"}},"created_at":"2026-05-18T01:18:51.741405+00:00","updated_at":"2026-05-18T01:18:51.741405+00:00"}