{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OJNSMZW3IU7BRSLSPHTU2WYCV5","short_pith_number":"pith:OJNSMZW3","canonical_record":{"source":{"id":"1710.01218","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2017-09-19T02:02:00Z","cross_cats_sorted":[],"title_canon_sha256":"01d02e1ff38b440be75ebc4f6b78b91401329141bd0f9956e2ec033e26e4e35f","abstract_canon_sha256":"420cb8408de5b695f26a613097cf7178b1ece4786a4a9a0fbc93a230519601d0"},"schema_version":"1.0"},"canonical_sha256":"725b2666db453e18c97279e74d5b02af6db5969896eb883efec9ad073aab981b","source":{"kind":"arxiv","id":"1710.01218","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01218","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01218v3","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01218","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"pith_short_12","alias_value":"OJNSMZW3IU7B","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJNSMZW3IU7BRSLS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJNSMZW3","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OJNSMZW3IU7BRSLSPHTU2WYCV5","target":"record","payload":{"canonical_record":{"source":{"id":"1710.01218","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2017-09-19T02:02:00Z","cross_cats_sorted":[],"title_canon_sha256":"01d02e1ff38b440be75ebc4f6b78b91401329141bd0f9956e2ec033e26e4e35f","abstract_canon_sha256":"420cb8408de5b695f26a613097cf7178b1ece4786a4a9a0fbc93a230519601d0"},"schema_version":"1.0"},"canonical_sha256":"725b2666db453e18c97279e74d5b02af6db5969896eb883efec9ad073aab981b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:08.338366Z","signature_b64":"Xh6rmy7OPFwktb+G9F4/JifEf4Y6tpMAPlX5ct+4q4btgEzUlsx5VJrEfRGkuQkOd/z6B7xF5uZdieTZJ4dYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"725b2666db453e18c97279e74d5b02af6db5969896eb883efec9ad073aab981b","last_reissued_at":"2026-05-17T23:52:08.337866Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:08.337866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.01218","source_version":3,"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:52:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PC8JBJrfV1Mzkw9tImh5pMDPbo5YOczf5I4EDf6/2pCxE1SAUhPeNIgE1ytwDhKhOJ6LD84s/M2Yt3tTG1V4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:10:16.423771Z"},"content_sha256":"52d64a675177469d30b97291e37d556bb69c50c921360e4e0ecd31601f7871dc","schema_version":"1.0","event_id":"sha256:52d64a675177469d30b97291e37d556bb69c50c921360e4e0ecd31601f7871dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OJNSMZW3IU7BRSLSPHTU2WYCV5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reducing Complexity of HEVC: A Deep Learning Approach","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mai Xu, Ren Yang, Tianyi Li, Xin Deng, Zhenyu Guan, Zulin Wang","submitted_at":"2017-09-19T02:02:00Z","abstract_excerpt":"High Efficiency Video Coding (HEVC) significantly reduces bit-rates over the proceeding H.264 standard but at the expense of extremely high encoding complexity. In HEVC, the quad-tree partition of coding unit (CU) consumes a large proportion of the HEVC encoding complexity, due to the bruteforce search for rate-distortion optimization (RDO). Therefore, this paper proposes a deep learning approach to predict the CU partition for reducing the HEVC complexity at both intra- and inter-modes, which is based on convolutional neural network (CNN) and long- and short-term memory (LSTM) network. First,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01218","kind":"arxiv","version":3},"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:52:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2eHIvT2YolO4fe5yELSSL2fmEzjrFUMmzTOdrE6EtLuOGMKAQSOVNlQF34LN8drNNnmygfP+AiG1vnEg/VxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:10:16.424451Z"},"content_sha256":"1c983049bb0dc1b20e19edb5a8317b2b1bf8b7c840011fa5bea2255b08097d54","schema_version":"1.0","event_id":"sha256:1c983049bb0dc1b20e19edb5a8317b2b1bf8b7c840011fa5bea2255b08097d54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OJNSMZW3IU7BRSLSPHTU2WYCV5/bundle.json","state_url":"https://pith.science/pith/OJNSMZW3IU7BRSLSPHTU2WYCV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OJNSMZW3IU7BRSLSPHTU2WYCV5/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-28T21:10:16Z","links":{"resolver":"https://pith.science/pith/OJNSMZW3IU7BRSLSPHTU2WYCV5","bundle":"https://pith.science/pith/OJNSMZW3IU7BRSLSPHTU2WYCV5/bundle.json","state":"https://pith.science/pith/OJNSMZW3IU7BRSLSPHTU2WYCV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OJNSMZW3IU7BRSLSPHTU2WYCV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OJNSMZW3IU7BRSLSPHTU2WYCV5","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":"420cb8408de5b695f26a613097cf7178b1ece4786a4a9a0fbc93a230519601d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2017-09-19T02:02:00Z","title_canon_sha256":"01d02e1ff38b440be75ebc4f6b78b91401329141bd0f9956e2ec033e26e4e35f"},"schema_version":"1.0","source":{"id":"1710.01218","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01218","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01218v3","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01218","created_at":"2026-05-17T23:52:08Z"},{"alias_kind":"pith_short_12","alias_value":"OJNSMZW3IU7B","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OJNSMZW3IU7BRSLS","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OJNSMZW3","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:1c983049bb0dc1b20e19edb5a8317b2b1bf8b7c840011fa5bea2255b08097d54","target":"graph","created_at":"2026-05-17T23:52:08Z","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":"High Efficiency Video Coding (HEVC) significantly reduces bit-rates over the proceeding H.264 standard but at the expense of extremely high encoding complexity. In HEVC, the quad-tree partition of coding unit (CU) consumes a large proportion of the HEVC encoding complexity, due to the bruteforce search for rate-distortion optimization (RDO). Therefore, this paper proposes a deep learning approach to predict the CU partition for reducing the HEVC complexity at both intra- and inter-modes, which is based on convolutional neural network (CNN) and long- and short-term memory (LSTM) network. First,","authors_text":"Mai Xu, Ren Yang, Tianyi Li, Xin Deng, Zhenyu Guan, Zulin Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2017-09-19T02:02:00Z","title":"Reducing Complexity of HEVC: A Deep Learning Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01218","kind":"arxiv","version":3},"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:52d64a675177469d30b97291e37d556bb69c50c921360e4e0ecd31601f7871dc","target":"record","created_at":"2026-05-17T23:52:08Z","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":"420cb8408de5b695f26a613097cf7178b1ece4786a4a9a0fbc93a230519601d0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2017-09-19T02:02:00Z","title_canon_sha256":"01d02e1ff38b440be75ebc4f6b78b91401329141bd0f9956e2ec033e26e4e35f"},"schema_version":"1.0","source":{"id":"1710.01218","kind":"arxiv","version":3}},"canonical_sha256":"725b2666db453e18c97279e74d5b02af6db5969896eb883efec9ad073aab981b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"725b2666db453e18c97279e74d5b02af6db5969896eb883efec9ad073aab981b","first_computed_at":"2026-05-17T23:52:08.337866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:08.337866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xh6rmy7OPFwktb+G9F4/JifEf4Y6tpMAPlX5ct+4q4btgEzUlsx5VJrEfRGkuQkOd/z6B7xF5uZdieTZJ4dYDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:08.338366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01218","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52d64a675177469d30b97291e37d556bb69c50c921360e4e0ecd31601f7871dc","sha256:1c983049bb0dc1b20e19edb5a8317b2b1bf8b7c840011fa5bea2255b08097d54"],"state_sha256":"90d620de0aa2326056281bb946f06e51650b5191922915209bd845cf35c4e12e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULHudFaKWSddNuRD5tB1P3B9siJRiF5KKiOyZ7GFnJrefA/GmRIz0kdfrGmHOx8Rc3gDvWsO7htgyusDsGOjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:10:16.428100Z","bundle_sha256":"dad530885ce271b3d35de29cbe4104caee5c0f8587c16830e566005a4850cda8"}}