{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QW2UOUQKTSZ37PF2OY6Y6IVEVX","short_pith_number":"pith:QW2UOUQK","schema_version":"1.0","canonical_sha256":"85b547520a9cb3bfbcba763d8f22a4adc9ff830937ca20b6ee7365eb7eb79489","source":{"kind":"arxiv","id":"1310.6271","version":2},"attestation_state":"computed","paper":{"title":"Optimal Sorting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Daniel Bundala, Jakub Z\\'avodn\\'y","submitted_at":"2013-10-23T16:09:19Z","abstract_excerpt":"This paper settles the optimality of sorting networks given in The Art of Computer Programming vol. 3 more than 40 years ago. The book lists efficient sorting networks with n <= 16 inputs. In this paper we give general combinatorial arguments showing that if a sorting network with a given depth exists then there exists one with a special form. We then construct propositional formulas whose satisfiability is necessary for the existence of such a network. Using a SAT solver we conclude that the listed networks have optimal depth. For n <= 10 inputs where optimality was known previously, our algo"},"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":"1310.6271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-23T16:09:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f4480b4ad02eb417c3e1fb8356ad5bedfddf581d585f79e7406e3c9842b824e6","abstract_canon_sha256":"f7e456fa37b981b7590719ad4176123f285524c8ddc0787080da92320770a298"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:06.205775Z","signature_b64":"WNt/WHlb8sIQ1T5e7WO6jv+LBaclNtXKPjoiYfMx9peilRXuJNGa+KCPpqIbxdIBxErJzGuW7HE5DmromuAwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85b547520a9cb3bfbcba763d8f22a4adc9ff830937ca20b6ee7365eb7eb79489","last_reissued_at":"2026-05-18T03:04:06.205148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:06.205148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Sorting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Daniel Bundala, Jakub Z\\'avodn\\'y","submitted_at":"2013-10-23T16:09:19Z","abstract_excerpt":"This paper settles the optimality of sorting networks given in The Art of Computer Programming vol. 3 more than 40 years ago. The book lists efficient sorting networks with n <= 16 inputs. In this paper we give general combinatorial arguments showing that if a sorting network with a given depth exists then there exists one with a special form. We then construct propositional formulas whose satisfiability is necessary for the existence of such a network. Using a SAT solver we conclude that the listed networks have optimal depth. For n <= 10 inputs where optimality was known previously, our algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6271","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":"1310.6271","created_at":"2026-05-18T03:04:06.205237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6271v2","created_at":"2026-05-18T03:04:06.205237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6271","created_at":"2026-05-18T03:04:06.205237+00:00"},{"alias_kind":"pith_short_12","alias_value":"QW2UOUQKTSZ3","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QW2UOUQKTSZ37PF2","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QW2UOUQK","created_at":"2026-05-18T12:27:57.521954+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/QW2UOUQKTSZ37PF2OY6Y6IVEVX","json":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX.json","graph_json":"https://pith.science/api/pith-number/QW2UOUQKTSZ37PF2OY6Y6IVEVX/graph.json","events_json":"https://pith.science/api/pith-number/QW2UOUQKTSZ37PF2OY6Y6IVEVX/events.json","paper":"https://pith.science/paper/QW2UOUQK"},"agent_actions":{"view_html":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX","download_json":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX.json","view_paper":"https://pith.science/paper/QW2UOUQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6271&json=true","fetch_graph":"https://pith.science/api/pith-number/QW2UOUQKTSZ37PF2OY6Y6IVEVX/graph.json","fetch_events":"https://pith.science/api/pith-number/QW2UOUQKTSZ37PF2OY6Y6IVEVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/action/storage_attestation","attest_author":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/action/author_attestation","sign_citation":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/action/citation_signature","submit_replication":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/action/replication_record"}},"created_at":"2026-05-18T03:04:06.205237+00:00","updated_at":"2026-05-18T03:04:06.205237+00:00"}