{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QYW5V7IMTPMTQCKET5ZQL6JVXX","short_pith_number":"pith:QYW5V7IM","schema_version":"1.0","canonical_sha256":"862ddafd0c9bd93809449f7305f935bddddf28de3093bb228853ab086bd4d201","source":{"kind":"arxiv","id":"2407.09543","version":2},"attestation_state":"computed","paper":{"title":"Neural Texture Block Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"eess.IV","authors_text":"Shin Fujieda, Takahiro Harada","submitted_at":"2024-06-27T01:50:11Z","abstract_excerpt":"Block compression is a widely used technique to compress textures in real-time graphics applications, offering a reduction in storage size. However, their storage efficiency is constrained by the fixed compression ratio, which substantially increases storage size when hundreds of high-quality textures are required. In this paper, we propose a novel block texture compression method with neural networks, Neural Texture Block Compression (NTBC). NTBC learns the mapping from uncompressed textures to block-compressed textures, which allows for significantly reduced storage costs without any change "},"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":"2407.09543","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2024-06-27T01:50:11Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"0c0fee9458ac427848f3ea225a1549a0acf48efe4d1147517d3dca10719d2a46","abstract_canon_sha256":"52e01a81f54f179640f66462dbbf502ed02312054e21d46f35906bb04b937ea3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:24:36.623241Z","signature_b64":"zEdQktbkhgoWikx/cyZ7PIVvdCjA/aitFy0YdBchpfvCKAONOZFtZC1tn8VtGn4ggOqRtXh8BfbY14As5Qx9Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"862ddafd0c9bd93809449f7305f935bddddf28de3093bb228853ab086bd4d201","last_reissued_at":"2026-07-05T09:24:36.622667Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:24:36.622667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Texture Block Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"eess.IV","authors_text":"Shin Fujieda, Takahiro Harada","submitted_at":"2024-06-27T01:50:11Z","abstract_excerpt":"Block compression is a widely used technique to compress textures in real-time graphics applications, offering a reduction in storage size. However, their storage efficiency is constrained by the fixed compression ratio, which substantially increases storage size when hundreds of high-quality textures are required. In this paper, we propose a novel block texture compression method with neural networks, Neural Texture Block Compression (NTBC). NTBC learns the mapping from uncompressed textures to block-compressed textures, which allows for significantly reduced storage costs without any change "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09543","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/2407.09543/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":"2407.09543","created_at":"2026-07-05T09:24:36.622729+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.09543v2","created_at":"2026-07-05T09:24:36.622729+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09543","created_at":"2026-07-05T09:24:36.622729+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYW5V7IMTPMT","created_at":"2026-07-05T09:24:36.622729+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYW5V7IMTPMTQCKE","created_at":"2026-07-05T09:24:36.622729+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYW5V7IM","created_at":"2026-07-05T09:24:36.622729+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.08161","citing_title":"GATE: Geometry-Aware Trained Encoding","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QYW5V7IMTPMTQCKET5ZQL6JVXX","json":"https://pith.science/pith/QYW5V7IMTPMTQCKET5ZQL6JVXX.json","graph_json":"https://pith.science/api/pith-number/QYW5V7IMTPMTQCKET5ZQL6JVXX/graph.json","events_json":"https://pith.science/api/pith-number/QYW5V7IMTPMTQCKET5ZQL6JVXX/events.json","paper":"https://pith.science/paper/QYW5V7IM"},"agent_actions":{"view_html":"https://pith.science/pith/QYW5V7IMTPMTQCKET5ZQL6JVXX","download_json":"https://pith.science/pith/QYW5V7IMTPMTQCKET5ZQL6JVXX.json","view_paper":"https://pith.science/paper/QYW5V7IM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.09543&json=true","fetch_graph":"https://pith.science/api/pith-number/QYW5V7IMTPMTQCKET5ZQL6JVXX/graph.json","fetch_events":"https://pith.science/api/pith-number/QYW5V7IMTPMTQCKET5ZQL6JVXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYW5V7IMTPMTQCKET5ZQL6JVXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYW5V7IMTPMTQCKET5ZQL6JVXX/action/storage_attestation","attest_author":"https://pith.science/pith/QYW5V7IMTPMTQCKET5ZQL6JVXX/action/author_attestation","sign_citation":"https://pith.science/pith/QYW5V7IMTPMTQCKET5ZQL6JVXX/action/citation_signature","submit_replication":"https://pith.science/pith/QYW5V7IMTPMTQCKET5ZQL6JVXX/action/replication_record"}},"created_at":"2026-07-05T09:24:36.622729+00:00","updated_at":"2026-07-05T09:24:36.622729+00:00"}