{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E4U4TNFAGTW7Y6FCQTXEZTCLGP","short_pith_number":"pith:E4U4TNFA","canonical_record":{"source":{"id":"1906.06504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-15T09:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"6549b4cb93509d12287851c8b92bef8ca80a8784e0dad34eebb40ec63579fa4e","abstract_canon_sha256":"979bf600493c537e03da048ee270f11b0e8b1f618312e5681cc70d8942144682"},"schema_version":"1.0"},"canonical_sha256":"2729c9b4a034edfc78a284ee4ccc4b33ecfa1331bfbba665f4212475a2d74b89","source":{"kind":"arxiv","id":"1906.06504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06504","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06504v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06504","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"E4U4TNFAGTW7","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4U4TNFAGTW7Y6FC","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4U4TNFA","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E4U4TNFAGTW7Y6FCQTXEZTCLGP","target":"record","payload":{"canonical_record":{"source":{"id":"1906.06504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-15T09:14:11Z","cross_cats_sorted":[],"title_canon_sha256":"6549b4cb93509d12287851c8b92bef8ca80a8784e0dad34eebb40ec63579fa4e","abstract_canon_sha256":"979bf600493c537e03da048ee270f11b0e8b1f618312e5681cc70d8942144682"},"schema_version":"1.0"},"canonical_sha256":"2729c9b4a034edfc78a284ee4ccc4b33ecfa1331bfbba665f4212475a2d74b89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:13.507118Z","signature_b64":"mf3M9it/Cy5F7GjKyHyIvZHtXJcGWAHtV78x1eGGfP9RkNyt806qCnVj2E2Yl3u4HFlnVCNq1NsS0RH/OJKnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2729c9b4a034edfc78a284ee4ccc4b33ecfa1331bfbba665f4212475a2d74b89","last_reissued_at":"2026-05-17T23:43:13.506599Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:13.506599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.06504","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-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B+NwRgXriwBy6Afd2pfl43Y1o75z1TSHhO+9MtYWtrK004VVRn/QNTMD9PxOrxkN35h19+bSwtOd2dhJXDsgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:48:38.188776Z"},"content_sha256":"536125d6fd508892061e80e183f2df0cdbbb75c23c061b58bf43d45128e9d4e7","schema_version":"1.0","event_id":"sha256:536125d6fd508892061e80e183f2df0cdbbb75c23c061b58bf43d45128e9d4e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E4U4TNFAGTW7Y6FCQTXEZTCLGP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Concurrent Heap on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"(2) University of Pittsburgh, Chaozhang Huang (1), Chi Zhang (2), Eddy Z. Zhang (1) ((1) Rutgers University, Fei Hua (1), Jeremy Bierema (1), New Brunswick, NJ, PA, Pittsburgh, USA, USA), Yanhao Chen (1)","submitted_at":"2019-06-15T09:14:11Z","abstract_excerpt":"Priority queue, often implemented as a heap, is an abstract data type that has been used in many well-known applications like Dijkstra's shortest path algorithm, Prim's minimum spanning tree, Huffman encoding, and the branch-and-bound algorithm. However, it is challenging to exploit the parallelism of the heap on GPUs since the control divergence and memory irregularity must be taken into account. In this paper, we present a parallel generalized heap model that works effectively on GPUs. We also prove the linearizability of our generalized heap model which enables us to reason about the expect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06504","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-17T23:43:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PVNBslIfaQqMX48fp87g3uyrI5Aq0c+ND+vPcn6a8qUXOy2d1WkL+SHfD4j/Xy0ziWSw1hW3AIb3F7qIW8MtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:48:38.189124Z"},"content_sha256":"2964ff0b661955415561a1a7df821fed29ff11db951759aba109687ea0d97bb7","schema_version":"1.0","event_id":"sha256:2964ff0b661955415561a1a7df821fed29ff11db951759aba109687ea0d97bb7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4U4TNFAGTW7Y6FCQTXEZTCLGP/bundle.json","state_url":"https://pith.science/pith/E4U4TNFAGTW7Y6FCQTXEZTCLGP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4U4TNFAGTW7Y6FCQTXEZTCLGP/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-03T04:48:38Z","links":{"resolver":"https://pith.science/pith/E4U4TNFAGTW7Y6FCQTXEZTCLGP","bundle":"https://pith.science/pith/E4U4TNFAGTW7Y6FCQTXEZTCLGP/bundle.json","state":"https://pith.science/pith/E4U4TNFAGTW7Y6FCQTXEZTCLGP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4U4TNFAGTW7Y6FCQTXEZTCLGP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E4U4TNFAGTW7Y6FCQTXEZTCLGP","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":"979bf600493c537e03da048ee270f11b0e8b1f618312e5681cc70d8942144682","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-15T09:14:11Z","title_canon_sha256":"6549b4cb93509d12287851c8b92bef8ca80a8784e0dad34eebb40ec63579fa4e"},"schema_version":"1.0","source":{"id":"1906.06504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.06504","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.06504v1","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.06504","created_at":"2026-05-17T23:43:13Z"},{"alias_kind":"pith_short_12","alias_value":"E4U4TNFAGTW7","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4U4TNFAGTW7Y6FC","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4U4TNFA","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:2964ff0b661955415561a1a7df821fed29ff11db951759aba109687ea0d97bb7","target":"graph","created_at":"2026-05-17T23:43:13Z","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":"Priority queue, often implemented as a heap, is an abstract data type that has been used in many well-known applications like Dijkstra's shortest path algorithm, Prim's minimum spanning tree, Huffman encoding, and the branch-and-bound algorithm. However, it is challenging to exploit the parallelism of the heap on GPUs since the control divergence and memory irregularity must be taken into account. In this paper, we present a parallel generalized heap model that works effectively on GPUs. We also prove the linearizability of our generalized heap model which enables us to reason about the expect","authors_text":"(2) University of Pittsburgh, Chaozhang Huang (1), Chi Zhang (2), Eddy Z. Zhang (1) ((1) Rutgers University, Fei Hua (1), Jeremy Bierema (1), New Brunswick, NJ, PA, Pittsburgh, USA, USA), Yanhao Chen (1)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-15T09:14:11Z","title":"Accelerating Concurrent Heap on GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.06504","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:536125d6fd508892061e80e183f2df0cdbbb75c23c061b58bf43d45128e9d4e7","target":"record","created_at":"2026-05-17T23:43:13Z","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":"979bf600493c537e03da048ee270f11b0e8b1f618312e5681cc70d8942144682","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-06-15T09:14:11Z","title_canon_sha256":"6549b4cb93509d12287851c8b92bef8ca80a8784e0dad34eebb40ec63579fa4e"},"schema_version":"1.0","source":{"id":"1906.06504","kind":"arxiv","version":1}},"canonical_sha256":"2729c9b4a034edfc78a284ee4ccc4b33ecfa1331bfbba665f4212475a2d74b89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2729c9b4a034edfc78a284ee4ccc4b33ecfa1331bfbba665f4212475a2d74b89","first_computed_at":"2026-05-17T23:43:13.506599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:13.506599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mf3M9it/Cy5F7GjKyHyIvZHtXJcGWAHtV78x1eGGfP9RkNyt806qCnVj2E2Yl3u4HFlnVCNq1NsS0RH/OJKnBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:13.507118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.06504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:536125d6fd508892061e80e183f2df0cdbbb75c23c061b58bf43d45128e9d4e7","sha256:2964ff0b661955415561a1a7df821fed29ff11db951759aba109687ea0d97bb7"],"state_sha256":"7f8a8341ead8ab98e1df9c31eaa75cf83468ef1daa946eb8f64b0e8d53d939af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d3qR+fChYDaWmeboyWAX6Pq/KIa8ODFo7ujYW4zmbpOiIUHTc6sDzh7wPasynYK2b97NCPOYWkqeny3lArd3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:48:38.191070Z","bundle_sha256":"78e95986d2385bece3afe8e2405d25dd8965583e1aab7a9133b3c9c342a3f50c"}}