{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:I36KLBKMQUO5J3RPX4V3KR4J3G","short_pith_number":"pith:I36KLBKM","canonical_record":{"source":{"id":"2606.01693","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-01T04:57:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"835f4128bbd073bc81559fe543eb115a545c69e693f8477da87545b844d21701","abstract_canon_sha256":"47c1ac6db9b8026d972be9beac8fc1e2591a9ef28ea1d86072fcca76dd618436"},"schema_version":"1.0"},"canonical_sha256":"46fca5854c851dd4ee2fbf2bb54789d9821139db8ca8bfe6c694522b59ce07ef","source":{"kind":"arxiv","id":"2606.01693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01693","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01693v1","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01693","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"pith_short_12","alias_value":"I36KLBKMQUO5","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"pith_short_16","alias_value":"I36KLBKMQUO5J3RP","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"pith_short_8","alias_value":"I36KLBKM","created_at":"2026-06-02T02:04:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:I36KLBKMQUO5J3RPX4V3KR4J3G","target":"record","payload":{"canonical_record":{"source":{"id":"2606.01693","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-01T04:57:32Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"835f4128bbd073bc81559fe543eb115a545c69e693f8477da87545b844d21701","abstract_canon_sha256":"47c1ac6db9b8026d972be9beac8fc1e2591a9ef28ea1d86072fcca76dd618436"},"schema_version":"1.0"},"canonical_sha256":"46fca5854c851dd4ee2fbf2bb54789d9821139db8ca8bfe6c694522b59ce07ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:40.198397Z","signature_b64":"j0B4eCUZtxilziX0bUrszZtxVedupD++0pxnWJFAWeZi4lGLC8kNNd7RuIUKQz9krrCOTXMDwOSnP41L+Z9fDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46fca5854c851dd4ee2fbf2bb54789d9821139db8ca8bfe6c694522b59ce07ef","last_reissued_at":"2026-06-02T02:04:40.198049Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:40.198049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.01693","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-06-02T02:04:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQAieJZR+H2K+rspayhsAJ7UXQLSE7vlERILObOHfS6Fd/Pt3p7I4hLucmn9YMhDAJ650ze6cdH4svPLmBptCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:49:03.077241Z"},"content_sha256":"f33855d19879cf4da9497ce704829595fa8a935785e7a36ef51cab155ca865b3","schema_version":"1.0","event_id":"sha256:f33855d19879cf4da9497ce704829595fa8a935785e7a36ef51cab155ca865b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:I36KLBKMQUO5J3RPX4V3KR4J3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Concurrent Queues for GPU","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Pratheek Prakash Shetty, Thomas R. W. Scogland, Wu-chun Feng","submitted_at":"2026-06-01T04:57:32Z","abstract_excerpt":"Concurrent queues can significantly impact supercomputing performance by being critical bottlenecks for task distribution, load balancing, and resource utilization. As HPC systems move beyond 10-million processor cores, the ability to rapidly move items between producer and consumer threads without excessive locking is essential for efficient queues, preventing idle cores, maximizing utilization, and achieving high parallel speedup. While concurrent queues are well studied on CPUs, they remain largely unexplored on modern GPUs, where SIMT execution, massive parallelism, and atomic contention r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01693","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01693/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-06-02T02:04:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jNlZ0s6JYxcC8ieX0wMHVgD7KIvrY56AmCFTb3ZRIGhmLgc7G8g3YUkdB1iXWMRrJq2ARrOOz10x1zcuA5mvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:49:03.077629Z"},"content_sha256":"80f4c4218b4d22ec978337a6ad485f6475090655fc1938ee549cb7fad1d11d66","schema_version":"1.0","event_id":"sha256:80f4c4218b4d22ec978337a6ad485f6475090655fc1938ee549cb7fad1d11d66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I36KLBKMQUO5J3RPX4V3KR4J3G/bundle.json","state_url":"https://pith.science/pith/I36KLBKMQUO5J3RPX4V3KR4J3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I36KLBKMQUO5J3RPX4V3KR4J3G/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-27T13:49:03Z","links":{"resolver":"https://pith.science/pith/I36KLBKMQUO5J3RPX4V3KR4J3G","bundle":"https://pith.science/pith/I36KLBKMQUO5J3RPX4V3KR4J3G/bundle.json","state":"https://pith.science/pith/I36KLBKMQUO5J3RPX4V3KR4J3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I36KLBKMQUO5J3RPX4V3KR4J3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:I36KLBKMQUO5J3RPX4V3KR4J3G","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":"47c1ac6db9b8026d972be9beac8fc1e2591a9ef28ea1d86072fcca76dd618436","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-01T04:57:32Z","title_canon_sha256":"835f4128bbd073bc81559fe543eb115a545c69e693f8477da87545b844d21701"},"schema_version":"1.0","source":{"id":"2606.01693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01693","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01693v1","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01693","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"pith_short_12","alias_value":"I36KLBKMQUO5","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"pith_short_16","alias_value":"I36KLBKMQUO5J3RP","created_at":"2026-06-02T02:04:40Z"},{"alias_kind":"pith_short_8","alias_value":"I36KLBKM","created_at":"2026-06-02T02:04:40Z"}],"graph_snapshots":[{"event_id":"sha256:80f4c4218b4d22ec978337a6ad485f6475090655fc1938ee549cb7fad1d11d66","target":"graph","created_at":"2026-06-02T02:04:40Z","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/2606.01693/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Concurrent queues can significantly impact supercomputing performance by being critical bottlenecks for task distribution, load balancing, and resource utilization. As HPC systems move beyond 10-million processor cores, the ability to rapidly move items between producer and consumer threads without excessive locking is essential for efficient queues, preventing idle cores, maximizing utilization, and achieving high parallel speedup. While concurrent queues are well studied on CPUs, they remain largely unexplored on modern GPUs, where SIMT execution, massive parallelism, and atomic contention r","authors_text":"Pratheek Prakash Shetty, Thomas R. W. Scogland, Wu-chun Feng","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-01T04:57:32Z","title":"Scalable Concurrent Queues for GPU"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01693","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:f33855d19879cf4da9497ce704829595fa8a935785e7a36ef51cab155ca865b3","target":"record","created_at":"2026-06-02T02:04:40Z","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":"47c1ac6db9b8026d972be9beac8fc1e2591a9ef28ea1d86072fcca76dd618436","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-01T04:57:32Z","title_canon_sha256":"835f4128bbd073bc81559fe543eb115a545c69e693f8477da87545b844d21701"},"schema_version":"1.0","source":{"id":"2606.01693","kind":"arxiv","version":1}},"canonical_sha256":"46fca5854c851dd4ee2fbf2bb54789d9821139db8ca8bfe6c694522b59ce07ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46fca5854c851dd4ee2fbf2bb54789d9821139db8ca8bfe6c694522b59ce07ef","first_computed_at":"2026-06-02T02:04:40.198049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:04:40.198049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j0B4eCUZtxilziX0bUrszZtxVedupD++0pxnWJFAWeZi4lGLC8kNNd7RuIUKQz9krrCOTXMDwOSnP41L+Z9fDA==","signature_status":"signed_v1","signed_at":"2026-06-02T02:04:40.198397Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f33855d19879cf4da9497ce704829595fa8a935785e7a36ef51cab155ca865b3","sha256:80f4c4218b4d22ec978337a6ad485f6475090655fc1938ee549cb7fad1d11d66"],"state_sha256":"8344c88a09b66d96d194de05b4ecad666b1f30ef990443fc469a5ea4155d8526"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HwBMdxpdOJuprtbGLk+G2e++BVCUSRDF6GS/2mdeMqiC2HwN2qU2ndVN+KTJksNV3JtzDNOSijy0pQpLToYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:49:03.079569Z","bundle_sha256":"8ef73df192d2f4070cac3a9b71989a6856672c74c5c17d62f34607cfaa56dd39"}}