{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QFVSSMZCMX55TJEBPMZKWSMQNW","short_pith_number":"pith:QFVSSMZC","canonical_record":{"source":{"id":"2012.04400","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-12-08T12:37:10Z","cross_cats_sorted":[],"title_canon_sha256":"84454ea8617065672908a2e1369e910de09be50f9e3d015923d64e4adac0af77","abstract_canon_sha256":"968857aefa9a5cf72e35574965ce4c48a1113a0a9d2de53f95ea185e1f4aabeb"},"schema_version":"1.0"},"canonical_sha256":"816b29332265fbd9a4817b32ab49906da237dee10a1e179b8ffda602ceff5f9e","source":{"kind":"arxiv","id":"2012.04400","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.04400","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"2012.04400v3","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04400","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"QFVSSMZCMX55","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"pith_short_16","alias_value":"QFVSSMZCMX55TJEB","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"pith_short_8","alias_value":"QFVSSMZC","created_at":"2026-07-05T04:42:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QFVSSMZCMX55TJEBPMZKWSMQNW","target":"record","payload":{"canonical_record":{"source":{"id":"2012.04400","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-12-08T12:37:10Z","cross_cats_sorted":[],"title_canon_sha256":"84454ea8617065672908a2e1369e910de09be50f9e3d015923d64e4adac0af77","abstract_canon_sha256":"968857aefa9a5cf72e35574965ce4c48a1113a0a9d2de53f95ea185e1f4aabeb"},"schema_version":"1.0"},"canonical_sha256":"816b29332265fbd9a4817b32ab49906da237dee10a1e179b8ffda602ceff5f9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:42:53.499284Z","signature_b64":"tBK+z5xAZVeCPGiIrG3NUISteN5ilJzyDaTcdSofy/LK4TZWwpve6tvtBBY3kjP3Uwjr1UdTTxHUO1xnjMYJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"816b29332265fbd9a4817b32ab49906da237dee10a1e179b8ffda602ceff5f9e","last_reissued_at":"2026-07-05T04:42:53.498840Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:42:53.498840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.04400","source_version":3,"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-07-05T04:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90tgIKUosLpP5nRs52GQZ4lxqj7Y6A6mzHSOGtg9BoK8EOPU5lwWlTCBwaRI8GdeicCFXesyHF6X/vSCMw1gAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T05:09:53.587410Z"},"content_sha256":"ec5f05063019e160a5e82b6fdefc4086b2e95d4a87a88306e9b233a0b5b967fc","schema_version":"1.0","event_id":"sha256:ec5f05063019e160a5e82b6fdefc4086b2e95d4a87a88306e9b233a0b5b967fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QFVSSMZCMX55TJEBPMZKWSMQNW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jannis Harder","submitted_at":"2020-12-08T12:37:10Z","abstract_excerpt":"We show that 11-channel sorting networks have at least 35 comparators and that 12-channel sorting networks have at least 39 comparators. This positively settles the optimality of the corresponding sorting networks given in The Art of Computer Programming vol. 3 and closes the two smallest open instances of the Bose-Nelson sorting problem. We obtain these bounds by generalizing a result of Van Voorhis from sorting networks to a more general class of comparator networks. From this we derive a dynamic programming algorithm that computes the optimal size for a sorting network with a given number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04400","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.04400/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:42:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pP3oUBIJ9fTbCAa6nzzgFt2cIsI8P1GV0uUCX8YhCAob9mdIeeTjEIRM0G1TA6bhKkFpcpwpmmd7Fd61AJ1NDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T05:09:53.587824Z"},"content_sha256":"757c3612539267937a949488d9bcdbca7fe4563d6e28d377c1cdafc94c9fdb28","schema_version":"1.0","event_id":"sha256:757c3612539267937a949488d9bcdbca7fe4563d6e28d377c1cdafc94c9fdb28"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFVSSMZCMX55TJEBPMZKWSMQNW/bundle.json","state_url":"https://pith.science/pith/QFVSSMZCMX55TJEBPMZKWSMQNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFVSSMZCMX55TJEBPMZKWSMQNW/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-08-18T05:09:53Z","links":{"resolver":"https://pith.science/pith/QFVSSMZCMX55TJEBPMZKWSMQNW","bundle":"https://pith.science/pith/QFVSSMZCMX55TJEBPMZKWSMQNW/bundle.json","state":"https://pith.science/pith/QFVSSMZCMX55TJEBPMZKWSMQNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFVSSMZCMX55TJEBPMZKWSMQNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QFVSSMZCMX55TJEBPMZKWSMQNW","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":"968857aefa9a5cf72e35574965ce4c48a1113a0a9d2de53f95ea185e1f4aabeb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-12-08T12:37:10Z","title_canon_sha256":"84454ea8617065672908a2e1369e910de09be50f9e3d015923d64e4adac0af77"},"schema_version":"1.0","source":{"id":"2012.04400","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.04400","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"arxiv_version","alias_value":"2012.04400v3","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.04400","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"pith_short_12","alias_value":"QFVSSMZCMX55","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"pith_short_16","alias_value":"QFVSSMZCMX55TJEB","created_at":"2026-07-05T04:42:53Z"},{"alias_kind":"pith_short_8","alias_value":"QFVSSMZC","created_at":"2026-07-05T04:42:53Z"}],"graph_snapshots":[{"event_id":"sha256:757c3612539267937a949488d9bcdbca7fe4563d6e28d377c1cdafc94c9fdb28","target":"graph","created_at":"2026-07-05T04:42:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.04400/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that 11-channel sorting networks have at least 35 comparators and that 12-channel sorting networks have at least 39 comparators. This positively settles the optimality of the corresponding sorting networks given in The Art of Computer Programming vol. 3 and closes the two smallest open instances of the Bose-Nelson sorting problem. We obtain these bounds by generalizing a result of Van Voorhis from sorting networks to a more general class of comparator networks. From this we derive a dynamic programming algorithm that computes the optimal size for a sorting network with a given number o","authors_text":"Jannis Harder","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-12-08T12:37:10Z","title":"An Answer to the Bose-Nelson Sorting Problem for 11 and 12 Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.04400","kind":"arxiv","version":3},"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:ec5f05063019e160a5e82b6fdefc4086b2e95d4a87a88306e9b233a0b5b967fc","target":"record","created_at":"2026-07-05T04:42:53Z","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":"968857aefa9a5cf72e35574965ce4c48a1113a0a9d2de53f95ea185e1f4aabeb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-12-08T12:37:10Z","title_canon_sha256":"84454ea8617065672908a2e1369e910de09be50f9e3d015923d64e4adac0af77"},"schema_version":"1.0","source":{"id":"2012.04400","kind":"arxiv","version":3}},"canonical_sha256":"816b29332265fbd9a4817b32ab49906da237dee10a1e179b8ffda602ceff5f9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"816b29332265fbd9a4817b32ab49906da237dee10a1e179b8ffda602ceff5f9e","first_computed_at":"2026-07-05T04:42:53.498840Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:42:53.498840Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tBK+z5xAZVeCPGiIrG3NUISteN5ilJzyDaTcdSofy/LK4TZWwpve6tvtBBY3kjP3Uwjr1UdTTxHUO1xnjMYJBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:42:53.499284Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.04400","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec5f05063019e160a5e82b6fdefc4086b2e95d4a87a88306e9b233a0b5b967fc","sha256:757c3612539267937a949488d9bcdbca7fe4563d6e28d377c1cdafc94c9fdb28"],"state_sha256":"439d1134a6f20cb12d9159c29b7f8883372f04990ddf4802185115324919424c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7HgiWSPQDDq5PPKC42wvz5FnPYc6d5H8YcNA0LLr+egahCC6WXLJpN20QHCn9qjfhT1+3N0TVksssf/EVvUWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T05:09:53.591134Z","bundle_sha256":"3aac2fb754fc30dfc9891472fe03c7204f25c812aeedb25cba875dd7c210877e"}}