{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:GYDFUQAOVAJSPFHSBB4GQDSHRI","short_pith_number":"pith:GYDFUQAO","canonical_record":{"source":{"id":"0910.2582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-14T12:18:28Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"1c1d6bd9c7d3d61edf9b1311c12301be297f43574c3c40e2bbaffe81eeb811ef","abstract_canon_sha256":"e40c2eea02cd4d4fef9f43b73d9c7fb0e806c1b5c0dc966f05bb73c764eefc9c"},"schema_version":"1.0"},"canonical_sha256":"36065a400ea8132794f20878680e478a3882c300dd9cabb7540ac89c35a0feb4","source":{"kind":"arxiv","id":"0910.2582","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.2582","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"0910.2582v1","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2582","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"GYDFUQAOVAJS","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"pith_short_16","alias_value":"GYDFUQAOVAJSPFHS","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"pith_short_8","alias_value":"GYDFUQAO","created_at":"2026-07-04T15:54:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:GYDFUQAOVAJSPFHSBB4GQDSHRI","target":"record","payload":{"canonical_record":{"source":{"id":"0910.2582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-14T12:18:28Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"1c1d6bd9c7d3d61edf9b1311c12301be297f43574c3c40e2bbaffe81eeb811ef","abstract_canon_sha256":"e40c2eea02cd4d4fef9f43b73d9c7fb0e806c1b5c0dc966f05bb73c764eefc9c"},"schema_version":"1.0"},"canonical_sha256":"36065a400ea8132794f20878680e478a3882c300dd9cabb7540ac89c35a0feb4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:54:27.300283Z","signature_b64":"IuC0U5m377r0C1ARQWkeBLAPizi+bP6VDe7KYk1g/7+IjNGjoeT0SObI2mjqIMfntoVEqnMYm0sj1HSKqUw2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36065a400ea8132794f20878680e478a3882c300dd9cabb7540ac89c35a0feb4","last_reissued_at":"2026-07-04T15:54:27.299940Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:54:27.299940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.2582","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-07-04T15:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8XsjOQUC6C4EjnoJTFxjbmJcnyZD0XJ2BkjjKBX/aJLNFQNUKFgzVcyQsQNc1PLbPsRUrjB4lDrTcynKpuGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:42:12.227832Z"},"content_sha256":"2daf3791d3b93bd970701252ef6aef2fc21b92c564fe640aae81cc66f8e2ee3d","schema_version":"1.0","event_id":"sha256:2daf3791d3b93bd970701252ef6aef2fc21b92c564fe640aae81cc66f8e2ee3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:GYDFUQAOVAJSPFHSBB4GQDSHRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Distributed-Memory External Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.DS","authors_text":"Johannes Singler, Mirko Rahn, Peter Sanders","submitted_at":"2009-10-14T12:18:28Z","abstract_excerpt":"We engineer algorithms for sorting huge data sets on massively parallel machines. The algorithms are based on the multiway merging paradigm. We first outline an algorithm whose I/O requirement is close to a lower bound. Thus, in contrast to naive implementations of multiway merging and all other approaches known to us, the algorithm works with just two passes over the data even for the largest conceivable inputs. A second algorithm reduces communication overhead and uses more conventional specifications of the result at the cost of slightly increased I/O requirements. An implementation wins th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2582","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/0910.2582/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-07-04T15:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYqLEJ8vGU0WDh0gF1obh2G0GAhwJ/wYTky03IA27ZEzGvtruTlFfHTg8mE0L+oOe6l6x88nGIbdAy6YAqYvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T19:42:12.228206Z"},"content_sha256":"82cc68276a7e1a21ca0f6541b02b4437b3fb524cb9a789d612f09369d500ae23","schema_version":"1.0","event_id":"sha256:82cc68276a7e1a21ca0f6541b02b4437b3fb524cb9a789d612f09369d500ae23"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYDFUQAOVAJSPFHSBB4GQDSHRI/bundle.json","state_url":"https://pith.science/pith/GYDFUQAOVAJSPFHSBB4GQDSHRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYDFUQAOVAJSPFHSBB4GQDSHRI/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-07-04T19:42:12Z","links":{"resolver":"https://pith.science/pith/GYDFUQAOVAJSPFHSBB4GQDSHRI","bundle":"https://pith.science/pith/GYDFUQAOVAJSPFHSBB4GQDSHRI/bundle.json","state":"https://pith.science/pith/GYDFUQAOVAJSPFHSBB4GQDSHRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYDFUQAOVAJSPFHSBB4GQDSHRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:GYDFUQAOVAJSPFHSBB4GQDSHRI","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":"e40c2eea02cd4d4fef9f43b73d9c7fb0e806c1b5c0dc966f05bb73c764eefc9c","cross_cats_sorted":["cs.DC","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-14T12:18:28Z","title_canon_sha256":"1c1d6bd9c7d3d61edf9b1311c12301be297f43574c3c40e2bbaffe81eeb811ef"},"schema_version":"1.0","source":{"id":"0910.2582","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.2582","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"0910.2582v1","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.2582","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"GYDFUQAOVAJS","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"pith_short_16","alias_value":"GYDFUQAOVAJSPFHS","created_at":"2026-07-04T15:54:27Z"},{"alias_kind":"pith_short_8","alias_value":"GYDFUQAO","created_at":"2026-07-04T15:54:27Z"}],"graph_snapshots":[{"event_id":"sha256:82cc68276a7e1a21ca0f6541b02b4437b3fb524cb9a789d612f09369d500ae23","target":"graph","created_at":"2026-07-04T15:54:27Z","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/0910.2582/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We engineer algorithms for sorting huge data sets on massively parallel machines. The algorithms are based on the multiway merging paradigm. We first outline an algorithm whose I/O requirement is close to a lower bound. Thus, in contrast to naive implementations of multiway merging and all other approaches known to us, the algorithm works with just two passes over the data even for the largest conceivable inputs. A second algorithm reduces communication overhead and uses more conventional specifications of the result at the cost of slightly increased I/O requirements. An implementation wins th","authors_text":"Johannes Singler, Mirko Rahn, Peter Sanders","cross_cats":["cs.DC","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-14T12:18:28Z","title":"Scalable Distributed-Memory External Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.2582","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:2daf3791d3b93bd970701252ef6aef2fc21b92c564fe640aae81cc66f8e2ee3d","target":"record","created_at":"2026-07-04T15:54:27Z","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":"e40c2eea02cd4d4fef9f43b73d9c7fb0e806c1b5c0dc966f05bb73c764eefc9c","cross_cats_sorted":["cs.DC","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-10-14T12:18:28Z","title_canon_sha256":"1c1d6bd9c7d3d61edf9b1311c12301be297f43574c3c40e2bbaffe81eeb811ef"},"schema_version":"1.0","source":{"id":"0910.2582","kind":"arxiv","version":1}},"canonical_sha256":"36065a400ea8132794f20878680e478a3882c300dd9cabb7540ac89c35a0feb4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36065a400ea8132794f20878680e478a3882c300dd9cabb7540ac89c35a0feb4","first_computed_at":"2026-07-04T15:54:27.299940Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:54:27.299940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IuC0U5m377r0C1ARQWkeBLAPizi+bP6VDe7KYk1g/7+IjNGjoeT0SObI2mjqIMfntoVEqnMYm0sj1HSKqUw2BQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:54:27.300283Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.2582","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2daf3791d3b93bd970701252ef6aef2fc21b92c564fe640aae81cc66f8e2ee3d","sha256:82cc68276a7e1a21ca0f6541b02b4437b3fb524cb9a789d612f09369d500ae23"],"state_sha256":"c18959661648c6d207f24bf29912c332f644716a9ca14cda21cdde2c4ef44b4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7xNVyZRwkw6PZQMBY7EA1+b2OXNGaY2weh1aAXIathclYup9LLj3lYsgg160WrmeVjDL1mCZyUN9QOZjcqsKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T19:42:12.230214Z","bundle_sha256":"05fcde09677e646a898207494010c8a3c5a27c1362d7e6a76d4fa8eedb31eb12"}}