{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ORAHJTNZPRREZYWMC4SGWFPQLH","short_pith_number":"pith:ORAHJTNZ","canonical_record":{"source":{"id":"1805.03472","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-09T12:16:04Z","cross_cats_sorted":[],"title_canon_sha256":"26a3f4a17f5fed75f6543d67527fef8e154444509db5ea0a64fe889cc90b0d3d","abstract_canon_sha256":"8a89180eb821a8a0a9b258f19e5724b6142dc3816099577df8096d9cc491618a"},"schema_version":"1.0"},"canonical_sha256":"744074cdb97c624ce2cc17246b15f059ff1d002b5ecc5f61013072402d94ec67","source":{"kind":"arxiv","id":"1805.03472","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03472","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03472v4","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03472","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"ORAHJTNZPRRE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORAHJTNZPRREZYWM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORAHJTNZ","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ORAHJTNZPRREZYWMC4SGWFPQLH","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03472","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-09T12:16:04Z","cross_cats_sorted":[],"title_canon_sha256":"26a3f4a17f5fed75f6543d67527fef8e154444509db5ea0a64fe889cc90b0d3d","abstract_canon_sha256":"8a89180eb821a8a0a9b258f19e5724b6142dc3816099577df8096d9cc491618a"},"schema_version":"1.0"},"canonical_sha256":"744074cdb97c624ce2cc17246b15f059ff1d002b5ecc5f61013072402d94ec67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:52.885809Z","signature_b64":"zdX0IjLSKT67VSpmSzFZVm0bCUmUTmOZR0Rprch+fu3YOruGVIGg2sTzcjxYjpepqbkECjD3VQexdpo32883DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"744074cdb97c624ce2cc17246b15f059ff1d002b5ecc5f61013072402d94ec67","last_reissued_at":"2026-05-17T23:49:52.885409Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:52.885409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03472","source_version":4,"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:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+fV4WAlCiNFdA0D32agMEalBKHVdXGky9yJhN+MtjAfx4yjYJD0HgymCREaFxZ3GIf1pLfFb3vAMST0GcW0WAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:13:20.966481Z"},"content_sha256":"3e8ce4c34b6553233251585939ef7825ae38ff84c402e93c3ba5a3f7d719f25b","schema_version":"1.0","event_id":"sha256:3e8ce4c34b6553233251585939ef7825ae38ff84c402e93c3ba5a3f7d719f25b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ORAHJTNZPRREZYWMC4SGWFPQLH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Scheideler, Michael Feldmann","submitted_at":"2018-05-09T12:16:04Z","abstract_excerpt":"We propose two protocols for distributed priority queues (for simplicity denoted 'heap') called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on top of which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the $k$-selection problem that runs in $O(\\log n)$ rounds w.h.p. SKEAP guarantees sequential consistency for its h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03472","kind":"arxiv","version":4},"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:49:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1akRqHDBiSMdyMxP+MT6Srm6ah8zv2QBxYQ/b1ZgZhkwPPioR9RAhSW9/6KjKg/6WLtsR3hWCz4dOT97NGLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:13:20.967168Z"},"content_sha256":"f00334f93a33cdfedd868bf91e9e904c82680896e5d9eca7be92cf9d0c74e173","schema_version":"1.0","event_id":"sha256:f00334f93a33cdfedd868bf91e9e904c82680896e5d9eca7be92cf9d0c74e173"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORAHJTNZPRREZYWMC4SGWFPQLH/bundle.json","state_url":"https://pith.science/pith/ORAHJTNZPRREZYWMC4SGWFPQLH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORAHJTNZPRREZYWMC4SGWFPQLH/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-05-29T15:13:20Z","links":{"resolver":"https://pith.science/pith/ORAHJTNZPRREZYWMC4SGWFPQLH","bundle":"https://pith.science/pith/ORAHJTNZPRREZYWMC4SGWFPQLH/bundle.json","state":"https://pith.science/pith/ORAHJTNZPRREZYWMC4SGWFPQLH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORAHJTNZPRREZYWMC4SGWFPQLH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ORAHJTNZPRREZYWMC4SGWFPQLH","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":"8a89180eb821a8a0a9b258f19e5724b6142dc3816099577df8096d9cc491618a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-09T12:16:04Z","title_canon_sha256":"26a3f4a17f5fed75f6543d67527fef8e154444509db5ea0a64fe889cc90b0d3d"},"schema_version":"1.0","source":{"id":"1805.03472","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03472","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03472v4","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03472","created_at":"2026-05-17T23:49:52Z"},{"alias_kind":"pith_short_12","alias_value":"ORAHJTNZPRRE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"ORAHJTNZPRREZYWM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"ORAHJTNZ","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:f00334f93a33cdfedd868bf91e9e904c82680896e5d9eca7be92cf9d0c74e173","target":"graph","created_at":"2026-05-17T23:49:52Z","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 propose two protocols for distributed priority queues (for simplicity denoted 'heap') called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on top of which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the $k$-selection problem that runs in $O(\\log n)$ rounds w.h.p. SKEAP guarantees sequential consistency for its h","authors_text":"Christian Scheideler, Michael Feldmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-09T12:16:04Z","title":"Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03472","kind":"arxiv","version":4},"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:3e8ce4c34b6553233251585939ef7825ae38ff84c402e93c3ba5a3f7d719f25b","target":"record","created_at":"2026-05-17T23:49:52Z","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":"8a89180eb821a8a0a9b258f19e5724b6142dc3816099577df8096d9cc491618a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-09T12:16:04Z","title_canon_sha256":"26a3f4a17f5fed75f6543d67527fef8e154444509db5ea0a64fe889cc90b0d3d"},"schema_version":"1.0","source":{"id":"1805.03472","kind":"arxiv","version":4}},"canonical_sha256":"744074cdb97c624ce2cc17246b15f059ff1d002b5ecc5f61013072402d94ec67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"744074cdb97c624ce2cc17246b15f059ff1d002b5ecc5f61013072402d94ec67","first_computed_at":"2026-05-17T23:49:52.885409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:52.885409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zdX0IjLSKT67VSpmSzFZVm0bCUmUTmOZR0Rprch+fu3YOruGVIGg2sTzcjxYjpepqbkECjD3VQexdpo32883DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:52.885809Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03472","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e8ce4c34b6553233251585939ef7825ae38ff84c402e93c3ba5a3f7d719f25b","sha256:f00334f93a33cdfedd868bf91e9e904c82680896e5d9eca7be92cf9d0c74e173"],"state_sha256":"9972391436a196019bc1b3b1c23b3a7870ab92b4b3610aec0cbe778052aca4a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJnmZp34OQJADlYxzwlXG0iuMu2DpArFnPg8fA7GZP96dQHN/zgG9Krr95r46/LpBfAmQtyJHYdHZdGn8W/UBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:13:20.970866Z","bundle_sha256":"c01cb6d16d8666c0452285656ba90d6f026ea1836b481fb3c1bf71f30a5b4630"}}