{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YNMTH7C5WVJDG2HHKGVPBRN7DN","short_pith_number":"pith:YNMTH7C5","canonical_record":{"source":{"id":"1603.05047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-16T11:46:06Z","cross_cats_sorted":[],"title_canon_sha256":"607536c9e28384ea4e9b24c7e284cedf5f0b80cc64fef0df3640e2c7420f4ca8","abstract_canon_sha256":"228dd2f9d5cfdd026739d98bac3e83a568f6f6d256d212ed542a28b2e3090e07"},"schema_version":"1.0"},"canonical_sha256":"c35933fc5db5523368e751aaf0c5bf1b6eaa08ad02b1b7e6433e71a889c286d6","source":{"kind":"arxiv","id":"1603.05047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05047","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05047v1","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05047","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"YNMTH7C5WVJD","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YNMTH7C5WVJDG2HH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YNMTH7C5","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YNMTH7C5WVJDG2HHKGVPBRN7DN","target":"record","payload":{"canonical_record":{"source":{"id":"1603.05047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-16T11:46:06Z","cross_cats_sorted":[],"title_canon_sha256":"607536c9e28384ea4e9b24c7e284cedf5f0b80cc64fef0df3640e2c7420f4ca8","abstract_canon_sha256":"228dd2f9d5cfdd026739d98bac3e83a568f6f6d256d212ed542a28b2e3090e07"},"schema_version":"1.0"},"canonical_sha256":"c35933fc5db5523368e751aaf0c5bf1b6eaa08ad02b1b7e6433e71a889c286d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:58.119351Z","signature_b64":"+BFjCJhJVXe4WOhhX/VnBT7+XG+0tWt7BZOb3URTrjuRJE+DchAcbAprDaDoV+klVfUPh+p0R4lv3KhjxIL7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c35933fc5db5523368e751aaf0c5bf1b6eaa08ad02b1b7e6433e71a889c286d6","last_reissued_at":"2026-05-18T01:18:58.118915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:58.118915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.05047","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-18T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRwNC7ha/Cr9hpLXy7V9EgrhjN3/sBnNV3IFWezfJa7pUcuou7l1++slVgwZkRQMh2pJUAuhNOAQC0Vzy4aTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:36:32.998220Z"},"content_sha256":"e083e0392ab63c10114b8e3bc7847d3bf7d6458f9bc326eaf56f3818a6aa699b","schema_version":"1.0","event_id":"sha256:e083e0392ab63c10114b8e3bc7847d3bf7d6458f9bc326eaf56f3818a6aa699b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YNMTH7C5WVJDG2HHKGVPBRN7DN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakob Gruber, Jesper Larsson Tr\\\"aff, Martin Wimmer","submitted_at":"2016-03-16T11:46:06Z","abstract_excerpt":"A number of concurrent, relaxed priority queues have recently been proposed and implemented. Results are commonly reported for a throughput benchmark that uses a uniform distribution of keys drawn from a large integer range, and mostly for single systems. We have conducted more extensive benchmarking of three recent, relaxed priority queues on four different types of systems with different key ranges and distributions. While we can show superior throughput and scalability for our own k-LSM priority queue for the uniform key distribution, the picture changes drastically for other distributions,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05047","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-18T01:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WE/b0qMeMWo6BduZkKOEp+8WyhUYESfpiU+hvXKs1S9icunS7a/x6xtKfvFL6eX4fpLWPcVq199V/GftGg28BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:36:32.998948Z"},"content_sha256":"d631d8a1ea59eef5ef60813008b0bf47ebe18bc5e60dd5e9f403ea93a9efa442","schema_version":"1.0","event_id":"sha256:d631d8a1ea59eef5ef60813008b0bf47ebe18bc5e60dd5e9f403ea93a9efa442"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNMTH7C5WVJDG2HHKGVPBRN7DN/bundle.json","state_url":"https://pith.science/pith/YNMTH7C5WVJDG2HHKGVPBRN7DN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNMTH7C5WVJDG2HHKGVPBRN7DN/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-09T19:36:33Z","links":{"resolver":"https://pith.science/pith/YNMTH7C5WVJDG2HHKGVPBRN7DN","bundle":"https://pith.science/pith/YNMTH7C5WVJDG2HHKGVPBRN7DN/bundle.json","state":"https://pith.science/pith/YNMTH7C5WVJDG2HHKGVPBRN7DN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNMTH7C5WVJDG2HHKGVPBRN7DN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YNMTH7C5WVJDG2HHKGVPBRN7DN","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":"228dd2f9d5cfdd026739d98bac3e83a568f6f6d256d212ed542a28b2e3090e07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-16T11:46:06Z","title_canon_sha256":"607536c9e28384ea4e9b24c7e284cedf5f0b80cc64fef0df3640e2c7420f4ca8"},"schema_version":"1.0","source":{"id":"1603.05047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.05047","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1603.05047v1","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05047","created_at":"2026-05-18T01:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"YNMTH7C5WVJD","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YNMTH7C5WVJDG2HH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YNMTH7C5","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:d631d8a1ea59eef5ef60813008b0bf47ebe18bc5e60dd5e9f403ea93a9efa442","target":"graph","created_at":"2026-05-18T01:18:58Z","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":"A number of concurrent, relaxed priority queues have recently been proposed and implemented. Results are commonly reported for a throughput benchmark that uses a uniform distribution of keys drawn from a large integer range, and mostly for single systems. We have conducted more extensive benchmarking of three recent, relaxed priority queues on four different types of systems with different key ranges and distributions. While we can show superior throughput and scalability for our own k-LSM priority queue for the uniform key distribution, the picture changes drastically for other distributions,","authors_text":"Jakob Gruber, Jesper Larsson Tr\\\"aff, Martin Wimmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-16T11:46:06Z","title":"Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05047","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:e083e0392ab63c10114b8e3bc7847d3bf7d6458f9bc326eaf56f3818a6aa699b","target":"record","created_at":"2026-05-18T01:18:58Z","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":"228dd2f9d5cfdd026739d98bac3e83a568f6f6d256d212ed542a28b2e3090e07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-16T11:46:06Z","title_canon_sha256":"607536c9e28384ea4e9b24c7e284cedf5f0b80cc64fef0df3640e2c7420f4ca8"},"schema_version":"1.0","source":{"id":"1603.05047","kind":"arxiv","version":1}},"canonical_sha256":"c35933fc5db5523368e751aaf0c5bf1b6eaa08ad02b1b7e6433e71a889c286d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c35933fc5db5523368e751aaf0c5bf1b6eaa08ad02b1b7e6433e71a889c286d6","first_computed_at":"2026-05-18T01:18:58.118915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:58.118915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+BFjCJhJVXe4WOhhX/VnBT7+XG+0tWt7BZOb3URTrjuRJE+DchAcbAprDaDoV+klVfUPh+p0R4lv3KhjxIL7BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:58.119351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.05047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e083e0392ab63c10114b8e3bc7847d3bf7d6458f9bc326eaf56f3818a6aa699b","sha256:d631d8a1ea59eef5ef60813008b0bf47ebe18bc5e60dd5e9f403ea93a9efa442"],"state_sha256":"0207e8894b680b033e3749890628882b15b4b5c910caacf29bd0db45cd6bc407"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H86varzNIjYKsm+u1QsY4K3G+aLc0b+9uxDGHLZ1wvHFv21gwddwcmLcgYLvuJND7pFPz97zWtSKxr3pcqbjAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:36:33.003263Z","bundle_sha256":"7acf92c13d403a1b2f1e3d1cbb08af3fd84893b72dc4ff33edae7fd2e0043576"}}