{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JN7VKIJ5SOMYIBLNDMZER2O2NP","short_pith_number":"pith:JN7VKIJ5","canonical_record":{"source":{"id":"1406.3279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T16:04:17Z","cross_cats_sorted":[],"title_canon_sha256":"812f6864197c64f258efbcae4decc505db16ebb5b47f08bdfdd218bbc5082356","abstract_canon_sha256":"0d6a3565d535c6cd7ffe2aa6ad9af960a374497af3add237c5ccdd6f46a866c0"},"schema_version":"1.0"},"canonical_sha256":"4b7f55213d939984056d1b3248e9da6bc24c1bf5b0d16fb5ea39c6f9095d09f6","source":{"kind":"arxiv","id":"1406.3279","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3279","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3279v1","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3279","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"JN7VKIJ5SOMY","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JN7VKIJ5SOMYIBLN","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JN7VKIJ5","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JN7VKIJ5SOMYIBLNDMZER2O2NP","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T16:04:17Z","cross_cats_sorted":[],"title_canon_sha256":"812f6864197c64f258efbcae4decc505db16ebb5b47f08bdfdd218bbc5082356","abstract_canon_sha256":"0d6a3565d535c6cd7ffe2aa6ad9af960a374497af3add237c5ccdd6f46a866c0"},"schema_version":"1.0"},"canonical_sha256":"4b7f55213d939984056d1b3248e9da6bc24c1bf5b0d16fb5ea39c6f9095d09f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:25.869629Z","signature_b64":"8dXxC1mJx9q/rt8WOX8KMpSy/Xxe2WpPSxzRxaPyuX0Hc1XnfowlI18b78wvMHohgkA6yMUAYCcQ/8N4qCJUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b7f55213d939984056d1b3248e9da6bc24c1bf5b0d16fb5ea39c6f9095d09f6","last_reissued_at":"2026-05-18T02:43:25.869044Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:25.869044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3279","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-18T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nX2XMU8rdCME80sZqyyPlH+piRx619pZq45LmXyVE4BbJrBL//W15Vfx3ivYrtAHl5qUMD2q7hLjC0b4+shmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:51:47.715167Z"},"content_sha256":"c4f4e74dc26e212ce05595e732076624c5c9fc0d8a1b5e0df729d14d77092e95","schema_version":"1.0","event_id":"sha256:c4f4e74dc26e212ce05595e732076624c5c9fc0d8a1b5e0df729d14d77092e95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JN7VKIJ5SOMYIBLNDMZER2O2NP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of List Ranking in the Parallel External Memory Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nodari Sitchinava, Riko Jacob, Tobias Lieber","submitted_at":"2014-06-12T16:04:17Z","abstract_excerpt":"We study the problem of list ranking in the parallel external memory (PEM) model. We observe an interesting dual nature for the hardness of the problem due to limited information exchange among the processors about the structure of the list, on the one hand, and its close relationship to the problem of permuting data, which is known to be hard for the external memory models, on the other hand.\n  By carefully defining the power of the computational model, we prove a permuting lower bound in the PEM model. Furthermore, we present a stronger \\Omega(log^2 N) lower bound for a special variant of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3279","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-18T02:43:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SeORjsoJvU9AyBbY1uSMzwPtPLgMacTauE6n8/A9sE3c7RuArASnqblDt+nKeuqzbJ4+HPBfVXS8cdcHjLcGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:51:47.715532Z"},"content_sha256":"2a676f80411a1f5ec2b0bf931416fb84ae248ecdd0596933870c7e9d82a5c2f6","schema_version":"1.0","event_id":"sha256:2a676f80411a1f5ec2b0bf931416fb84ae248ecdd0596933870c7e9d82a5c2f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JN7VKIJ5SOMYIBLNDMZER2O2NP/bundle.json","state_url":"https://pith.science/pith/JN7VKIJ5SOMYIBLNDMZER2O2NP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JN7VKIJ5SOMYIBLNDMZER2O2NP/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-25T09:51:47Z","links":{"resolver":"https://pith.science/pith/JN7VKIJ5SOMYIBLNDMZER2O2NP","bundle":"https://pith.science/pith/JN7VKIJ5SOMYIBLNDMZER2O2NP/bundle.json","state":"https://pith.science/pith/JN7VKIJ5SOMYIBLNDMZER2O2NP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JN7VKIJ5SOMYIBLNDMZER2O2NP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JN7VKIJ5SOMYIBLNDMZER2O2NP","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":"0d6a3565d535c6cd7ffe2aa6ad9af960a374497af3add237c5ccdd6f46a866c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T16:04:17Z","title_canon_sha256":"812f6864197c64f258efbcae4decc505db16ebb5b47f08bdfdd218bbc5082356"},"schema_version":"1.0","source":{"id":"1406.3279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3279","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3279v1","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3279","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"JN7VKIJ5SOMY","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JN7VKIJ5SOMYIBLN","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JN7VKIJ5","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:2a676f80411a1f5ec2b0bf931416fb84ae248ecdd0596933870c7e9d82a5c2f6","target":"graph","created_at":"2026-05-18T02:43:25Z","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 study the problem of list ranking in the parallel external memory (PEM) model. We observe an interesting dual nature for the hardness of the problem due to limited information exchange among the processors about the structure of the list, on the one hand, and its close relationship to the problem of permuting data, which is known to be hard for the external memory models, on the other hand.\n  By carefully defining the power of the computational model, we prove a permuting lower bound in the PEM model. Furthermore, we present a stronger \\Omega(log^2 N) lower bound for a special variant of th","authors_text":"Nodari Sitchinava, Riko Jacob, Tobias Lieber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T16:04:17Z","title":"On the Complexity of List Ranking in the Parallel External Memory Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3279","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:c4f4e74dc26e212ce05595e732076624c5c9fc0d8a1b5e0df729d14d77092e95","target":"record","created_at":"2026-05-18T02:43:25Z","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":"0d6a3565d535c6cd7ffe2aa6ad9af960a374497af3add237c5ccdd6f46a866c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-12T16:04:17Z","title_canon_sha256":"812f6864197c64f258efbcae4decc505db16ebb5b47f08bdfdd218bbc5082356"},"schema_version":"1.0","source":{"id":"1406.3279","kind":"arxiv","version":1}},"canonical_sha256":"4b7f55213d939984056d1b3248e9da6bc24c1bf5b0d16fb5ea39c6f9095d09f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b7f55213d939984056d1b3248e9da6bc24c1bf5b0d16fb5ea39c6f9095d09f6","first_computed_at":"2026-05-18T02:43:25.869044Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:25.869044Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8dXxC1mJx9q/rt8WOX8KMpSy/Xxe2WpPSxzRxaPyuX0Hc1XnfowlI18b78wvMHohgkA6yMUAYCcQ/8N4qCJUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:25.869629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4f4e74dc26e212ce05595e732076624c5c9fc0d8a1b5e0df729d14d77092e95","sha256:2a676f80411a1f5ec2b0bf931416fb84ae248ecdd0596933870c7e9d82a5c2f6"],"state_sha256":"b07f1e8d12b01b080897102b74d6c64b2c4619cd331078a8faca86668d646a91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WJBVPj92I82yMXQfrJQkrYcPdpQ5LtJ1zx5BqwokMDUKP+m7eq8Cl1V8U0na7x+MNPAROYS0IszSW+3o43nKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:51:47.717594Z","bundle_sha256":"7e75ca70e8c3849393f58459f4043837444ea84f1b926277214783061b3274bb"}}