{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:B6SYQFVABXGTMUKKYEPW5GF6UT","short_pith_number":"pith:B6SYQFVA","canonical_record":{"source":{"id":"2606.09318","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-08T10:28:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"29fc72d8bee086e5f06dd54f31aa7c5107028d80ab1828a4ee5a7f5d71064c44","abstract_canon_sha256":"9c686563c1701f8b267835ab30f587f6348e9fad5cfeaef90a2c92770db1a0d7"},"schema_version":"1.0"},"canonical_sha256":"0fa58816a00dcd36514ac11f6e98bea4df7c9453460057b4be8986eb966648d3","source":{"kind":"arxiv","id":"2606.09318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09318","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09318v1","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09318","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"B6SYQFVABXGT","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"pith_short_16","alias_value":"B6SYQFVABXGTMUKK","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"pith_short_8","alias_value":"B6SYQFVA","created_at":"2026-06-09T02:08:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:B6SYQFVABXGTMUKKYEPW5GF6UT","target":"record","payload":{"canonical_record":{"source":{"id":"2606.09318","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-08T10:28:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"29fc72d8bee086e5f06dd54f31aa7c5107028d80ab1828a4ee5a7f5d71064c44","abstract_canon_sha256":"9c686563c1701f8b267835ab30f587f6348e9fad5cfeaef90a2c92770db1a0d7"},"schema_version":"1.0"},"canonical_sha256":"0fa58816a00dcd36514ac11f6e98bea4df7c9453460057b4be8986eb966648d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T02:08:14.726730Z","signature_b64":"sGzSfP8sPcEE7F+v/eLEeJEkq1V+jWQDZuG0Xsow3E+6+Uc0EmPDMzl5iQN6SJgRmJvXo6iKaY0znb7+3+HCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fa58816a00dcd36514ac11f6e98bea4df7c9453460057b4be8986eb966648d3","last_reissued_at":"2026-06-09T02:08:14.725891Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T02:08:14.725891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.09318","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-09T02:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5bLrYhWmiZK6+2FhjL/ruf1+H1lbV29d/HfSFPyFbtfl28UYJmCi32ow/298v+fiD6NyD08typCQDXF1hIxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:42:50.654367Z"},"content_sha256":"29cbd049438121017131318d93242fca6c22e8dfe7de2cec2ab610256ef5cde9","schema_version":"1.0","event_id":"sha256:29cbd049438121017131318d93242fca6c22e8dfe7de2cec2ab610256ef5cde9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:B6SYQFVABXGTMUKKYEPW5GF6UT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Engineering Scalable Distributed List Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Matthias Schimek, Peter Sanders, Thomas Weidmann, Tim Niklas Uhl","submitted_at":"2026-06-08T10:28:44Z","abstract_excerpt":"The list ranking problem is one of the classical problems of parallel computing, with nontrivial algorithms and many applications as a subroutine for solving other problems. While it has been intensively studied in the early days of parallel computing, few things happened in the last 20 years. In particular, there is little work on scaling list ranking to large machines and input sizes. We reconsider list ranking starting from the ground-breaking results of Sibeyn a quarter century ago. We employ algorithm and performance engineering to improve his sparse ruling-set algorithm, making it capabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09318","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.09318/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-09T02:08:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RE2j8hnjyuKL3CUEWi9KPgLasBrRpokYH/JRJKxRKmxXizd9rFsKzNgQPmE4UEMFNcNRDOOw7Hbo3KwvUbsTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:42:50.654753Z"},"content_sha256":"15fe76f259bd904438acc38def7b3b05d42942b4685f6918f8c5c0010db288bb","schema_version":"1.0","event_id":"sha256:15fe76f259bd904438acc38def7b3b05d42942b4685f6918f8c5c0010db288bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B6SYQFVABXGTMUKKYEPW5GF6UT/bundle.json","state_url":"https://pith.science/pith/B6SYQFVABXGTMUKKYEPW5GF6UT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B6SYQFVABXGTMUKKYEPW5GF6UT/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-29T20:42:50Z","links":{"resolver":"https://pith.science/pith/B6SYQFVABXGTMUKKYEPW5GF6UT","bundle":"https://pith.science/pith/B6SYQFVABXGTMUKKYEPW5GF6UT/bundle.json","state":"https://pith.science/pith/B6SYQFVABXGTMUKKYEPW5GF6UT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B6SYQFVABXGTMUKKYEPW5GF6UT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:B6SYQFVABXGTMUKKYEPW5GF6UT","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":"9c686563c1701f8b267835ab30f587f6348e9fad5cfeaef90a2c92770db1a0d7","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-08T10:28:44Z","title_canon_sha256":"29fc72d8bee086e5f06dd54f31aa7c5107028d80ab1828a4ee5a7f5d71064c44"},"schema_version":"1.0","source":{"id":"2606.09318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09318","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09318v1","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09318","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"pith_short_12","alias_value":"B6SYQFVABXGT","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"pith_short_16","alias_value":"B6SYQFVABXGTMUKK","created_at":"2026-06-09T02:08:14Z"},{"alias_kind":"pith_short_8","alias_value":"B6SYQFVA","created_at":"2026-06-09T02:08:14Z"}],"graph_snapshots":[{"event_id":"sha256:15fe76f259bd904438acc38def7b3b05d42942b4685f6918f8c5c0010db288bb","target":"graph","created_at":"2026-06-09T02:08:14Z","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.09318/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The list ranking problem is one of the classical problems of parallel computing, with nontrivial algorithms and many applications as a subroutine for solving other problems. While it has been intensively studied in the early days of parallel computing, few things happened in the last 20 years. In particular, there is little work on scaling list ranking to large machines and input sizes. We reconsider list ranking starting from the ground-breaking results of Sibeyn a quarter century ago. We employ algorithm and performance engineering to improve his sparse ruling-set algorithm, making it capabl","authors_text":"Matthias Schimek, Peter Sanders, Thomas Weidmann, Tim Niklas Uhl","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-08T10:28:44Z","title":"Engineering Scalable Distributed List Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09318","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:29cbd049438121017131318d93242fca6c22e8dfe7de2cec2ab610256ef5cde9","target":"record","created_at":"2026-06-09T02:08:14Z","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":"9c686563c1701f8b267835ab30f587f6348e9fad5cfeaef90a2c92770db1a0d7","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-08T10:28:44Z","title_canon_sha256":"29fc72d8bee086e5f06dd54f31aa7c5107028d80ab1828a4ee5a7f5d71064c44"},"schema_version":"1.0","source":{"id":"2606.09318","kind":"arxiv","version":1}},"canonical_sha256":"0fa58816a00dcd36514ac11f6e98bea4df7c9453460057b4be8986eb966648d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0fa58816a00dcd36514ac11f6e98bea4df7c9453460057b4be8986eb966648d3","first_computed_at":"2026-06-09T02:08:14.725891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:08:14.725891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sGzSfP8sPcEE7F+v/eLEeJEkq1V+jWQDZuG0Xsow3E+6+Uc0EmPDMzl5iQN6SJgRmJvXo6iKaY0znb7+3+HCDA==","signature_status":"signed_v1","signed_at":"2026-06-09T02:08:14.726730Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.09318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29cbd049438121017131318d93242fca6c22e8dfe7de2cec2ab610256ef5cde9","sha256:15fe76f259bd904438acc38def7b3b05d42942b4685f6918f8c5c0010db288bb"],"state_sha256":"4202891774dbe830ca9753d65e4ca81a4bcddfda8829a44bb2f84b64eb39694c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1WvX7sDfh9rE9Y26Ps35nMaxcvupof2rf3hi8r4mmYnhK5XkHtWXpe9mkp2XpgxcEQrBZjA7O2tGYnzG3xxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T20:42:50.656755Z","bundle_sha256":"f7bacc1ed841a3d8a50a1da45d09a1fa4f1e4c2fc1a7574e564da41349ff5259"}}