{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UAJJLDTWP5DWXEWJWA4KRKUY5N","short_pith_number":"pith:UAJJLDTW","canonical_record":{"source":{"id":"1312.2018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T21:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"ff02b5a6fa151c098fef84097f549ec13733d3a25ca1318e15e458beb266eeb0","abstract_canon_sha256":"414e55f125be762ea6275f54ff58dd7f8f72ccc1e52c37cd867042503e96e5f9"},"schema_version":"1.0"},"canonical_sha256":"a012958e767f476b92c9b038a8aa98eb6863011a284df4efc70b90c469269f11","source":{"kind":"arxiv","id":"1312.2018","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2018","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2018v2","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2018","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"UAJJLDTWP5DW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UAJJLDTWP5DWXEWJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UAJJLDTW","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UAJJLDTWP5DWXEWJWA4KRKUY5N","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T21:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"ff02b5a6fa151c098fef84097f549ec13733d3a25ca1318e15e458beb266eeb0","abstract_canon_sha256":"414e55f125be762ea6275f54ff58dd7f8f72ccc1e52c37cd867042503e96e5f9"},"schema_version":"1.0"},"canonical_sha256":"a012958e767f476b92c9b038a8aa98eb6863011a284df4efc70b90c469269f11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:08.373403Z","signature_b64":"mdQU8MW2RAZPzvMiOV3MqZNXp9JeGKA874MKqj6dfPVp6zhXeSlqQI7yPNO3lGkHDqDku8R8BiihOHDR5Sd/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a012958e767f476b92c9b038a8aa98eb6863011a284df4efc70b90c469269f11","last_reissued_at":"2026-05-18T03:05:08.372928Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:08.372928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2018","source_version":2,"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-18T03:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mLCDH/00l1EagL5AmT8SG1fNjbo4i2WjdWWIEE+8LYtNAA1GZzqr5p+zFw8IZzUklAOpJjhH9jU9r/5BezoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:58:41.744235Z"},"content_sha256":"a72a4f9465aa2f8746182a2876de904997c0abb276dd0330585f01761f21a603","schema_version":"1.0","event_id":"sha256:a72a4f9465aa2f8746182a2876de904997c0abb276dd0330585f01761f21a603"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UAJJLDTWP5DWXEWJWA4KRKUY5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RAM-Efficient External Memory Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lars Arge, Mikkel Thorup","submitted_at":"2013-12-06T21:26:44Z","abstract_excerpt":"In recent years a large number of problems have been considered in external memory models of computation, where the complexity measure is the number of blocks of data that are moved between slow external memory and fast internal memory (also called I/Os). In practice, however, internal memory time often dominates the total running time once I/O-efficiency has been obtained. In this paper we study algorithms for fundamental problems that are simultaneously I/O-efficient and internal memory efficient in the RAM model of computation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2018","kind":"arxiv","version":2},"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-18T03:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VE+fDl4pZkil6ofTwmh74MKEyCe+n499poRHMe165bHNU1pAwaju+19B7Dck1DifD5Eem0tIPRxCKFmOH+qDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:58:41.744830Z"},"content_sha256":"cd06337506cc40fb1fecab4cbe22307f2353109e2ad530d0786d3fb6b5afbc2c","schema_version":"1.0","event_id":"sha256:cd06337506cc40fb1fecab4cbe22307f2353109e2ad530d0786d3fb6b5afbc2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAJJLDTWP5DWXEWJWA4KRKUY5N/bundle.json","state_url":"https://pith.science/pith/UAJJLDTWP5DWXEWJWA4KRKUY5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAJJLDTWP5DWXEWJWA4KRKUY5N/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-08T22:58:41Z","links":{"resolver":"https://pith.science/pith/UAJJLDTWP5DWXEWJWA4KRKUY5N","bundle":"https://pith.science/pith/UAJJLDTWP5DWXEWJWA4KRKUY5N/bundle.json","state":"https://pith.science/pith/UAJJLDTWP5DWXEWJWA4KRKUY5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAJJLDTWP5DWXEWJWA4KRKUY5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UAJJLDTWP5DWXEWJWA4KRKUY5N","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":"414e55f125be762ea6275f54ff58dd7f8f72ccc1e52c37cd867042503e96e5f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T21:26:44Z","title_canon_sha256":"ff02b5a6fa151c098fef84097f549ec13733d3a25ca1318e15e458beb266eeb0"},"schema_version":"1.0","source":{"id":"1312.2018","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2018","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2018v2","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2018","created_at":"2026-05-18T03:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"UAJJLDTWP5DW","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UAJJLDTWP5DWXEWJ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UAJJLDTW","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:cd06337506cc40fb1fecab4cbe22307f2353109e2ad530d0786d3fb6b5afbc2c","target":"graph","created_at":"2026-05-18T03:05:08Z","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":"In recent years a large number of problems have been considered in external memory models of computation, where the complexity measure is the number of blocks of data that are moved between slow external memory and fast internal memory (also called I/Os). In practice, however, internal memory time often dominates the total running time once I/O-efficiency has been obtained. In this paper we study algorithms for fundamental problems that are simultaneously I/O-efficient and internal memory efficient in the RAM model of computation.","authors_text":"Lars Arge, Mikkel Thorup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T21:26:44Z","title":"RAM-Efficient External Memory Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2018","kind":"arxiv","version":2},"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:a72a4f9465aa2f8746182a2876de904997c0abb276dd0330585f01761f21a603","target":"record","created_at":"2026-05-18T03:05:08Z","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":"414e55f125be762ea6275f54ff58dd7f8f72ccc1e52c37cd867042503e96e5f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-06T21:26:44Z","title_canon_sha256":"ff02b5a6fa151c098fef84097f549ec13733d3a25ca1318e15e458beb266eeb0"},"schema_version":"1.0","source":{"id":"1312.2018","kind":"arxiv","version":2}},"canonical_sha256":"a012958e767f476b92c9b038a8aa98eb6863011a284df4efc70b90c469269f11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a012958e767f476b92c9b038a8aa98eb6863011a284df4efc70b90c469269f11","first_computed_at":"2026-05-18T03:05:08.372928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:08.372928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mdQU8MW2RAZPzvMiOV3MqZNXp9JeGKA874MKqj6dfPVp6zhXeSlqQI7yPNO3lGkHDqDku8R8BiihOHDR5Sd/Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:08.373403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2018","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a72a4f9465aa2f8746182a2876de904997c0abb276dd0330585f01761f21a603","sha256:cd06337506cc40fb1fecab4cbe22307f2353109e2ad530d0786d3fb6b5afbc2c"],"state_sha256":"af673ea273d4970f53f0194a790cdb400eff405b1b06eb3ecc58bb6685fe6c8c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CzwlgwXFkpV/qNtBVVuMy+9qhIK1dWsx5ie8GLuvlZZgvTku6s0ZqtbfRUOq3O0wpf8uS2gd/uAthbdv34+hDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:58:41.747718Z","bundle_sha256":"160efd3f0ee1ed79739d8c876415634946c5bc0c46a1a03fecfbfa697fd443fb"}}