{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5WU34NLCKJGDTACRMDG2U5WS3I","short_pith_number":"pith:5WU34NLC","canonical_record":{"source":{"id":"2403.06494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-03-11T08:07:11Z","cross_cats_sorted":["cs.GR","cs.RO"],"title_canon_sha256":"198a70688d3cad801e6a641cb5dfd09ae9b05b2bc4717de0eb6867cca578f8b5","abstract_canon_sha256":"53b37874748659b3830e5890d1cef5814ea90e0964f0eb98f9c08f5deae75de7"},"schema_version":"1.0"},"canonical_sha256":"eda9be3562524c39805160cdaa76d2da3e9b7f5235d6070740f8ea6d13d80dc6","source":{"kind":"arxiv","id":"2403.06494","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.06494","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"2403.06494v1","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06494","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"5WU34NLCKJGD","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"pith_short_16","alias_value":"5WU34NLCKJGDTACR","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"pith_short_8","alias_value":"5WU34NLC","created_at":"2026-07-05T07:54:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5WU34NLCKJGDTACRMDG2U5WS3I","target":"record","payload":{"canonical_record":{"source":{"id":"2403.06494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-03-11T08:07:11Z","cross_cats_sorted":["cs.GR","cs.RO"],"title_canon_sha256":"198a70688d3cad801e6a641cb5dfd09ae9b05b2bc4717de0eb6867cca578f8b5","abstract_canon_sha256":"53b37874748659b3830e5890d1cef5814ea90e0964f0eb98f9c08f5deae75de7"},"schema_version":"1.0"},"canonical_sha256":"eda9be3562524c39805160cdaa76d2da3e9b7f5235d6070740f8ea6d13d80dc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:39.096152Z","signature_b64":"fit5UNPKrzdT+io3c9g4TUVNE9KL5lJrniD8/W+fksO8o2VqMGrPvzBpYsoxcRybv2BbH7Vo3cXRTKQDyWwXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eda9be3562524c39805160cdaa76d2da3e9b7f5235d6070740f8ea6d13d80dc6","last_reissued_at":"2026-07-05T07:54:39.095625Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:39.095625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.06494","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-05T07:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+lJ0zXMdMG8UsKLJnBc0KXa9m3dvkFk5u/ACE8/TB3jJEydNsrjH8eS3meOVoZ4oUpmPNi71EpFdvwYbwKoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:18:36.900008Z"},"content_sha256":"fb5c0bd3815078b43c37bc793e801d5a208f24141a38288920dc81e031dab06f","schema_version":"1.0","event_id":"sha256:fb5c0bd3815078b43c37bc793e801d5a208f24141a38288920dc81e031dab06f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5WU34NLCKJGDTACRMDG2U5WS3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.RO"],"primary_cat":"cs.CG","authors_text":"Ibrahim Ibrahim, Jan Swevers, Joris Gillis, Wilm Decr\\'e","submitted_at":"2024-03-11T08:07:11Z","abstract_excerpt":"This paper introduces a novel, lightweight method to solve the visibility problem for 2D grids. The proposed method evaluates the existence of lines-of-sight from a source point to all other grid cells in a single pass with no preprocessing and independently of the number and shape of obstacles. It has a compute and memory complexity of $\\mathcal{O}(n)$, where $n = n_{x}\\times{} n_{y}$ is the size of the grid, and requires at most ten arithmetic operations per grid cell. In the proposed approach, we use a linear first-order hyperbolic partial differential equation to transport the visibility q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06494","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/2403.06494/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-05T07:54:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zu48fkjJ1UwctHLOcJlRwU3QaTqFzeVgTtTuK0DZQ42hb6iuv7EXSNkHiPtPWHXCQ6m2HOM0KR3DRTnRf3EMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T16:18:36.900557Z"},"content_sha256":"8fd856d3d37a122290e60a24e112a4422734e003ab4c7626c47f24b32f52094f","schema_version":"1.0","event_id":"sha256:8fd856d3d37a122290e60a24e112a4422734e003ab4c7626c47f24b32f52094f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I/bundle.json","state_url":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5WU34NLCKJGDTACRMDG2U5WS3I/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-14T16:18:36Z","links":{"resolver":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I","bundle":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I/bundle.json","state":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5WU34NLCKJGDTACRMDG2U5WS3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5WU34NLCKJGDTACRMDG2U5WS3I","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":"53b37874748659b3830e5890d1cef5814ea90e0964f0eb98f9c08f5deae75de7","cross_cats_sorted":["cs.GR","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-03-11T08:07:11Z","title_canon_sha256":"198a70688d3cad801e6a641cb5dfd09ae9b05b2bc4717de0eb6867cca578f8b5"},"schema_version":"1.0","source":{"id":"2403.06494","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.06494","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"2403.06494v1","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06494","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"5WU34NLCKJGD","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"pith_short_16","alias_value":"5WU34NLCKJGDTACR","created_at":"2026-07-05T07:54:39Z"},{"alias_kind":"pith_short_8","alias_value":"5WU34NLC","created_at":"2026-07-05T07:54:39Z"}],"graph_snapshots":[{"event_id":"sha256:8fd856d3d37a122290e60a24e112a4422734e003ab4c7626c47f24b32f52094f","target":"graph","created_at":"2026-07-05T07:54:39Z","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/2403.06494/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a novel, lightweight method to solve the visibility problem for 2D grids. The proposed method evaluates the existence of lines-of-sight from a source point to all other grid cells in a single pass with no preprocessing and independently of the number and shape of obstacles. It has a compute and memory complexity of $\\mathcal{O}(n)$, where $n = n_{x}\\times{} n_{y}$ is the size of the grid, and requires at most ten arithmetic operations per grid cell. In the proposed approach, we use a linear first-order hyperbolic partial differential equation to transport the visibility q","authors_text":"Ibrahim Ibrahim, Jan Swevers, Joris Gillis, Wilm Decr\\'e","cross_cats":["cs.GR","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-03-11T08:07:11Z","title":"An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06494","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:fb5c0bd3815078b43c37bc793e801d5a208f24141a38288920dc81e031dab06f","target":"record","created_at":"2026-07-05T07:54:39Z","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":"53b37874748659b3830e5890d1cef5814ea90e0964f0eb98f9c08f5deae75de7","cross_cats_sorted":["cs.GR","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-03-11T08:07:11Z","title_canon_sha256":"198a70688d3cad801e6a641cb5dfd09ae9b05b2bc4717de0eb6867cca578f8b5"},"schema_version":"1.0","source":{"id":"2403.06494","kind":"arxiv","version":1}},"canonical_sha256":"eda9be3562524c39805160cdaa76d2da3e9b7f5235d6070740f8ea6d13d80dc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eda9be3562524c39805160cdaa76d2da3e9b7f5235d6070740f8ea6d13d80dc6","first_computed_at":"2026-07-05T07:54:39.095625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:54:39.095625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fit5UNPKrzdT+io3c9g4TUVNE9KL5lJrniD8/W+fksO8o2VqMGrPvzBpYsoxcRybv2BbH7Vo3cXRTKQDyWwXDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:54:39.096152Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.06494","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb5c0bd3815078b43c37bc793e801d5a208f24141a38288920dc81e031dab06f","sha256:8fd856d3d37a122290e60a24e112a4422734e003ab4c7626c47f24b32f52094f"],"state_sha256":"2518257453ce0a30bdff88853fde2d8f52126fe8305fc62b5c2de7888452bc20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MvJAeRV9gGBNl1m7yBaVE2Ko3RH2R/IjtV68D7LH7yJFrBPByPoWS5N9Olxr3zO43GxZfST659DEi9GhNJGGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T16:18:36.911289Z","bundle_sha256":"e400a9edd75871a294f07da96a7092beff6142cf82c37e2b950fa1effd915018"}}