{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OK7C5GD3QSZJ6RI2II4TTFZN4D","short_pith_number":"pith:OK7C5GD3","canonical_record":{"source":{"id":"2506.04086","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-04T15:46:15Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"89ebbada8c38f82d839ea4e7ac683a6c2445a24902592081f431dbd79fa35d6d","abstract_canon_sha256":"10e0132169d217a6ca409ec63078cf172f65b9c3bd6842ddb8fb94e6030ee3f8"},"schema_version":"1.0"},"canonical_sha256":"72be2e987b84b29f451a423939972de0d97752f53388197aa0190b24f5d242b0","source":{"kind":"arxiv","id":"2506.04086","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04086","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04086v3","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04086","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"OK7C5GD3QSZJ","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"pith_short_16","alias_value":"OK7C5GD3QSZJ6RI2","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"pith_short_8","alias_value":"OK7C5GD3","created_at":"2026-07-05T11:49:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OK7C5GD3QSZJ6RI2II4TTFZN4D","target":"record","payload":{"canonical_record":{"source":{"id":"2506.04086","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-04T15:46:15Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"89ebbada8c38f82d839ea4e7ac683a6c2445a24902592081f431dbd79fa35d6d","abstract_canon_sha256":"10e0132169d217a6ca409ec63078cf172f65b9c3bd6842ddb8fb94e6030ee3f8"},"schema_version":"1.0"},"canonical_sha256":"72be2e987b84b29f451a423939972de0d97752f53388197aa0190b24f5d242b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:55.175458Z","signature_b64":"z0EbwmZLhN5BpfQL/2ka2BDljrm7yYklTVzP6Gn4UYIpV/M91djEHj2tSrvjkkiClMEepR5daJegOWJW9ozXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72be2e987b84b29f451a423939972de0d97752f53388197aa0190b24f5d242b0","last_reissued_at":"2026-07-05T11:49:55.174996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:55.174996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.04086","source_version":3,"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-05T11:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPk2gJIyUqh42iiugxLm1O/ICpxmaSUBcg3ogfz1DJJ/fVOkGq6NVZGAVHpkQc6/tLp6MC3EwYV/ScgkdCHrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:12:36.653681Z"},"content_sha256":"c014a25f05739580903c7c815ade880793d8728d42faf3350b43890054e289ba","schema_version":"1.0","event_id":"sha256:c014a25f05739580903c7c815ade880793d8728d42faf3350b43890054e289ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OK7C5GD3QSZJ6RI2II4TTFZN4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.CG","authors_text":"2), (2) Department of Cybernetics, Cybernetics, Czech Technical University in Prague, Czech Technical University in Prague), Faculty of Electrical Engineering, Jan Mikula (1, Miroslav Kulich (1) ((1) Czech Institute of Informatics, Robotics","submitted_at":"2025-06-04T15:46:15Z","abstract_excerpt":"This paper addresses the problem of improving the query performance of the triangular expansion algorithm (TEA) for computing visibility regions by finding the most advantageous instance of the triangular mesh, the preprocessing structure. The TEA recursively traverses the mesh while keeping track of the visible region, the set of all points visible from a query point in a polygonal world. We show that the measured query time is approximately proportional to the number of triangle edge expansions during the mesh traversal. We propose a new type of triangular mesh that minimizes the expected nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04086","kind":"arxiv","version":3},"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/2506.04086/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-05T11:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8pVB1lJBEDNtX8KO2gBgymrhOvl3bYGUYiW2etyDVGkBWlVfqSim0viGfST5sHOxx0vWsYEy+5HmFlGshGQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T22:12:36.654222Z"},"content_sha256":"36e240f04c8f2974ce4f418b609f2308a4e344ef218d9d0c01c58333a27e69e9","schema_version":"1.0","event_id":"sha256:36e240f04c8f2974ce4f418b609f2308a4e344ef218d9d0c01c58333a27e69e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OK7C5GD3QSZJ6RI2II4TTFZN4D/bundle.json","state_url":"https://pith.science/pith/OK7C5GD3QSZJ6RI2II4TTFZN4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OK7C5GD3QSZJ6RI2II4TTFZN4D/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-07T22:12:36Z","links":{"resolver":"https://pith.science/pith/OK7C5GD3QSZJ6RI2II4TTFZN4D","bundle":"https://pith.science/pith/OK7C5GD3QSZJ6RI2II4TTFZN4D/bundle.json","state":"https://pith.science/pith/OK7C5GD3QSZJ6RI2II4TTFZN4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OK7C5GD3QSZJ6RI2II4TTFZN4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OK7C5GD3QSZJ6RI2II4TTFZN4D","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":"10e0132169d217a6ca409ec63078cf172f65b9c3bd6842ddb8fb94e6030ee3f8","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-04T15:46:15Z","title_canon_sha256":"89ebbada8c38f82d839ea4e7ac683a6c2445a24902592081f431dbd79fa35d6d"},"schema_version":"1.0","source":{"id":"2506.04086","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04086","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04086v3","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04086","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"OK7C5GD3QSZJ","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"pith_short_16","alias_value":"OK7C5GD3QSZJ6RI2","created_at":"2026-07-05T11:49:55Z"},{"alias_kind":"pith_short_8","alias_value":"OK7C5GD3","created_at":"2026-07-05T11:49:55Z"}],"graph_snapshots":[{"event_id":"sha256:36e240f04c8f2974ce4f418b609f2308a4e344ef218d9d0c01c58333a27e69e9","target":"graph","created_at":"2026-07-05T11:49:55Z","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/2506.04086/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper addresses the problem of improving the query performance of the triangular expansion algorithm (TEA) for computing visibility regions by finding the most advantageous instance of the triangular mesh, the preprocessing structure. The TEA recursively traverses the mesh while keeping track of the visible region, the set of all points visible from a query point in a polygonal world. We show that the measured query time is approximately proportional to the number of triangle edge expansions during the mesh traversal. We propose a new type of triangular mesh that minimizes the expected nu","authors_text":"2), (2) Department of Cybernetics, Cybernetics, Czech Technical University in Prague, Czech Technical University in Prague), Faculty of Electrical Engineering, Jan Mikula (1, Miroslav Kulich (1) ((1) Czech Institute of Informatics, Robotics","cross_cats":["cs.RO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-04T15:46:15Z","title":"Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04086","kind":"arxiv","version":3},"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:c014a25f05739580903c7c815ade880793d8728d42faf3350b43890054e289ba","target":"record","created_at":"2026-07-05T11:49:55Z","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":"10e0132169d217a6ca409ec63078cf172f65b9c3bd6842ddb8fb94e6030ee3f8","cross_cats_sorted":["cs.RO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2025-06-04T15:46:15Z","title_canon_sha256":"89ebbada8c38f82d839ea4e7ac683a6c2445a24902592081f431dbd79fa35d6d"},"schema_version":"1.0","source":{"id":"2506.04086","kind":"arxiv","version":3}},"canonical_sha256":"72be2e987b84b29f451a423939972de0d97752f53388197aa0190b24f5d242b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72be2e987b84b29f451a423939972de0d97752f53388197aa0190b24f5d242b0","first_computed_at":"2026-07-05T11:49:55.174996Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:49:55.174996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z0EbwmZLhN5BpfQL/2ka2BDljrm7yYklTVzP6Gn4UYIpV/M91djEHj2tSrvjkkiClMEepR5daJegOWJW9ozXDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:49:55.175458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04086","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c014a25f05739580903c7c815ade880793d8728d42faf3350b43890054e289ba","sha256:36e240f04c8f2974ce4f418b609f2308a4e344ef218d9d0c01c58333a27e69e9"],"state_sha256":"6ce4ede193f4d7fa676434bc51ad5eb19ed17d6f7a61c580b1126ca423b67ec3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HqKH33zUGxap9W/cUDIrpoU+nm1lgpMXzGc0LNQX3GN5EIs4dyGF/39e2AOVdwwFEacYaqBvK+OOA0g/joBVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T22:12:36.659557Z","bundle_sha256":"5bafa6ac1cfbc041452d696904e28001e937f42a8b424f2044e82a586088eca6"}}