{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VMM46IWOOHEVVB7VUG7AREYZWZ","short_pith_number":"pith:VMM46IWO","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"},"canonical_sha256":"ab19cf22ce71c95a87f5a1be089319b65b1e33bfc3c79a783eda33609bdb7a27","source":{"kind":"arxiv","id":"1805.08500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08500","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08500v1","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08500","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"pith_short_12","alias_value":"VMM46IWOOHEV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VMM46IWOOHEVVB7V","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VMM46IWO","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VMM46IWOOHEVVB7VUG7AREYZWZ","target":"record","payload":{"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"},"canonical_sha256":"ab19cf22ce71c95a87f5a1be089319b65b1e33bfc3c79a783eda33609bdb7a27","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"},"source_kind":"arxiv","source_id":"1805.08500","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-05-18T00:15:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+FYpd0YDjyin23WZaicR1QXk01WdV+MjqPFJ35bzbLl2XIounXS9++B6twthhzE2/hgSa9XkVUiWM7pGcG9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:26:58.668710Z"},"content_sha256":"8e01ca635c87adef689fcb6ad92dafe35c0171db7e81f81fcac257af17467d2a","schema_version":"1.0","event_id":"sha256:8e01ca635c87adef689fcb6ad92dafe35c0171db7e81f81fcac257af17467d2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VMM46IWOOHEVVB7VUG7AREYZWZ","target":"graph","payload":{"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"},"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-05-18T00:15:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxxiAbkIEcMBZFLNXt49xjQ3TskhZ+H92rNZ69OVQh8+76JXlDmf/9KQ9J2iuZsOFVLvOqaHc0TOt/tLHDBbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:26:58.669198Z"},"content_sha256":"2bcdf88e0900903b8fed640e5be53407717d11ba349149726a917a4fa15c606f","schema_version":"1.0","event_id":"sha256:2bcdf88e0900903b8fed640e5be53407717d11ba349149726a917a4fa15c606f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/bundle.json","state_url":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/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-06-26T02:26:58Z","links":{"resolver":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ","bundle":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/bundle.json","state":"https://pith.science/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMM46IWOOHEVVB7VUG7AREYZWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VMM46IWOOHEVVB7VUG7AREYZWZ","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":"2465ded36dd398221772d85dbde79afa0032def7bd3c5a0a5f98e7a173a79972","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2018-05-22T11:03:30Z","title_canon_sha256":"213de9ee5def5c2992660ee289ee1c73f28b00ab045dc72be0f76292bdc907e7"},"schema_version":"1.0","source":{"id":"1805.08500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08500","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08500v1","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08500","created_at":"2026-05-18T00:15:26Z"},{"alias_kind":"pith_short_12","alias_value":"VMM46IWOOHEV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VMM46IWOOHEVVB7V","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VMM46IWO","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:2bcdf88e0900903b8fed640e5be53407717d11ba349149726a917a4fa15c606f","target":"graph","created_at":"2026-05-18T00:15:26Z","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"},"paper":{"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","authors_text":"Marcelo Kallmann, Renato Farias","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2018-05-22T11:03:30Z","title":"Improved Shortest Path Maps with GPU Shaders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08500","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:8e01ca635c87adef689fcb6ad92dafe35c0171db7e81f81fcac257af17467d2a","target":"record","created_at":"2026-05-18T00:15:26Z","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":"2465ded36dd398221772d85dbde79afa0032def7bd3c5a0a5f98e7a173a79972","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2018-05-22T11:03:30Z","title_canon_sha256":"213de9ee5def5c2992660ee289ee1c73f28b00ab045dc72be0f76292bdc907e7"},"schema_version":"1.0","source":{"id":"1805.08500","kind":"arxiv","version":1}},"canonical_sha256":"ab19cf22ce71c95a87f5a1be089319b65b1e33bfc3c79a783eda33609bdb7a27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab19cf22ce71c95a87f5a1be089319b65b1e33bfc3c79a783eda33609bdb7a27","first_computed_at":"2026-05-18T00:15:26.244508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:26.244508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V0OiQ/9iieZciRV3+UQt1tkjsyExRu8SCcvOQ7eEJ6bYvhx68y7SxNTYXIpeEQP/SBtWyuF4l7vxibkDfhCNDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:26.245193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e01ca635c87adef689fcb6ad92dafe35c0171db7e81f81fcac257af17467d2a","sha256:2bcdf88e0900903b8fed640e5be53407717d11ba349149726a917a4fa15c606f"],"state_sha256":"a41a150dfcdd1326bb3056f8cbbf39c7388d8eb37d39cfeeb8b8b8c170d73500"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7AadAhj34ndabJlxYxj53IH/+Oi5gxjzYV1vru/7UuFDXd1T6UQpA0eSSdjsl2EVRjrd5FqnKL0ZMPD67Z8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:26:58.672249Z","bundle_sha256":"76f81407dbd568d09caef6772d00e55905ec3e2adc1965ad9f8ff0ed5e3b7c43"}}