{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:42NHEK7PQRN2NMDGQZ5B6BVNUK","short_pith_number":"pith:42NHEK7P","schema_version":"1.0","canonical_sha256":"e69a722bef845ba6b066867a1f06ada2983d6ad9fcf536a3339e9699dc2cf89f","source":{"kind":"arxiv","id":"1503.07192","version":1},"attestation_state":"computed","paper":{"title":"Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guillaume Chapuis, Hristo Djidjev","submitted_at":"2015-03-24T20:39:43Z","abstract_excerpt":"We develop an efficient parallel algorithm for answering shortest-path queries in planar graphs and implement it on a multi-node CPU/GPU clusters. The algorithm uses a divide-and-conquer approach for decomposing the input graph into small and roughly equal subgraphs and constructs a distributed data structure containing shortest distances within each of those subgraphs and between their boundary vertices. For a planar graph with $n$ vertices, that data structure needs $O(n)$ storage per processor and allows queries to be answered in $O(n^{1/4})$ time."},"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":"1503.07192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-24T20:39:43Z","cross_cats_sorted":[],"title_canon_sha256":"b5c09ff6d4df44363fda79b14fabe4fbff92b7f8c4a8d64fb86bee2d340ba3f6","abstract_canon_sha256":"3ba00e18efa999aadc952e3546bbede62d60b377e53ba00e848c8d76a5088589"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:28.089682Z","signature_b64":"7Cx0vvyubFuiucpoQH12NW/lF+ec2t09koVGlTsFKpAoA6FHHHQJoRrTRgeFOfHV5UHR2s+UmmC0qLID61VjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e69a722bef845ba6b066867a1f06ada2983d6ad9fcf536a3339e9699dc2cf89f","last_reissued_at":"2026-05-18T02:20:28.089093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:28.089093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guillaume Chapuis, Hristo Djidjev","submitted_at":"2015-03-24T20:39:43Z","abstract_excerpt":"We develop an efficient parallel algorithm for answering shortest-path queries in planar graphs and implement it on a multi-node CPU/GPU clusters. The algorithm uses a divide-and-conquer approach for decomposing the input graph into small and roughly equal subgraphs and constructs a distributed data structure containing shortest distances within each of those subgraphs and between their boundary vertices. For a planar graph with $n$ vertices, that data structure needs $O(n)$ storage per processor and allows queries to be answered in $O(n^{1/4})$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07192","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":"1503.07192","created_at":"2026-05-18T02:20:28.089154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.07192v1","created_at":"2026-05-18T02:20:28.089154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07192","created_at":"2026-05-18T02:20:28.089154+00:00"},{"alias_kind":"pith_short_12","alias_value":"42NHEK7PQRN2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"42NHEK7PQRN2NMDG","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"42NHEK7P","created_at":"2026-05-18T12:29:02.477457+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/42NHEK7PQRN2NMDGQZ5B6BVNUK","json":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK.json","graph_json":"https://pith.science/api/pith-number/42NHEK7PQRN2NMDGQZ5B6BVNUK/graph.json","events_json":"https://pith.science/api/pith-number/42NHEK7PQRN2NMDGQZ5B6BVNUK/events.json","paper":"https://pith.science/paper/42NHEK7P"},"agent_actions":{"view_html":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK","download_json":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK.json","view_paper":"https://pith.science/paper/42NHEK7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.07192&json=true","fetch_graph":"https://pith.science/api/pith-number/42NHEK7PQRN2NMDGQZ5B6BVNUK/graph.json","fetch_events":"https://pith.science/api/pith-number/42NHEK7PQRN2NMDGQZ5B6BVNUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/action/storage_attestation","attest_author":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/action/author_attestation","sign_citation":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/action/citation_signature","submit_replication":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/action/replication_record"}},"created_at":"2026-05-18T02:20:28.089154+00:00","updated_at":"2026-05-18T02:20:28.089154+00:00"}