{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZVDO7P3SYAQLPRDKDWKOMJ7DWM","short_pith_number":"pith:ZVDO7P3S","schema_version":"1.0","canonical_sha256":"cd46efbf72c020b7c46a1d94e627e3b32f43144ec88405f8439ec44338fc209f","source":{"kind":"arxiv","id":"1412.5302","version":1},"attestation_state":"computed","paper":{"title":"Optimal-Depth Sorting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Bundala, Jakub Z\\'avodn\\'y, Lu\\'is Cruz-Filipe, Michael Codish, Peter Schneider-Kamp","submitted_at":"2014-12-17T09:36:06Z","abstract_excerpt":"We solve a 40-year-old open problem on the depth optimality of sorting networks. In 1973, Donald E. Knuth detailed, in Volume 3 of \"The Art of Computer Programming\", sorting networks of the smallest depth known at the time for n =< 16 inputs, quoting optimality for n =< 8. In 1989, Parberry proved the optimality of the networks with 9 =< n =< 10 inputs. In this article, we present a general technique for obtaining such optimality results, and use it to prove the optimality of the remaining open cases of 11 =< n =< 16 inputs. We show how to exploit symmetry to construct a small set of two-layer"},"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":"1412.5302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-17T09:36:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1afc5a6a920a19c9ebb40d676a1090abbedb02e4999a78a6b4bcee05044ab11b","abstract_canon_sha256":"39823af91ed23fcb93d9f00aae4c96c1277fbe5d17dfff9ceca097291879a2f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:26.245385Z","signature_b64":"4ohBk8HJrNPz8gTKVNYEuxC9UEz9y+X0MNMnex6Dn7pSYZ8hgZNCDXzpJS5OvlqQ29wMgjd1ztJ58V/uaWblAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd46efbf72c020b7c46a1d94e627e3b32f43144ec88405f8439ec44338fc209f","last_reissued_at":"2026-05-18T00:56:26.244783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:26.244783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal-Depth Sorting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel Bundala, Jakub Z\\'avodn\\'y, Lu\\'is Cruz-Filipe, Michael Codish, Peter Schneider-Kamp","submitted_at":"2014-12-17T09:36:06Z","abstract_excerpt":"We solve a 40-year-old open problem on the depth optimality of sorting networks. In 1973, Donald E. Knuth detailed, in Volume 3 of \"The Art of Computer Programming\", sorting networks of the smallest depth known at the time for n =< 16 inputs, quoting optimality for n =< 8. In 1989, Parberry proved the optimality of the networks with 9 =< n =< 10 inputs. In this article, we present a general technique for obtaining such optimality results, and use it to prove the optimality of the remaining open cases of 11 =< n =< 16 inputs. We show how to exploit symmetry to construct a small set of two-layer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5302","kind":"arxiv","version":1},"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":"1412.5302","created_at":"2026-05-18T00:56:26.244866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5302v1","created_at":"2026-05-18T00:56:26.244866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5302","created_at":"2026-05-18T00:56:26.244866+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVDO7P3SYAQL","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVDO7P3SYAQLPRDK","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVDO7P3S","created_at":"2026-05-18T12:28:59.999130+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/ZVDO7P3SYAQLPRDKDWKOMJ7DWM","json":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM.json","graph_json":"https://pith.science/api/pith-number/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/graph.json","events_json":"https://pith.science/api/pith-number/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/events.json","paper":"https://pith.science/paper/ZVDO7P3S"},"agent_actions":{"view_html":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM","download_json":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM.json","view_paper":"https://pith.science/paper/ZVDO7P3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5302&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/action/storage_attestation","attest_author":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/action/author_attestation","sign_citation":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/action/citation_signature","submit_replication":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/action/replication_record"}},"created_at":"2026-05-18T00:56:26.244866+00:00","updated_at":"2026-05-18T00:56:26.244866+00:00"}