{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:X6OD724XMKDZRM4EZ3USSEMYGQ","short_pith_number":"pith:X6OD724X","canonical_record":{"source":{"id":"2503.01626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-03T15:00:55Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"00bf5b1b3985041ae11a3ed21ca6333e53a1bfa6cd84581ff5079cf86e4021cf","abstract_canon_sha256":"600eb4ad1d83a697de89fec692bcd216e8370d47958a121eeab83521acaaf931"},"schema_version":"1.0"},"canonical_sha256":"bf9c3feb97628798b384cee9291198341c153c7bfc273a6d98bc66e40f71a366","source":{"kind":"arxiv","id":"2503.01626","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.01626","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"2503.01626v1","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01626","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"X6OD724XMKDZ","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"pith_short_16","alias_value":"X6OD724XMKDZRM4E","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"pith_short_8","alias_value":"X6OD724X","created_at":"2026-07-05T10:23:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:X6OD724XMKDZRM4EZ3USSEMYGQ","target":"record","payload":{"canonical_record":{"source":{"id":"2503.01626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-03T15:00:55Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"00bf5b1b3985041ae11a3ed21ca6333e53a1bfa6cd84581ff5079cf86e4021cf","abstract_canon_sha256":"600eb4ad1d83a697de89fec692bcd216e8370d47958a121eeab83521acaaf931"},"schema_version":"1.0"},"canonical_sha256":"bf9c3feb97628798b384cee9291198341c153c7bfc273a6d98bc66e40f71a366","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:11.074833Z","signature_b64":"BItZKsJTefaC9lQW3oX2t4SWv6cnT6m5ognG4PzXou/DKcmdYWRpmM/vnKW3VoPAA7z1MEZ4rAqQLcf6P/p5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf9c3feb97628798b384cee9291198341c153c7bfc273a6d98bc66e40f71a366","last_reissued_at":"2026-07-05T10:23:11.074213Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:11.074213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.01626","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-07-05T10:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzN9gn5hJ83DJJHjoYbMbgUX1ugH6uef7Tpd6ExwM7BttQNTMy905Tc3sJsIZezN+b8LGSikXZJnb3hSKsrKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:00:46.213036Z"},"content_sha256":"c2eb2ba2cbfb3dde99542bde8ff0564a141b8bf91f4490162a2170ee3ddd70e5","schema_version":"1.0","event_id":"sha256:c2eb2ba2cbfb3dde99542bde8ff0564a141b8bf91f4490162a2170ee3ddd70e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:X6OD724XMKDZRM4EZ3USSEMYGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Time Complexity of Using Subdivision Methods for the Approximation of Fibers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"Dan Halperin, Michael M. Bilevich","submitted_at":"2025-03-03T15:00:55Z","abstract_excerpt":"Subdivision methods such as quadtrees, octrees, and higher-dimensional orthrees are standard practice in different domains of computer science. We can use these methods to represent given geometries, such as curves, meshes, or surfaces. This representation is achieved by splitting some bounding voxel recursively while further splitting only sub-voxels that intersect with the given geometry. It is fairly known that subdivision methods are more efficient than traversing a fine-grained voxel grid. In this short note, we propose another outlook on analyzing the construction time complexity of orth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01626","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/2503.01626/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"},"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-07-05T10:23:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XVKAkbzWNfLnsU/Xk1icS/g2hgTl0NNbsM2oAs+H2hSzylDyNGno9g8i2cVH8e3e2IwjNFS+OJdS4EvtQ5K/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:00:46.213551Z"},"content_sha256":"9ded3ec6dc9c725df3d285672a2c0abb68dc0538321a53a965213c784cd298c7","schema_version":"1.0","event_id":"sha256:9ded3ec6dc9c725df3d285672a2c0abb68dc0538321a53a965213c784cd298c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X6OD724XMKDZRM4EZ3USSEMYGQ/bundle.json","state_url":"https://pith.science/pith/X6OD724XMKDZRM4EZ3USSEMYGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X6OD724XMKDZRM4EZ3USSEMYGQ/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-08-12T17:00:46Z","links":{"resolver":"https://pith.science/pith/X6OD724XMKDZRM4EZ3USSEMYGQ","bundle":"https://pith.science/pith/X6OD724XMKDZRM4EZ3USSEMYGQ/bundle.json","state":"https://pith.science/pith/X6OD724XMKDZRM4EZ3USSEMYGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X6OD724XMKDZRM4EZ3USSEMYGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:X6OD724XMKDZRM4EZ3USSEMYGQ","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":"600eb4ad1d83a697de89fec692bcd216e8370d47958a121eeab83521acaaf931","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-03T15:00:55Z","title_canon_sha256":"00bf5b1b3985041ae11a3ed21ca6333e53a1bfa6cd84581ff5079cf86e4021cf"},"schema_version":"1.0","source":{"id":"2503.01626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.01626","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"arxiv_version","alias_value":"2503.01626v1","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.01626","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"pith_short_12","alias_value":"X6OD724XMKDZ","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"pith_short_16","alias_value":"X6OD724XMKDZRM4E","created_at":"2026-07-05T10:23:11Z"},{"alias_kind":"pith_short_8","alias_value":"X6OD724X","created_at":"2026-07-05T10:23:11Z"}],"graph_snapshots":[{"event_id":"sha256:9ded3ec6dc9c725df3d285672a2c0abb68dc0538321a53a965213c784cd298c7","target":"graph","created_at":"2026-07-05T10:23:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2503.01626/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Subdivision methods such as quadtrees, octrees, and higher-dimensional orthrees are standard practice in different domains of computer science. We can use these methods to represent given geometries, such as curves, meshes, or surfaces. This representation is achieved by splitting some bounding voxel recursively while further splitting only sub-voxels that intersect with the given geometry. It is fairly known that subdivision methods are more efficient than traversing a fine-grained voxel grid. In this short note, we propose another outlook on analyzing the construction time complexity of orth","authors_text":"Dan Halperin, Michael M. Bilevich","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-03T15:00:55Z","title":"A Note on the Time Complexity of Using Subdivision Methods for the Approximation of Fibers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.01626","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:c2eb2ba2cbfb3dde99542bde8ff0564a141b8bf91f4490162a2170ee3ddd70e5","target":"record","created_at":"2026-07-05T10:23:11Z","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":"600eb4ad1d83a697de89fec692bcd216e8370d47958a121eeab83521acaaf931","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2025-03-03T15:00:55Z","title_canon_sha256":"00bf5b1b3985041ae11a3ed21ca6333e53a1bfa6cd84581ff5079cf86e4021cf"},"schema_version":"1.0","source":{"id":"2503.01626","kind":"arxiv","version":1}},"canonical_sha256":"bf9c3feb97628798b384cee9291198341c153c7bfc273a6d98bc66e40f71a366","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf9c3feb97628798b384cee9291198341c153c7bfc273a6d98bc66e40f71a366","first_computed_at":"2026-07-05T10:23:11.074213Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:23:11.074213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BItZKsJTefaC9lQW3oX2t4SWv6cnT6m5ognG4PzXou/DKcmdYWRpmM/vnKW3VoPAA7z1MEZ4rAqQLcf6P/p5CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:23:11.074833Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.01626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2eb2ba2cbfb3dde99542bde8ff0564a141b8bf91f4490162a2170ee3ddd70e5","sha256:9ded3ec6dc9c725df3d285672a2c0abb68dc0538321a53a965213c784cd298c7"],"state_sha256":"3037c94af3a0bf4b9fcd276aa1c236fed69db3995d085b6a7dbaa1c5b024bcad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6dFl/VGf1tYO2yjRvJhVF0qoVWnvF+6Neqrubn7o1x8DwTFH9nuTwwVmAoJ7Ek3qhY2DVJrXAPs5ux2H8gfxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T17:00:46.217722Z","bundle_sha256":"9f65588668a1ed9ad49b06d14b9106bce6377388d9d5814b7463856336361b7c"}}