{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4FDJF7PSIFCWGCCNMBMI7N6UW6","short_pith_number":"pith:4FDJF7PS","schema_version":"1.0","canonical_sha256":"e14692fdf2414563084d60588fb7d4b7be8199eeb4ca6b13c8970db2e926b3d2","source":{"kind":"arxiv","id":"2005.10801","version":1},"attestation_state":"computed","paper":{"title":"Complexity Analysis Of Next-Generation VVC Encoding and Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","eess.IV"],"primary_cat":"cs.MM","authors_text":"Farhad Pakdaman, Mahmoud Reza Hashemi, Mohammad Ali Adelimanesh, Moncef Gabbouj","submitted_at":"2020-05-21T17:30:42Z","abstract_excerpt":"While the next generation video compression standard, Versatile Video Coding (VVC), provides a superior compression efficiency, its computational complexity dramatically increases. This paper thoroughly analyzes this complexity for both encoder and decoder of VVC Test Model 6, by quantifying the complexity break-down for each coding tool and measuring the complexity and memory requirements for VVC encoding/decoding. These extensive analyses are performed for six video sequences of 720p, 1080p, and 2160p, under Low-Delay (LD), Random-Access (RA), and All-Intra (AI) conditions (a total of 320 en"},"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":"2005.10801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MM","submitted_at":"2020-05-21T17:30:42Z","cross_cats_sorted":["cs.CC","eess.IV"],"title_canon_sha256":"4a8f53ee63aa9e210f089ebba91914d87ed369ca59e88cded622e6cfbae2c44f","abstract_canon_sha256":"8fd703164bcea23d5812e0e62c281bb5004cb7686f04aef2e9ff0e54a7063ff5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:08.090597Z","signature_b64":"7eEIGw3fEgwIPCK3wVxBCEbRzxxpeHvd+XTjeXQ6mXfC9bMyFA8fbFsq+vyHSPJMLnRsyHrc+QCcE4mZZtpKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e14692fdf2414563084d60588fb7d4b7be8199eeb4ca6b13c8970db2e926b3d2","last_reissued_at":"2026-07-05T01:41:08.090111Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:08.090111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Analysis Of Next-Generation VVC Encoding and Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","eess.IV"],"primary_cat":"cs.MM","authors_text":"Farhad Pakdaman, Mahmoud Reza Hashemi, Mohammad Ali Adelimanesh, Moncef Gabbouj","submitted_at":"2020-05-21T17:30:42Z","abstract_excerpt":"While the next generation video compression standard, Versatile Video Coding (VVC), provides a superior compression efficiency, its computational complexity dramatically increases. This paper thoroughly analyzes this complexity for both encoder and decoder of VVC Test Model 6, by quantifying the complexity break-down for each coding tool and measuring the complexity and memory requirements for VVC encoding/decoding. These extensive analyses are performed for six video sequences of 720p, 1080p, and 2160p, under Low-Delay (LD), Random-Access (RA), and All-Intra (AI) conditions (a total of 320 en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.10801","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.10801/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.10801","created_at":"2026-07-05T01:41:08.090168+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.10801v1","created_at":"2026-07-05T01:41:08.090168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.10801","created_at":"2026-07-05T01:41:08.090168+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FDJF7PSIFCW","created_at":"2026-07-05T01:41:08.090168+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FDJF7PSIFCWGCCN","created_at":"2026-07-05T01:41:08.090168+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FDJF7PS","created_at":"2026-07-05T01:41:08.090168+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/4FDJF7PSIFCWGCCNMBMI7N6UW6","json":"https://pith.science/pith/4FDJF7PSIFCWGCCNMBMI7N6UW6.json","graph_json":"https://pith.science/api/pith-number/4FDJF7PSIFCWGCCNMBMI7N6UW6/graph.json","events_json":"https://pith.science/api/pith-number/4FDJF7PSIFCWGCCNMBMI7N6UW6/events.json","paper":"https://pith.science/paper/4FDJF7PS"},"agent_actions":{"view_html":"https://pith.science/pith/4FDJF7PSIFCWGCCNMBMI7N6UW6","download_json":"https://pith.science/pith/4FDJF7PSIFCWGCCNMBMI7N6UW6.json","view_paper":"https://pith.science/paper/4FDJF7PS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.10801&json=true","fetch_graph":"https://pith.science/api/pith-number/4FDJF7PSIFCWGCCNMBMI7N6UW6/graph.json","fetch_events":"https://pith.science/api/pith-number/4FDJF7PSIFCWGCCNMBMI7N6UW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FDJF7PSIFCWGCCNMBMI7N6UW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FDJF7PSIFCWGCCNMBMI7N6UW6/action/storage_attestation","attest_author":"https://pith.science/pith/4FDJF7PSIFCWGCCNMBMI7N6UW6/action/author_attestation","sign_citation":"https://pith.science/pith/4FDJF7PSIFCWGCCNMBMI7N6UW6/action/citation_signature","submit_replication":"https://pith.science/pith/4FDJF7PSIFCWGCCNMBMI7N6UW6/action/replication_record"}},"created_at":"2026-07-05T01:41:08.090168+00:00","updated_at":"2026-07-05T01:41:08.090168+00:00"}