{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SQGT2XF5NJXCRLAMSV2MNGGIP7","short_pith_number":"pith:SQGT2XF5","schema_version":"1.0","canonical_sha256":"940d3d5cbd6a6e28ac0c9574c698c87fdf9e68e031950480d03b58c0f6b3fe34","source":{"kind":"arxiv","id":"2501.12060","version":2},"attestation_state":"computed","paper":{"title":"GSVC: Efficient Video Representation and Compression Through 2D Gaussian Splatting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Longan Wang, Wei Tsang Ooi, Yuang Shi","submitted_at":"2025-01-21T11:30:51Z","abstract_excerpt":"3D Gaussian splats have emerged as a revolutionary, effective, learned representation for static 3D scenes. In this work, we explore using 2D Gaussian splats as a new primitive for representing videos. We propose GSVC, an approach to learning a set of 2D Gaussian splats that can effectively represent and compress video frames. GSVC incorporates the following techniques: (i) To exploit temporal redundancy among adjacent frames, which can speed up training and improve the compression efficiency, we predict the Gaussian splats of a frame based on its previous frame; (ii) To control the trade-offs"},"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":"2501.12060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-01-21T11:30:51Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"10b50bb5c6065801e9e846919ee950063957a5aa34364a27476cd40f0565b7d4","abstract_canon_sha256":"9150da37aad2437abd5f59007058bf2be15085fe4b0c5182b19e386b489e18d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:52.037484Z","signature_b64":"+zqVkCtN6FvtOPfv3xTJzqRwwTXXh8V+0yiMs/7xHeRkUxc7OVj9ME0ooi56bNMeGlpGauUljHzLGZbZeKoQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"940d3d5cbd6a6e28ac0c9574c698c87fdf9e68e031950480d03b58c0f6b3fe34","last_reissued_at":"2026-07-05T10:03:52.037035Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:52.037035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GSVC: Efficient Video Representation and Compression Through 2D Gaussian Splatting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.CV","authors_text":"Longan Wang, Wei Tsang Ooi, Yuang Shi","submitted_at":"2025-01-21T11:30:51Z","abstract_excerpt":"3D Gaussian splats have emerged as a revolutionary, effective, learned representation for static 3D scenes. In this work, we explore using 2D Gaussian splats as a new primitive for representing videos. We propose GSVC, an approach to learning a set of 2D Gaussian splats that can effectively represent and compress video frames. GSVC incorporates the following techniques: (i) To exploit temporal redundancy among adjacent frames, which can speed up training and improve the compression efficiency, we predict the Gaussian splats of a frame based on its previous frame; (ii) To control the trade-offs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.12060","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.12060/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":"2501.12060","created_at":"2026-07-05T10:03:52.037097+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.12060v2","created_at":"2026-07-05T10:03:52.037097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.12060","created_at":"2026-07-05T10:03:52.037097+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQGT2XF5NJXC","created_at":"2026-07-05T10:03:52.037097+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQGT2XF5NJXCRLAM","created_at":"2026-07-05T10:03:52.037097+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQGT2XF5","created_at":"2026-07-05T10:03:52.037097+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01862","citing_title":"Motivic Hochschild homology of mod 2 motivic cohomology over algebraically closed fields","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SQGT2XF5NJXCRLAMSV2MNGGIP7","json":"https://pith.science/pith/SQGT2XF5NJXCRLAMSV2MNGGIP7.json","graph_json":"https://pith.science/api/pith-number/SQGT2XF5NJXCRLAMSV2MNGGIP7/graph.json","events_json":"https://pith.science/api/pith-number/SQGT2XF5NJXCRLAMSV2MNGGIP7/events.json","paper":"https://pith.science/paper/SQGT2XF5"},"agent_actions":{"view_html":"https://pith.science/pith/SQGT2XF5NJXCRLAMSV2MNGGIP7","download_json":"https://pith.science/pith/SQGT2XF5NJXCRLAMSV2MNGGIP7.json","view_paper":"https://pith.science/paper/SQGT2XF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.12060&json=true","fetch_graph":"https://pith.science/api/pith-number/SQGT2XF5NJXCRLAMSV2MNGGIP7/graph.json","fetch_events":"https://pith.science/api/pith-number/SQGT2XF5NJXCRLAMSV2MNGGIP7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQGT2XF5NJXCRLAMSV2MNGGIP7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQGT2XF5NJXCRLAMSV2MNGGIP7/action/storage_attestation","attest_author":"https://pith.science/pith/SQGT2XF5NJXCRLAMSV2MNGGIP7/action/author_attestation","sign_citation":"https://pith.science/pith/SQGT2XF5NJXCRLAMSV2MNGGIP7/action/citation_signature","submit_replication":"https://pith.science/pith/SQGT2XF5NJXCRLAMSV2MNGGIP7/action/replication_record"}},"created_at":"2026-07-05T10:03:52.037097+00:00","updated_at":"2026-07-05T10:03:52.037097+00:00"}