{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OUSNBYGWAWFD7ZXC7VZIFLVYRU","short_pith_number":"pith:OUSNBYGW","schema_version":"1.0","canonical_sha256":"7524d0e0d6058a3fe6e2fd7282aeb88d13042be50318cce2fb84d992d0505426","source":{"kind":"arxiv","id":"1402.3236","version":1},"attestation_state":"computed","paper":{"title":"A graph-theoretical approach for the computation of connected iso-surfaces based on volumetric data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abdulaziz Ali, Dieter Bothe","submitted_at":"2014-02-13T17:58:51Z","abstract_excerpt":"The existing combinatorial methods for iso-surface computation are efficient for pure visualization purposes, but it is known that the resulting iso-surfaces can have holes, and topological problems like missing or wrong connectivity can appear. To avoid such problems, we introduce a graph-theoretical method for the computation of iso-surfaces on cuboid meshes in $\\mathbb{R}^3$. The method for the generation of iso-surfaces employs labeled cuboid graphs $G(V,E,\\mathcal{F})$ such that $V$ is the set of vertices of a cuboid $C\\subset\\mathbb{R}^3$, $E$ is the set of edges of $C$ and $\\mathcal{F}\\"},"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":"1402.3236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-13T17:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"f5f2fda1d898d8747f0f26ad7abc229da044cfb55f010ff0feaa43045d591f5f","abstract_canon_sha256":"d112da7ec8ef6bee1b1a346b3d8a8c086863dd0a7eee7aec7771a0cd23629f75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:07.131181Z","signature_b64":"iBc2KF3kjtSgsKpjJZKX1pqOawKjI3uAszJyLDc/C5+GJyJUVQWTJjUrGtlnUR0AaSVORATOh4j6w5uvTZo1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7524d0e0d6058a3fe6e2fd7282aeb88d13042be50318cce2fb84d992d0505426","last_reissued_at":"2026-05-18T02:59:07.130298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:07.130298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A graph-theoretical approach for the computation of connected iso-surfaces based on volumetric data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abdulaziz Ali, Dieter Bothe","submitted_at":"2014-02-13T17:58:51Z","abstract_excerpt":"The existing combinatorial methods for iso-surface computation are efficient for pure visualization purposes, but it is known that the resulting iso-surfaces can have holes, and topological problems like missing or wrong connectivity can appear. To avoid such problems, we introduce a graph-theoretical method for the computation of iso-surfaces on cuboid meshes in $\\mathbb{R}^3$. The method for the generation of iso-surfaces employs labeled cuboid graphs $G(V,E,\\mathcal{F})$ such that $V$ is the set of vertices of a cuboid $C\\subset\\mathbb{R}^3$, $E$ is the set of edges of $C$ and $\\mathcal{F}\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3236","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":""},"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":"1402.3236","created_at":"2026-05-18T02:59:07.130463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3236v1","created_at":"2026-05-18T02:59:07.130463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3236","created_at":"2026-05-18T02:59:07.130463+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUSNBYGWAWFD","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUSNBYGWAWFD7ZXC","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUSNBYGW","created_at":"2026-05-18T12:28:43.426989+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/OUSNBYGWAWFD7ZXC7VZIFLVYRU","json":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU.json","graph_json":"https://pith.science/api/pith-number/OUSNBYGWAWFD7ZXC7VZIFLVYRU/graph.json","events_json":"https://pith.science/api/pith-number/OUSNBYGWAWFD7ZXC7VZIFLVYRU/events.json","paper":"https://pith.science/paper/OUSNBYGW"},"agent_actions":{"view_html":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU","download_json":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU.json","view_paper":"https://pith.science/paper/OUSNBYGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3236&json=true","fetch_graph":"https://pith.science/api/pith-number/OUSNBYGWAWFD7ZXC7VZIFLVYRU/graph.json","fetch_events":"https://pith.science/api/pith-number/OUSNBYGWAWFD7ZXC7VZIFLVYRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/action/storage_attestation","attest_author":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/action/author_attestation","sign_citation":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/action/citation_signature","submit_replication":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/action/replication_record"}},"created_at":"2026-05-18T02:59:07.130463+00:00","updated_at":"2026-05-18T02:59:07.130463+00:00"}