{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YTCH5NRD6FNDBG3TXE6SHG26DP","short_pith_number":"pith:YTCH5NRD","schema_version":"1.0","canonical_sha256":"c4c47eb623f15a309b73b93d239b5e1bd48b25340c4a74bde0387c8ab61a4e47","source":{"kind":"arxiv","id":"1505.01962","version":2},"attestation_state":"computed","paper":{"title":"Applying Sorting Networks to Synthesize Optimized Sorting Libraries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DS","authors_text":"Lu\\'is Cruz-Filipe, Markus Nebel, Michael Codish, Peter Schneider-Kamp","submitted_at":"2015-05-08T09:13:25Z","abstract_excerpt":"This paper shows an application of the theory of sorting networks to facilitate the synthesis of optimized general purpose sorting libraries. Standard sorting libraries are often based on combinations of the classic Quicksort algorithm with insertion sort applied as the base case for small fixed numbers of inputs. Unrolling the code for the base case by ignoring loop conditions eliminates branching and results in code which is equivalent to a sorting network. This enables the application of further program transformations based on sorting network optimizations, and eventually the synthesis of "},"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":"1505.01962","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-08T09:13:25Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"0fa420d7f21bd22b8c7c08d0c5ffea5ca1dda35ee483cc3dc63fe458423fc863","abstract_canon_sha256":"84e92230c585ce6332115eeeb28c1e0666b08bf35c4a7ee81ad3effc68967a20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:31.570409Z","signature_b64":"vcRASkHyFwHqFXGqXqmL19vIJd00qfsns50H/IJxG3S6o+jyxIZZ+z4s3KLaNBaP473f809oPqrh67yfhkvKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4c47eb623f15a309b73b93d239b5e1bd48b25340c4a74bde0387c8ab61a4e47","last_reissued_at":"2026-05-18T00:38:31.569851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:31.569851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Applying Sorting Networks to Synthesize Optimized Sorting Libraries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.DS","authors_text":"Lu\\'is Cruz-Filipe, Markus Nebel, Michael Codish, Peter Schneider-Kamp","submitted_at":"2015-05-08T09:13:25Z","abstract_excerpt":"This paper shows an application of the theory of sorting networks to facilitate the synthesis of optimized general purpose sorting libraries. Standard sorting libraries are often based on combinations of the classic Quicksort algorithm with insertion sort applied as the base case for small fixed numbers of inputs. Unrolling the code for the base case by ignoring loop conditions eliminates branching and results in code which is equivalent to a sorting network. This enables the application of further program transformations based on sorting network optimizations, and eventually the synthesis of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01962","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":"1505.01962","created_at":"2026-05-18T00:38:31.569943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01962v2","created_at":"2026-05-18T00:38:31.569943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01962","created_at":"2026-05-18T00:38:31.569943+00:00"},{"alias_kind":"pith_short_12","alias_value":"YTCH5NRD6FND","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YTCH5NRD6FNDBG3T","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YTCH5NRD","created_at":"2026-05-18T12:29:52.810259+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/YTCH5NRD6FNDBG3TXE6SHG26DP","json":"https://pith.science/pith/YTCH5NRD6FNDBG3TXE6SHG26DP.json","graph_json":"https://pith.science/api/pith-number/YTCH5NRD6FNDBG3TXE6SHG26DP/graph.json","events_json":"https://pith.science/api/pith-number/YTCH5NRD6FNDBG3TXE6SHG26DP/events.json","paper":"https://pith.science/paper/YTCH5NRD"},"agent_actions":{"view_html":"https://pith.science/pith/YTCH5NRD6FNDBG3TXE6SHG26DP","download_json":"https://pith.science/pith/YTCH5NRD6FNDBG3TXE6SHG26DP.json","view_paper":"https://pith.science/paper/YTCH5NRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01962&json=true","fetch_graph":"https://pith.science/api/pith-number/YTCH5NRD6FNDBG3TXE6SHG26DP/graph.json","fetch_events":"https://pith.science/api/pith-number/YTCH5NRD6FNDBG3TXE6SHG26DP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YTCH5NRD6FNDBG3TXE6SHG26DP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YTCH5NRD6FNDBG3TXE6SHG26DP/action/storage_attestation","attest_author":"https://pith.science/pith/YTCH5NRD6FNDBG3TXE6SHG26DP/action/author_attestation","sign_citation":"https://pith.science/pith/YTCH5NRD6FNDBG3TXE6SHG26DP/action/citation_signature","submit_replication":"https://pith.science/pith/YTCH5NRD6FNDBG3TXE6SHG26DP/action/replication_record"}},"created_at":"2026-05-18T00:38:31.569943+00:00","updated_at":"2026-05-18T00:38:31.569943+00:00"}