{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JEAJ3WPKD2OCXX3DBYB3MQW4TM","short_pith_number":"pith:JEAJ3WPK","schema_version":"1.0","canonical_sha256":"49009dd9ea1e9c2bdf630e03b642dc9b199424d19680551bf625bd1527eb2810","source":{"kind":"arxiv","id":"2311.12831","version":4},"attestation_state":"computed","paper":{"title":"ECNR: Efficient Compressive Neural Representation of Time-Varying Volumetric Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Chaoli Wang, Kaiyuan Tang","submitted_at":"2023-10-02T06:06:32Z","abstract_excerpt":"Due to its conceptual simplicity and generality, compressive neural representation has emerged as a promising alternative to traditional compression methods for managing massive volumetric datasets. The current practice of neural compression utilizes a single large multilayer perceptron (MLP) to encode the global volume, incurring slow training and inference. This paper presents an efficient compressive neural representation (ECNR) solution for time-varying data compression, utilizing the Laplacian pyramid for adaptive signal fitting. Following a multiscale structure, we leverage multiple smal"},"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":"2311.12831","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-10-02T06:06:32Z","cross_cats_sorted":["cs.GR","cs.LG"],"title_canon_sha256":"3813d4405b48ec051795ea2ccb4fb56185d8330183656400f75906d7957cc1e3","abstract_canon_sha256":"8bbb2b733d14afbf081f9d5b22b59fd77f1019f26e438aa6f7da0d4e1571c286"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:06.202908Z","signature_b64":"ng6m+wPJN3xFIPgI66CC8zjtRkbEoQ/+JJXEYZR2JOOa2CdCM9DteUS39+kT/8AhMTbgjngCW5y5kcrlkqxMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49009dd9ea1e9c2bdf630e03b642dc9b199424d19680551bf625bd1527eb2810","last_reissued_at":"2026-07-05T07:54:06.202444Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:06.202444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ECNR: Efficient Compressive Neural Representation of Time-Varying Volumetric Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Chaoli Wang, Kaiyuan Tang","submitted_at":"2023-10-02T06:06:32Z","abstract_excerpt":"Due to its conceptual simplicity and generality, compressive neural representation has emerged as a promising alternative to traditional compression methods for managing massive volumetric datasets. The current practice of neural compression utilizes a single large multilayer perceptron (MLP) to encode the global volume, incurring slow training and inference. This paper presents an efficient compressive neural representation (ECNR) solution for time-varying data compression, utilizing the Laplacian pyramid for adaptive signal fitting. Following a multiscale structure, we leverage multiple smal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.12831","kind":"arxiv","version":4},"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/2311.12831/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":"2311.12831","created_at":"2026-07-05T07:54:06.202503+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.12831v4","created_at":"2026-07-05T07:54:06.202503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.12831","created_at":"2026-07-05T07:54:06.202503+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEAJ3WPKD2OC","created_at":"2026-07-05T07:54:06.202503+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEAJ3WPKD2OCXX3D","created_at":"2026-07-05T07:54:06.202503+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEAJ3WPK","created_at":"2026-07-05T07:54:06.202503+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03836","citing_title":"F-Hash: Feature-Based Hash Design for Time-Varying Volume Visualization via Multi-Resolution Tesseract Encoding","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JEAJ3WPKD2OCXX3DBYB3MQW4TM","json":"https://pith.science/pith/JEAJ3WPKD2OCXX3DBYB3MQW4TM.json","graph_json":"https://pith.science/api/pith-number/JEAJ3WPKD2OCXX3DBYB3MQW4TM/graph.json","events_json":"https://pith.science/api/pith-number/JEAJ3WPKD2OCXX3DBYB3MQW4TM/events.json","paper":"https://pith.science/paper/JEAJ3WPK"},"agent_actions":{"view_html":"https://pith.science/pith/JEAJ3WPKD2OCXX3DBYB3MQW4TM","download_json":"https://pith.science/pith/JEAJ3WPKD2OCXX3DBYB3MQW4TM.json","view_paper":"https://pith.science/paper/JEAJ3WPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.12831&json=true","fetch_graph":"https://pith.science/api/pith-number/JEAJ3WPKD2OCXX3DBYB3MQW4TM/graph.json","fetch_events":"https://pith.science/api/pith-number/JEAJ3WPKD2OCXX3DBYB3MQW4TM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEAJ3WPKD2OCXX3DBYB3MQW4TM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEAJ3WPKD2OCXX3DBYB3MQW4TM/action/storage_attestation","attest_author":"https://pith.science/pith/JEAJ3WPKD2OCXX3DBYB3MQW4TM/action/author_attestation","sign_citation":"https://pith.science/pith/JEAJ3WPKD2OCXX3DBYB3MQW4TM/action/citation_signature","submit_replication":"https://pith.science/pith/JEAJ3WPKD2OCXX3DBYB3MQW4TM/action/replication_record"}},"created_at":"2026-07-05T07:54:06.202503+00:00","updated_at":"2026-07-05T07:54:06.202503+00:00"}