{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XPKBFH2RXBV4LNN3QHFVNU5QLM","short_pith_number":"pith:XPKBFH2R","canonical_record":{"source":{"id":"1908.09378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-25T19:23:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7818cfaa4c5c0197183e38feac7a89ec2a9fab517a24be8e2d5584fc23dd0d9a","abstract_canon_sha256":"941747dcb726d629683847f7acf5daf86e9c8bb03e869075e7d870d57f615606"},"schema_version":"1.0"},"canonical_sha256":"bbd4129f51b86bc5b5bb81cb56d3b05b275b7b636b8e8f13790936d1ec261193","source":{"kind":"arxiv","id":"1908.09378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09378","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09378v2","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09378","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"pith_short_12","alias_value":"XPKBFH2RXBV4","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"pith_short_16","alias_value":"XPKBFH2RXBV4LNN3","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"pith_short_8","alias_value":"XPKBFH2R","created_at":"2026-07-05T06:09:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XPKBFH2RXBV4LNN3QHFVNU5QLM","target":"record","payload":{"canonical_record":{"source":{"id":"1908.09378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-25T19:23:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"7818cfaa4c5c0197183e38feac7a89ec2a9fab517a24be8e2d5584fc23dd0d9a","abstract_canon_sha256":"941747dcb726d629683847f7acf5daf86e9c8bb03e869075e7d870d57f615606"},"schema_version":"1.0"},"canonical_sha256":"bbd4129f51b86bc5b5bb81cb56d3b05b275b7b636b8e8f13790936d1ec261193","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:19.067286Z","signature_b64":"VK/7vKWmLQpcZt5hFXsu6uLqxtqtT4ssXCVp//FepIm9RrYZDkDzRzEtSaY1JyFLSEeG8eX8113AK7Czv5U6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd4129f51b86bc5b5bb81cb56d3b05b275b7b636b8e8f13790936d1ec261193","last_reissued_at":"2026-07-05T06:09:19.066868Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:19.066868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.09378","source_version":2,"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-07-05T06:09:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q2JcWfEodV8jgVK8Cj4zK5vcP3J+8ABcM18cn6/PKmJID+ZBnD+RX4vjMQUvxm490d0X3LNnXdKInHj55zdaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:46:00.914860Z"},"content_sha256":"f31c7c6e4a2aaacfa7f93b554028fabf30527f70a078c069ede7d5659530e30e","schema_version":"1.0","event_id":"sha256:f31c7c6e4a2aaacfa7f93b554028fabf30527f70a078c069ede7d5659530e30e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XPKBFH2RXBV4LNN3QHFVNU5QLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A parallel priority queue with fast updates for GPU architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Ben Karsin, John Iacono, Kyle Berney, Nodari Sitchinava","submitted_at":"2019-08-25T19:23:42Z","abstract_excerpt":"The single-source shortest path (SSSP) problem is a well-studied problem that is used in many applications. In the parallel setting, a work-efficient algorithm that additionally attains $o(n)$ parallel depth has been elusive. Alternatively, various approaches have been developed that take advantage of specific properties of a particular class of graphs. On a graphics processing unit (GPU), the current state-of-the-art SSSP algorithms are implementations of the Delta-stepping algorithm, which does not perform well for graphs with large diameters. The main contribution of this work is to provide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09378","kind":"arxiv","version":2},"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/1908.09378/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"},"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-07-05T06:09:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exDAYsOdMX3PWSbfxe0DfDnTPTpL0+0g1EJHvjCyn//EsA4CxkvvkMZ+dsP4Rai7pgX1EIyJcMDdaWyFmByCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T11:46:00.915393Z"},"content_sha256":"43b183f431b71baaaae36f75e1a50a208bb68b0fff9fbf8f9b8bf96f5751c644","schema_version":"1.0","event_id":"sha256:43b183f431b71baaaae36f75e1a50a208bb68b0fff9fbf8f9b8bf96f5751c644"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPKBFH2RXBV4LNN3QHFVNU5QLM/bundle.json","state_url":"https://pith.science/pith/XPKBFH2RXBV4LNN3QHFVNU5QLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPKBFH2RXBV4LNN3QHFVNU5QLM/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-08-16T11:46:00Z","links":{"resolver":"https://pith.science/pith/XPKBFH2RXBV4LNN3QHFVNU5QLM","bundle":"https://pith.science/pith/XPKBFH2RXBV4LNN3QHFVNU5QLM/bundle.json","state":"https://pith.science/pith/XPKBFH2RXBV4LNN3QHFVNU5QLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPKBFH2RXBV4LNN3QHFVNU5QLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XPKBFH2RXBV4LNN3QHFVNU5QLM","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":"941747dcb726d629683847f7acf5daf86e9c8bb03e869075e7d870d57f615606","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-25T19:23:42Z","title_canon_sha256":"7818cfaa4c5c0197183e38feac7a89ec2a9fab517a24be8e2d5584fc23dd0d9a"},"schema_version":"1.0","source":{"id":"1908.09378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.09378","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"arxiv_version","alias_value":"1908.09378v2","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09378","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"pith_short_12","alias_value":"XPKBFH2RXBV4","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"pith_short_16","alias_value":"XPKBFH2RXBV4LNN3","created_at":"2026-07-05T06:09:19Z"},{"alias_kind":"pith_short_8","alias_value":"XPKBFH2R","created_at":"2026-07-05T06:09:19Z"}],"graph_snapshots":[{"event_id":"sha256:43b183f431b71baaaae36f75e1a50a208bb68b0fff9fbf8f9b8bf96f5751c644","target":"graph","created_at":"2026-07-05T06:09:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.09378/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The single-source shortest path (SSSP) problem is a well-studied problem that is used in many applications. In the parallel setting, a work-efficient algorithm that additionally attains $o(n)$ parallel depth has been elusive. Alternatively, various approaches have been developed that take advantage of specific properties of a particular class of graphs. On a graphics processing unit (GPU), the current state-of-the-art SSSP algorithms are implementations of the Delta-stepping algorithm, which does not perform well for graphs with large diameters. The main contribution of this work is to provide","authors_text":"Ben Karsin, John Iacono, Kyle Berney, Nodari Sitchinava","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-25T19:23:42Z","title":"A parallel priority queue with fast updates for GPU architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09378","kind":"arxiv","version":2},"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:f31c7c6e4a2aaacfa7f93b554028fabf30527f70a078c069ede7d5659530e30e","target":"record","created_at":"2026-07-05T06:09:19Z","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":"941747dcb726d629683847f7acf5daf86e9c8bb03e869075e7d870d57f615606","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-25T19:23:42Z","title_canon_sha256":"7818cfaa4c5c0197183e38feac7a89ec2a9fab517a24be8e2d5584fc23dd0d9a"},"schema_version":"1.0","source":{"id":"1908.09378","kind":"arxiv","version":2}},"canonical_sha256":"bbd4129f51b86bc5b5bb81cb56d3b05b275b7b636b8e8f13790936d1ec261193","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbd4129f51b86bc5b5bb81cb56d3b05b275b7b636b8e8f13790936d1ec261193","first_computed_at":"2026-07-05T06:09:19.066868Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:09:19.066868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VK/7vKWmLQpcZt5hFXsu6uLqxtqtT4ssXCVp//FepIm9RrYZDkDzRzEtSaY1JyFLSEeG8eX8113AK7Czv5U6Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:09:19.067286Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.09378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f31c7c6e4a2aaacfa7f93b554028fabf30527f70a078c069ede7d5659530e30e","sha256:43b183f431b71baaaae36f75e1a50a208bb68b0fff9fbf8f9b8bf96f5751c644"],"state_sha256":"24c5813e59d189d21c546a364863aaa65ebdd0693c778fd3e15a7c2e03555b15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"19HOYBh7RxaGZYqQsmRBoAg3mDUopIoIfNLeH8yOP/FY2NUtWNtd+TTQ9DDPx7V8jx0XruCNE8aNvUOUkTKABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T11:46:00.920088Z","bundle_sha256":"780001db3c3db7bfb93e9a14e361b377840e839eaff3f64aea49aca64943cf60"}}