{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OUSNBYGWAWFD7ZXC7VZIFLVYRU","short_pith_number":"pith:OUSNBYGW","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"},"canonical_sha256":"7524d0e0d6058a3fe6e2fd7282aeb88d13042be50318cce2fb84d992d0505426","source":{"kind":"arxiv","id":"1402.3236","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3236","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3236v1","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3236","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"pith_short_12","alias_value":"OUSNBYGWAWFD","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OUSNBYGWAWFD7ZXC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OUSNBYGW","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OUSNBYGWAWFD7ZXC7VZIFLVYRU","target":"record","payload":{"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"},"canonical_sha256":"7524d0e0d6058a3fe6e2fd7282aeb88d13042be50318cce2fb84d992d0505426","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"},"source_kind":"arxiv","source_id":"1402.3236","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:59:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FCKCONTEg4GfrJAeuxuEyPe3stKqKD9+mgC51jBIo4E/5/VE+A/veOf0N/+E3/AILiBuS+uZicR1Ae02cjc3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:33:05.827048Z"},"content_sha256":"1967400139ad408cece35029205298d1b59245aa911dbe64989706baeb248623","schema_version":"1.0","event_id":"sha256:1967400139ad408cece35029205298d1b59245aa911dbe64989706baeb248623"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OUSNBYGWAWFD7ZXC7VZIFLVYRU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:59:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5j97J4K1LTxgjKDe2B+NC2lx+2up3mgX8azrofzrmDRUq6/R8CAbo6zNxq8hQJ6y0klP3hCHwSh6aeSmH0FBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:33:05.827405Z"},"content_sha256":"e9798f87f9f32d730b362522bcdab780c150f9b182f92dae94c89dcdf2957da2","schema_version":"1.0","event_id":"sha256:e9798f87f9f32d730b362522bcdab780c150f9b182f92dae94c89dcdf2957da2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/bundle.json","state_url":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T15:33:05Z","links":{"resolver":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU","bundle":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/bundle.json","state":"https://pith.science/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUSNBYGWAWFD7ZXC7VZIFLVYRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OUSNBYGWAWFD7ZXC7VZIFLVYRU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d112da7ec8ef6bee1b1a346b3d8a8c086863dd0a7eee7aec7771a0cd23629f75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-13T17:58:51Z","title_canon_sha256":"f5f2fda1d898d8747f0f26ad7abc229da044cfb55f010ff0feaa43045d591f5f"},"schema_version":"1.0","source":{"id":"1402.3236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3236","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3236v1","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3236","created_at":"2026-05-18T02:59:07Z"},{"alias_kind":"pith_short_12","alias_value":"OUSNBYGWAWFD","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OUSNBYGWAWFD7ZXC","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OUSNBYGW","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:e9798f87f9f32d730b362522bcdab780c150f9b182f92dae94c89dcdf2957da2","target":"graph","created_at":"2026-05-18T02:59:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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}\\","authors_text":"Abdulaziz Ali, Dieter Bothe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-13T17:58:51Z","title":"A graph-theoretical approach for the computation of connected iso-surfaces based on volumetric data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3236","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1967400139ad408cece35029205298d1b59245aa911dbe64989706baeb248623","target":"record","created_at":"2026-05-18T02:59:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d112da7ec8ef6bee1b1a346b3d8a8c086863dd0a7eee7aec7771a0cd23629f75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-02-13T17:58:51Z","title_canon_sha256":"f5f2fda1d898d8747f0f26ad7abc229da044cfb55f010ff0feaa43045d591f5f"},"schema_version":"1.0","source":{"id":"1402.3236","kind":"arxiv","version":1}},"canonical_sha256":"7524d0e0d6058a3fe6e2fd7282aeb88d13042be50318cce2fb84d992d0505426","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7524d0e0d6058a3fe6e2fd7282aeb88d13042be50318cce2fb84d992d0505426","first_computed_at":"2026-05-18T02:59:07.130298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:07.130298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iBc2KF3kjtSgsKpjJZKX1pqOawKjI3uAszJyLDc/C5+GJyJUVQWTJjUrGtlnUR0AaSVORATOh4j6w5uvTZo1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:07.131181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1967400139ad408cece35029205298d1b59245aa911dbe64989706baeb248623","sha256:e9798f87f9f32d730b362522bcdab780c150f9b182f92dae94c89dcdf2957da2"],"state_sha256":"165bb0f871c2a2b988b1f6b85a657db72445682ab4121f201a8ce6cd006f8381"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzLjwrPapgoov7YKxDG96yPibi/STUGsxc1iYOduLXNN9FMKG/vIeWuxTwJcCKysN0xT89h3nW8bqZGM7N8dDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:33:05.829264Z","bundle_sha256":"98df4eab4fea04adea0a1788d0fc67ba60e53e2a7c8bd98070ea6654418e1ac1"}}