{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LZW6HU42SSETTJ7GJX5LBZ4JG6","short_pith_number":"pith:LZW6HU42","canonical_record":{"source":{"id":"1508.01504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T19:32:53Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"651c3564cedf63272391cffc81a3a3bc2330553152b06354a0f351b393597662","abstract_canon_sha256":"5ee40cab48868d5150830a5623dd1646d5da6271a8d194ba5bd6f13280a580d2"},"schema_version":"1.0"},"canonical_sha256":"5e6de3d39a948939a7e64dfab0e78937b8ff04af700ba6ca54e2523d431b2a47","source":{"kind":"arxiv","id":"1508.01504","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01504","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01504v2","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01504","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"LZW6HU42SSET","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZW6HU42SSETTJ7G","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZW6HU42","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LZW6HU42SSETTJ7GJX5LBZ4JG6","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01504","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T19:32:53Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"651c3564cedf63272391cffc81a3a3bc2330553152b06354a0f351b393597662","abstract_canon_sha256":"5ee40cab48868d5150830a5623dd1646d5da6271a8d194ba5bd6f13280a580d2"},"schema_version":"1.0"},"canonical_sha256":"5e6de3d39a948939a7e64dfab0e78937b8ff04af700ba6ca54e2523d431b2a47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:31.811095Z","signature_b64":"eQicWo41g+7wZsGbjrVJ9oD6BqNaKY/oROv68Lqc5VURDOPNNaIzh01swFEKFusOj2G1TyfKxUUWEfgxO3LjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e6de3d39a948939a7e64dfab0e78937b8ff04af700ba6ca54e2523d431b2a47","last_reissued_at":"2026-05-18T00:31:31.810347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:31.810347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01504","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-18T00:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WEVjqeOqt+cAXTwjJlIqp38rrtbb3RRm6SyW7qE/+7yggda6llR2imamawXYBJYuh461u20M5X+OHFohYNaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:24:43.682936Z"},"content_sha256":"a67eb7f039b5c656c2908a8897dfd1f53217458a4f6cc641c5fcc3171375a8a8","schema_version":"1.0","event_id":"sha256:a67eb7f039b5c656c2908a8897dfd1f53217458a4f6cc641c5fcc3171375a8a8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LZW6HU42SSETTJ7GJX5LBZ4JG6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Oblivious Sorting on Multicores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Richard Cole, Vijaya Ramachandran","submitted_at":"2015-08-06T19:32:53Z","abstract_excerpt":"We present a deterministic sorting algorithm, SPMS (Sample, Partition, and Merge Sort), that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts $n$ elements in $O(n \\log n)$ time cache-obliviously with an optimal number of cache misses. The parallel complexity (or critical path length) of the algorithm is $O(\\log n \\cdot \\log\\log n)$, which improves on previous bounds for optimal cache oblivious sorting. The algorithm also has low false sharing costs. When scheduled by a work-stealing scheduler in a multicore computing environment with a global shared memory and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01504","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-18T00:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rwDVMiNCRC8anY/orAZo65jZhuLYtzUvvf85RzZakxkqq7cAHvarKglQoC/fhlC7OR0Fo6Ctiri3xqbvjBK1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:24:43.683273Z"},"content_sha256":"f486e81977b13f28ad357f94fb81842e8135874cec7bde2406f9941d3e1d2002","schema_version":"1.0","event_id":"sha256:f486e81977b13f28ad357f94fb81842e8135874cec7bde2406f9941d3e1d2002"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/bundle.json","state_url":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/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-24T21:24:43Z","links":{"resolver":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6","bundle":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/bundle.json","state":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LZW6HU42SSETTJ7GJX5LBZ4JG6","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":"5ee40cab48868d5150830a5623dd1646d5da6271a8d194ba5bd6f13280a580d2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T19:32:53Z","title_canon_sha256":"651c3564cedf63272391cffc81a3a3bc2330553152b06354a0f351b393597662"},"schema_version":"1.0","source":{"id":"1508.01504","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01504","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01504v2","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01504","created_at":"2026-05-18T00:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"LZW6HU42SSET","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LZW6HU42SSETTJ7G","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LZW6HU42","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:f486e81977b13f28ad357f94fb81842e8135874cec7bde2406f9941d3e1d2002","target":"graph","created_at":"2026-05-18T00:31:31Z","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 present a deterministic sorting algorithm, SPMS (Sample, Partition, and Merge Sort), that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts $n$ elements in $O(n \\log n)$ time cache-obliviously with an optimal number of cache misses. The parallel complexity (or critical path length) of the algorithm is $O(\\log n \\cdot \\log\\log n)$, which improves on previous bounds for optimal cache oblivious sorting. The algorithm also has low false sharing costs. When scheduled by a work-stealing scheduler in a multicore computing environment with a global shared memory and","authors_text":"Richard Cole, Vijaya Ramachandran","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T19:32:53Z","title":"Resource Oblivious Sorting on Multicores"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01504","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:a67eb7f039b5c656c2908a8897dfd1f53217458a4f6cc641c5fcc3171375a8a8","target":"record","created_at":"2026-05-18T00:31:31Z","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":"5ee40cab48868d5150830a5623dd1646d5da6271a8d194ba5bd6f13280a580d2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-06T19:32:53Z","title_canon_sha256":"651c3564cedf63272391cffc81a3a3bc2330553152b06354a0f351b393597662"},"schema_version":"1.0","source":{"id":"1508.01504","kind":"arxiv","version":2}},"canonical_sha256":"5e6de3d39a948939a7e64dfab0e78937b8ff04af700ba6ca54e2523d431b2a47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e6de3d39a948939a7e64dfab0e78937b8ff04af700ba6ca54e2523d431b2a47","first_computed_at":"2026-05-18T00:31:31.810347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:31.810347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eQicWo41g+7wZsGbjrVJ9oD6BqNaKY/oROv68Lqc5VURDOPNNaIzh01swFEKFusOj2G1TyfKxUUWEfgxO3LjCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:31.811095Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01504","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a67eb7f039b5c656c2908a8897dfd1f53217458a4f6cc641c5fcc3171375a8a8","sha256:f486e81977b13f28ad357f94fb81842e8135874cec7bde2406f9941d3e1d2002"],"state_sha256":"74f10d40676e76b635af087bab1e70c9e95dd1d0236af9f95f67246feb53f1b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txWzTpbEH1Shanex2opzeswfoY8YxXSRnCUInit1cjKoBkR3OoHr41Ahb9+IGHRMnc62KaNdCIN/4PFWd6AkDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:24:43.685415Z","bundle_sha256":"adcf21b865d5d6bf74adf97335c0f26729d7177bd1c273e5e99ecac59fa21ad6"}}