{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LZW6HU42SSETTJ7GJX5LBZ4JG6","short_pith_number":"pith:LZW6HU42","schema_version":"1.0","canonical_sha256":"5e6de3d39a948939a7e64dfab0e78937b8ff04af700ba6ca54e2523d431b2a47","source":{"kind":"arxiv","id":"1508.01504","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.01504","created_at":"2026-05-18T00:31:31.810487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.01504v2","created_at":"2026-05-18T00:31:31.810487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01504","created_at":"2026-05-18T00:31:31.810487+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZW6HU42SSET","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZW6HU42SSETTJ7G","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZW6HU42","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6","json":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6.json","graph_json":"https://pith.science/api/pith-number/LZW6HU42SSETTJ7GJX5LBZ4JG6/graph.json","events_json":"https://pith.science/api/pith-number/LZW6HU42SSETTJ7GJX5LBZ4JG6/events.json","paper":"https://pith.science/paper/LZW6HU42"},"agent_actions":{"view_html":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6","download_json":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6.json","view_paper":"https://pith.science/paper/LZW6HU42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.01504&json=true","fetch_graph":"https://pith.science/api/pith-number/LZW6HU42SSETTJ7GJX5LBZ4JG6/graph.json","fetch_events":"https://pith.science/api/pith-number/LZW6HU42SSETTJ7GJX5LBZ4JG6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/action/storage_attestation","attest_author":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/action/author_attestation","sign_citation":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/action/citation_signature","submit_replication":"https://pith.science/pith/LZW6HU42SSETTJ7GJX5LBZ4JG6/action/replication_record"}},"created_at":"2026-05-18T00:31:31.810487+00:00","updated_at":"2026-05-18T00:31:31.810487+00:00"}