{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VMM46IWOOHEVVB7VUG7AREYZWZ","short_pith_number":"pith:VMM46IWO","schema_version":"1.0","canonical_sha256":"ab19cf22ce71c95a87f5a1be089319b65b1e33bfc3c79a783eda33609bdb7a27","source":{"kind":"arxiv","id":"1805.08500","version":1},"attestation_state":"computed","paper":{"title":"Improved Shortest Path Maps with GPU Shaders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Marcelo Kallmann, Renato Farias","submitted_at":"2018-05-22T11:03:30Z","abstract_excerpt":"We present in this paper several improvements for computing shortest path maps using OpenGL shaders. The approach explores GPU rasterization as a way to propagate optimal costs on a polygonal 2D environment, producing shortest path maps which can efficiently be queried at run-time. Our improved method relies on Compute Shaders for improved performance, does not require any CPU pre-computation, and handles shortest path maps both with source points and with line segment sources. The produced path maps partition the input environment into regions sharing a same parent point along the shortest pa"},"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":"1805.08500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2018-05-22T11:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"213de9ee5def5c2992660ee289ee1c73f28b00ab045dc72be0f76292bdc907e7","abstract_canon_sha256":"2465ded36dd398221772d85dbde79afa0032def7bd3c5a0a5f98e7a173a79972"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:26.245193Z","signature_b64":"V0OiQ/9iieZciRV3+UQt1tkjsyExRu8SCcvOQ7eEJ6bYvhx68y7SxNTYXIpeEQP/SBtWyuF4l7vxibkDfhCNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab19cf22ce71c95a87f5a1be089319b65b1e33bfc3c79a783eda33609bdb7a27","last_reissued_at":"2026-05-18T00:15:26.244508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:26.244508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Shortest Path Maps with GPU Shaders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Marcelo Kallmann, Renato Farias","submitted_at":"2018-05-22T11:03:30Z","abstract_excerpt":"We present in this paper several improvements for computing shortest path maps using OpenGL shaders. The approach explores GPU rasterization as a way to propagate optimal costs on a polygonal 2D environment, producing shortest path maps which can efficiently be queried at run-time. Our improved method relies on Compute Shaders for improved performance, does not require any CPU pre-computation, and handles shortest path maps both with source points and with line segment sources. The produced path maps partition the input environment into regions sharing a same parent point along the shortest pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08500","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.08500","created_at":"2026-05-18T00:15:26.244614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08500v1","created_at":"2026-05-18T00:15:26.244614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08500","created_at":"2026-05-18T00:15:26.244614+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMM46IWOOHEV","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMM46IWOOHEVVB7V","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMM46IWO","created_at":"2026-05-18T12:32:59.047623+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/VMM46IWOOHEVVB7VUG7AREYZWZ","json":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ.json","graph_json":"https://pith.science/api/pith-number/VMM46IWOOHEVVB7VUG7AREYZWZ/graph.json","events_json":"https://pith.science/api/pith-number/VMM46IWOOHEVVB7VUG7AREYZWZ/events.json","paper":"https://pith.science/paper/VMM46IWO"},"agent_actions":{"view_html":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ","download_json":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ.json","view_paper":"https://pith.science/paper/VMM46IWO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08500&json=true","fetch_graph":"https://pith.science/api/pith-number/VMM46IWOOHEVVB7VUG7AREYZWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/VMM46IWOOHEVVB7VUG7AREYZWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/action/storage_attestation","attest_author":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/action/author_attestation","sign_citation":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/action/citation_signature","submit_replication":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/action/replication_record"}},"created_at":"2026-05-18T00:15:26.244614+00:00","updated_at":"2026-05-18T00:15:26.244614+00:00"}