{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5WU34NLCKJGDTACRMDG2U5WS3I","short_pith_number":"pith:5WU34NLC","schema_version":"1.0","canonical_sha256":"eda9be3562524c39805160cdaa76d2da3e9b7f5235d6070740f8ea6d13d80dc6","source":{"kind":"arxiv","id":"2403.06494","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.06494","created_at":"2026-07-05T07:54:39.095702+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.06494v1","created_at":"2026-07-05T07:54:39.095702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06494","created_at":"2026-07-05T07:54:39.095702+00:00"},{"alias_kind":"pith_short_12","alias_value":"5WU34NLCKJGD","created_at":"2026-07-05T07:54:39.095702+00:00"},{"alias_kind":"pith_short_16","alias_value":"5WU34NLCKJGDTACR","created_at":"2026-07-05T07:54:39.095702+00:00"},{"alias_kind":"pith_short_8","alias_value":"5WU34NLC","created_at":"2026-07-05T07:54:39.095702+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/5WU34NLCKJGDTACRMDG2U5WS3I","json":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I.json","graph_json":"https://pith.science/api/pith-number/5WU34NLCKJGDTACRMDG2U5WS3I/graph.json","events_json":"https://pith.science/api/pith-number/5WU34NLCKJGDTACRMDG2U5WS3I/events.json","paper":"https://pith.science/paper/5WU34NLC"},"agent_actions":{"view_html":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I","download_json":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I.json","view_paper":"https://pith.science/paper/5WU34NLC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.06494&json=true","fetch_graph":"https://pith.science/api/pith-number/5WU34NLCKJGDTACRMDG2U5WS3I/graph.json","fetch_events":"https://pith.science/api/pith-number/5WU34NLCKJGDTACRMDG2U5WS3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I/action/storage_attestation","attest_author":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I/action/author_attestation","sign_citation":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I/action/citation_signature","submit_replication":"https://pith.science/pith/5WU34NLCKJGDTACRMDG2U5WS3I/action/replication_record"}},"created_at":"2026-07-05T07:54:39.095702+00:00","updated_at":"2026-07-05T07:54:39.095702+00:00"}