{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZVDO7P3SYAQLPRDKDWKOMJ7DWM","short_pith_number":"pith:ZVDO7P3S","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"},"canonical_sha256":"cd46efbf72c020b7c46a1d94e627e3b32f43144ec88405f8439ec44338fc209f","source":{"kind":"arxiv","id":"1412.5302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5302","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5302v1","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5302","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZVDO7P3SYAQL","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZVDO7P3SYAQLPRDK","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZVDO7P3S","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZVDO7P3SYAQLPRDKDWKOMJ7DWM","target":"record","payload":{"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"},"canonical_sha256":"cd46efbf72c020b7c46a1d94e627e3b32f43144ec88405f8439ec44338fc209f","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"},"source_kind":"arxiv","source_id":"1412.5302","source_version":1,"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:56:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMpzg0qBNAaNNaAQ+LJJkvSHHtngBhTuo0AU+UFZRQfNurGhLWPrIQ5PcIIk8wILf32sBCck/BGUP7i7itxgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:54:58.723553Z"},"content_sha256":"f7019d8b5b61c99c899eef071ac5ee194b3808fe33cc1e4cf17f9971c18dc521","schema_version":"1.0","event_id":"sha256:f7019d8b5b61c99c899eef071ac5ee194b3808fe33cc1e4cf17f9971c18dc521"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZVDO7P3SYAQLPRDKDWKOMJ7DWM","target":"graph","payload":{"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"},"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:56:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBaj51bbBSJFHaZ9F09Wf1hbbf5TP4mYxaliOytQvwl5q25Yi/4tYOXCnMOz1Y2HIjSQoSDIAxMgubLZGIPxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:54:58.724180Z"},"content_sha256":"f36083ec4e19ff5febc39892182a4730b8e6518a70f2615bb04cc785da27f89d","schema_version":"1.0","event_id":"sha256:f36083ec4e19ff5febc39892182a4730b8e6518a70f2615bb04cc785da27f89d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/bundle.json","state_url":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/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-05-28T22:54:58Z","links":{"resolver":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM","bundle":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/bundle.json","state":"https://pith.science/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVDO7P3SYAQLPRDKDWKOMJ7DWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZVDO7P3SYAQLPRDKDWKOMJ7DWM","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":"39823af91ed23fcb93d9f00aae4c96c1277fbe5d17dfff9ceca097291879a2f0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-17T09:36:06Z","title_canon_sha256":"1afc5a6a920a19c9ebb40d676a1090abbedb02e4999a78a6b4bcee05044ab11b"},"schema_version":"1.0","source":{"id":"1412.5302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5302","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5302v1","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5302","created_at":"2026-05-18T00:56:26Z"},{"alias_kind":"pith_short_12","alias_value":"ZVDO7P3SYAQL","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZVDO7P3SYAQLPRDK","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZVDO7P3S","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:f36083ec4e19ff5febc39892182a4730b8e6518a70f2615bb04cc785da27f89d","target":"graph","created_at":"2026-05-18T00:56:26Z","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 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","authors_text":"Daniel Bundala, Jakub Z\\'avodn\\'y, Lu\\'is Cruz-Filipe, Michael Codish, Peter Schneider-Kamp","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-17T09:36:06Z","title":"Optimal-Depth Sorting Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5302","kind":"arxiv","version":1},"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:f7019d8b5b61c99c899eef071ac5ee194b3808fe33cc1e4cf17f9971c18dc521","target":"record","created_at":"2026-05-18T00:56:26Z","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":"39823af91ed23fcb93d9f00aae4c96c1277fbe5d17dfff9ceca097291879a2f0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-17T09:36:06Z","title_canon_sha256":"1afc5a6a920a19c9ebb40d676a1090abbedb02e4999a78a6b4bcee05044ab11b"},"schema_version":"1.0","source":{"id":"1412.5302","kind":"arxiv","version":1}},"canonical_sha256":"cd46efbf72c020b7c46a1d94e627e3b32f43144ec88405f8439ec44338fc209f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd46efbf72c020b7c46a1d94e627e3b32f43144ec88405f8439ec44338fc209f","first_computed_at":"2026-05-18T00:56:26.244783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:26.244783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ohBk8HJrNPz8gTKVNYEuxC9UEz9y+X0MNMnex6Dn7pSYZ8hgZNCDXzpJS5OvlqQ29wMgjd1ztJ58V/uaWblAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:26.245385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7019d8b5b61c99c899eef071ac5ee194b3808fe33cc1e4cf17f9971c18dc521","sha256:f36083ec4e19ff5febc39892182a4730b8e6518a70f2615bb04cc785da27f89d"],"state_sha256":"8b64841ab99bffd4dd9f12edcfe89bae0e49570faa093d18895989614476cb62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jOTbjigziS3+JSGGde/8Dx74KchxG2tLVzUAqOhTzHguyvNpVkmFapUhGafZZoHOpyHyK7Gzi8R1CMS1BhCiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:54:58.727562Z","bundle_sha256":"bb64f465617236b0d11c5aa348ac76381879cfaaf0afc6f9ee69316f1293676c"}}