{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QSAE6IQLENORYBEVVS3IG4HMOV","short_pith_number":"pith:QSAE6IQL","schema_version":"1.0","canonical_sha256":"84804f220b235d1c0495acb68370ec754f3482c6f6586243f3bcc1ebae6fbbd3","source":{"kind":"arxiv","id":"2606.26913","version":1},"attestation_state":"computed","paper":{"title":"Neural Texture Compression using Hypernetworks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.GR","authors_text":"Belcour Laurent","submitted_at":"2026-06-25T11:52:11Z","abstract_excerpt":"Recent work on neural texture compression has demonstrated that it is possible to learn small, per-material texture representations (composed of latent textures and a small Multi-Layer Perceptron decoder) that can be decoded in real-time during shading to reproduce the input to a physically based shading model. However, existing methods require performing gradient-descent optimization per material for a given MLP and latent configuration. In this work, we train a single hypernetwork that outputs both the latent features and the MLP's weights and biases. Though the solution space is high-dimens"},"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":"2606.26913","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GR","submitted_at":"2026-06-25T11:52:11Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"4721e8c26d7d264bdc87053b9ffbc88932621e85dc0d151c1b3ee9f30ee31bed","abstract_canon_sha256":"c4c82f35fc83f397d19ad87840a9994184879270e71d96dc36a20e6695d04142"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:16:03.955178Z","signature_b64":"symIZ5RFsEkPLI+sDIyXdswydLTmuWabQUOBeyUk59uazHbTUS3V/IThqFg343oFfoHFiE2/uVfncuEx151fCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84804f220b235d1c0495acb68370ec754f3482c6f6586243f3bcc1ebae6fbbd3","last_reissued_at":"2026-06-26T01:16:03.954781Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:16:03.954781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Texture Compression using Hypernetworks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.GR","authors_text":"Belcour Laurent","submitted_at":"2026-06-25T11:52:11Z","abstract_excerpt":"Recent work on neural texture compression has demonstrated that it is possible to learn small, per-material texture representations (composed of latent textures and a small Multi-Layer Perceptron decoder) that can be decoded in real-time during shading to reproduce the input to a physically based shading model. However, existing methods require performing gradient-descent optimization per material for a given MLP and latent configuration. In this work, we train a single hypernetwork that outputs both the latent features and the MLP's weights and biases. Though the solution space is high-dimens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26913","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/2606.26913/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":"2606.26913","created_at":"2026-06-26T01:16:03.954836+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26913v1","created_at":"2026-06-26T01:16:03.954836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26913","created_at":"2026-06-26T01:16:03.954836+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSAE6IQLENOR","created_at":"2026-06-26T01:16:03.954836+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSAE6IQLENORYBEV","created_at":"2026-06-26T01:16:03.954836+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSAE6IQL","created_at":"2026-06-26T01:16:03.954836+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/QSAE6IQLENORYBEVVS3IG4HMOV","json":"https://pith.science/pith/QSAE6IQLENORYBEVVS3IG4HMOV.json","graph_json":"https://pith.science/api/pith-number/QSAE6IQLENORYBEVVS3IG4HMOV/graph.json","events_json":"https://pith.science/api/pith-number/QSAE6IQLENORYBEVVS3IG4HMOV/events.json","paper":"https://pith.science/paper/QSAE6IQL"},"agent_actions":{"view_html":"https://pith.science/pith/QSAE6IQLENORYBEVVS3IG4HMOV","download_json":"https://pith.science/pith/QSAE6IQLENORYBEVVS3IG4HMOV.json","view_paper":"https://pith.science/paper/QSAE6IQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26913&json=true","fetch_graph":"https://pith.science/api/pith-number/QSAE6IQLENORYBEVVS3IG4HMOV/graph.json","fetch_events":"https://pith.science/api/pith-number/QSAE6IQLENORYBEVVS3IG4HMOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSAE6IQLENORYBEVVS3IG4HMOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSAE6IQLENORYBEVVS3IG4HMOV/action/storage_attestation","attest_author":"https://pith.science/pith/QSAE6IQLENORYBEVVS3IG4HMOV/action/author_attestation","sign_citation":"https://pith.science/pith/QSAE6IQLENORYBEVVS3IG4HMOV/action/citation_signature","submit_replication":"https://pith.science/pith/QSAE6IQLENORYBEVVS3IG4HMOV/action/replication_record"}},"created_at":"2026-06-26T01:16:03.954836+00:00","updated_at":"2026-06-26T01:16:03.954836+00:00"}