{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VLFDM5IORDUTOKSMV7PSK7MWJP","short_pith_number":"pith:VLFDM5IO","schema_version":"1.0","canonical_sha256":"aaca36750e88e9372a4cafdf257d964bd391a642e953169ca1c979cbc2a73d2b","source":{"kind":"arxiv","id":"2306.07581","version":2},"attestation_state":"computed","paper":{"title":"Binary Radiance Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jaesik Park, Seungjoo Shin","submitted_at":"2023-06-13T07:11:10Z","abstract_excerpt":"In this paper, we propose \\textit{binary radiance fields} (BiRF), a storage-efficient radiance field representation employing binary feature encoding that encodes local features using binary encoding parameters in a format of either $+1$ or $-1$. This binarization strategy lets us represent the feature grid with highly compact feature encoding and a dramatic reduction in storage size. Furthermore, our 2D-3D hybrid feature grid design enhances the compactness of feature encoding as the 3D grid includes main components while 2D grids capture details. In our experiments, binary radiance field rep"},"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":"2306.07581","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2023-06-13T07:11:10Z","cross_cats_sorted":[],"title_canon_sha256":"9bd28271b5143d137fdd807bc720baf4f59f7ce92888a4bb69a5f76cd0073ccd","abstract_canon_sha256":"ce9ec2ad2d60f05f320d86e91ac607806cc08d5fa8886620d97195414e316f86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:46.038410Z","signature_b64":"arkrLemkbYlvz5/ZJ3HVUp7EJhDWaOZJdN8wUb+W4Dqavfuqttxc/cwUT0W2wavV22lnbr1G7Pt7wTESWzspDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaca36750e88e9372a4cafdf257d964bd391a642e953169ca1c979cbc2a73d2b","last_reissued_at":"2026-07-05T07:19:46.037946Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:46.037946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Radiance Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jaesik Park, Seungjoo Shin","submitted_at":"2023-06-13T07:11:10Z","abstract_excerpt":"In this paper, we propose \\textit{binary radiance fields} (BiRF), a storage-efficient radiance field representation employing binary feature encoding that encodes local features using binary encoding parameters in a format of either $+1$ or $-1$. This binarization strategy lets us represent the feature grid with highly compact feature encoding and a dramatic reduction in storage size. Furthermore, our 2D-3D hybrid feature grid design enhances the compactness of feature encoding as the 3D grid includes main components while 2D grids capture details. In our experiments, binary radiance field rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.07581","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/2306.07581/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":"2306.07581","created_at":"2026-07-05T07:19:46.037996+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.07581v2","created_at":"2026-07-05T07:19:46.037996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.07581","created_at":"2026-07-05T07:19:46.037996+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLFDM5IORDUT","created_at":"2026-07-05T07:19:46.037996+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLFDM5IORDUTOKSM","created_at":"2026-07-05T07:19:46.037996+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLFDM5IO","created_at":"2026-07-05T07:19:46.037996+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.26799","citing_title":"MesonGS++: Post-training Compression of 3D Gaussian Splatting with Hyperparameter Searching","ref_index":117,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26799","citing_title":"MesonGS++: Post-training Compression of 3D Gaussian Splatting with Hyperparameter Searching","ref_index":117,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VLFDM5IORDUTOKSMV7PSK7MWJP","json":"https://pith.science/pith/VLFDM5IORDUTOKSMV7PSK7MWJP.json","graph_json":"https://pith.science/api/pith-number/VLFDM5IORDUTOKSMV7PSK7MWJP/graph.json","events_json":"https://pith.science/api/pith-number/VLFDM5IORDUTOKSMV7PSK7MWJP/events.json","paper":"https://pith.science/paper/VLFDM5IO"},"agent_actions":{"view_html":"https://pith.science/pith/VLFDM5IORDUTOKSMV7PSK7MWJP","download_json":"https://pith.science/pith/VLFDM5IORDUTOKSMV7PSK7MWJP.json","view_paper":"https://pith.science/paper/VLFDM5IO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.07581&json=true","fetch_graph":"https://pith.science/api/pith-number/VLFDM5IORDUTOKSMV7PSK7MWJP/graph.json","fetch_events":"https://pith.science/api/pith-number/VLFDM5IORDUTOKSMV7PSK7MWJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLFDM5IORDUTOKSMV7PSK7MWJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLFDM5IORDUTOKSMV7PSK7MWJP/action/storage_attestation","attest_author":"https://pith.science/pith/VLFDM5IORDUTOKSMV7PSK7MWJP/action/author_attestation","sign_citation":"https://pith.science/pith/VLFDM5IORDUTOKSMV7PSK7MWJP/action/citation_signature","submit_replication":"https://pith.science/pith/VLFDM5IORDUTOKSMV7PSK7MWJP/action/replication_record"}},"created_at":"2026-07-05T07:19:46.037996+00:00","updated_at":"2026-07-05T07:19:46.037996+00:00"}