{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:42NHEK7PQRN2NMDGQZ5B6BVNUK","short_pith_number":"pith:42NHEK7P","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"},"canonical_sha256":"e69a722bef845ba6b066867a1f06ada2983d6ad9fcf536a3339e9699dc2cf89f","source":{"kind":"arxiv","id":"1503.07192","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07192","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07192v1","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07192","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"42NHEK7PQRN2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"42NHEK7PQRN2NMDG","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"42NHEK7P","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:42NHEK7PQRN2NMDGQZ5B6BVNUK","target":"record","payload":{"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"},"canonical_sha256":"e69a722bef845ba6b066867a1f06ada2983d6ad9fcf536a3339e9699dc2cf89f","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"},"source_kind":"arxiv","source_id":"1503.07192","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-18T02:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0XRpzP+SzwWdctkoMgF+G8i0ViFJVQuGLVyY0A34esqLEsjaZjLOhTUrd7T/eBBJPNi9ZVhoTpJQG5+3QzfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:55:11.382345Z"},"content_sha256":"dc6944ea41a9ed2b6e7b000a2c9529503defb90b9e29a7a14d063bc6497ed3db","schema_version":"1.0","event_id":"sha256:dc6944ea41a9ed2b6e7b000a2c9529503defb90b9e29a7a14d063bc6497ed3db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:42NHEK7PQRN2NMDGQZ5B6BVNUK","target":"graph","payload":{"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"},"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-18T02:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGnHrQzwaHrCfnYFp0tPQBPu1hK3ERydPd+6xis1OQtRvLvwifL1hW0SNKdTkp5Arct2mZgvST83oWzPfRQbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:55:11.382693Z"},"content_sha256":"4bb7064b340c5cef7b9781cb67d766fac7cbd572d3087b093755d79ace62b8a3","schema_version":"1.0","event_id":"sha256:4bb7064b340c5cef7b9781cb67d766fac7cbd572d3087b093755d79ace62b8a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/bundle.json","state_url":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/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-09T13:55:11Z","links":{"resolver":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK","bundle":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/bundle.json","state":"https://pith.science/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/42NHEK7PQRN2NMDGQZ5B6BVNUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:42NHEK7PQRN2NMDGQZ5B6BVNUK","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":"3ba00e18efa999aadc952e3546bbede62d60b377e53ba00e848c8d76a5088589","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-24T20:39:43Z","title_canon_sha256":"b5c09ff6d4df44363fda79b14fabe4fbff92b7f8c4a8d64fb86bee2d340ba3f6"},"schema_version":"1.0","source":{"id":"1503.07192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.07192","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"1503.07192v1","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.07192","created_at":"2026-05-18T02:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"42NHEK7PQRN2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"42NHEK7PQRN2NMDG","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"42NHEK7P","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:4bb7064b340c5cef7b9781cb67d766fac7cbd572d3087b093755d79ace62b8a3","target":"graph","created_at":"2026-05-18T02:20:28Z","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 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.","authors_text":"Guillaume Chapuis, Hristo Djidjev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-24T20:39:43Z","title":"Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.07192","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:dc6944ea41a9ed2b6e7b000a2c9529503defb90b9e29a7a14d063bc6497ed3db","target":"record","created_at":"2026-05-18T02:20:28Z","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":"3ba00e18efa999aadc952e3546bbede62d60b377e53ba00e848c8d76a5088589","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-24T20:39:43Z","title_canon_sha256":"b5c09ff6d4df44363fda79b14fabe4fbff92b7f8c4a8d64fb86bee2d340ba3f6"},"schema_version":"1.0","source":{"id":"1503.07192","kind":"arxiv","version":1}},"canonical_sha256":"e69a722bef845ba6b066867a1f06ada2983d6ad9fcf536a3339e9699dc2cf89f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e69a722bef845ba6b066867a1f06ada2983d6ad9fcf536a3339e9699dc2cf89f","first_computed_at":"2026-05-18T02:20:28.089093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:28.089093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Cx0vvyubFuiucpoQH12NW/lF+ec2t09koVGlTsFKpAoA6FHHHQJoRrTRgeFOfHV5UHR2s+UmmC0qLID61VjDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:28.089682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.07192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc6944ea41a9ed2b6e7b000a2c9529503defb90b9e29a7a14d063bc6497ed3db","sha256:4bb7064b340c5cef7b9781cb67d766fac7cbd572d3087b093755d79ace62b8a3"],"state_sha256":"7bc413601e9afe1c35548bb0b78ecff8065ae990f2a68259f50446c0e80d4b83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U/sDyFaE0hvtP04Uh5/8G+GQ83dRKUQKi15MsphVC6SwFRvJxmVUlqB5Olg250F3t6wTPQ85oNWUj6aLPQj5Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:55:11.384641Z","bundle_sha256":"a890c4f9c2b9d2fd9060415d4743988d045fa1c29593e53938771354010da8f8"}}