{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QW2UOUQKTSZ37PF2OY6Y6IVEVX","short_pith_number":"pith:QW2UOUQK","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"},"canonical_sha256":"85b547520a9cb3bfbcba763d8f22a4adc9ff830937ca20b6ee7365eb7eb79489","source":{"kind":"arxiv","id":"1310.6271","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6271","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6271v2","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6271","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"QW2UOUQKTSZ3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QW2UOUQKTSZ37PF2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QW2UOUQK","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QW2UOUQKTSZ37PF2OY6Y6IVEVX","target":"record","payload":{"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"},"canonical_sha256":"85b547520a9cb3bfbcba763d8f22a4adc9ff830937ca20b6ee7365eb7eb79489","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"},"source_kind":"arxiv","source_id":"1310.6271","source_version":2,"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-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IODGRDBHyavCUmURaBUqunedA9H5jDopgL7TC/byCHq307CduW+HHb01hYOol7BsT7jFot31cBJ4sE013kViCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:27:45.116966Z"},"content_sha256":"2abf051f26cec289b09dfcadf12692424f64d155e79fe0ec804077de2cbfe332","schema_version":"1.0","event_id":"sha256:2abf051f26cec289b09dfcadf12692424f64d155e79fe0ec804077de2cbfe332"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QW2UOUQKTSZ37PF2OY6Y6IVEVX","target":"graph","payload":{"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"},"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-18T03:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3C1jieiSKJ2iarF3sZ7/r0LRR9sYTPfZdqnf51jrSWhN5NdjVnXHFm4MetbIcBWB3+TDjFpK15Ncfk4RS3kDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:27:45.117653Z"},"content_sha256":"70c0cf208139e50a0fddc711437a6f35aec6c2dfa7643f0e87b714cb073f21d7","schema_version":"1.0","event_id":"sha256:70c0cf208139e50a0fddc711437a6f35aec6c2dfa7643f0e87b714cb073f21d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/bundle.json","state_url":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/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-29T15:27:45Z","links":{"resolver":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX","bundle":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/bundle.json","state":"https://pith.science/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QW2UOUQKTSZ37PF2OY6Y6IVEVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QW2UOUQKTSZ37PF2OY6Y6IVEVX","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":"f7e456fa37b981b7590719ad4176123f285524c8ddc0787080da92320770a298","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-23T16:09:19Z","title_canon_sha256":"f4480b4ad02eb417c3e1fb8356ad5bedfddf581d585f79e7406e3c9842b824e6"},"schema_version":"1.0","source":{"id":"1310.6271","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6271","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6271v2","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6271","created_at":"2026-05-18T03:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"QW2UOUQKTSZ3","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QW2UOUQKTSZ37PF2","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QW2UOUQK","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:70c0cf208139e50a0fddc711437a6f35aec6c2dfa7643f0e87b714cb073f21d7","target":"graph","created_at":"2026-05-18T03:04:06Z","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":"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","authors_text":"Daniel Bundala, Jakub Z\\'avodn\\'y","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-23T16:09:19Z","title":"Optimal Sorting Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6271","kind":"arxiv","version":2},"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:2abf051f26cec289b09dfcadf12692424f64d155e79fe0ec804077de2cbfe332","target":"record","created_at":"2026-05-18T03:04:06Z","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":"f7e456fa37b981b7590719ad4176123f285524c8ddc0787080da92320770a298","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-10-23T16:09:19Z","title_canon_sha256":"f4480b4ad02eb417c3e1fb8356ad5bedfddf581d585f79e7406e3c9842b824e6"},"schema_version":"1.0","source":{"id":"1310.6271","kind":"arxiv","version":2}},"canonical_sha256":"85b547520a9cb3bfbcba763d8f22a4adc9ff830937ca20b6ee7365eb7eb79489","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85b547520a9cb3bfbcba763d8f22a4adc9ff830937ca20b6ee7365eb7eb79489","first_computed_at":"2026-05-18T03:04:06.205148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:06.205148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WNt/WHlb8sIQ1T5e7WO6jv+LBaclNtXKPjoiYfMx9peilRXuJNGa+KCPpqIbxdIBxErJzGuW7HE5DmromuAwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:06.205775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6271","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2abf051f26cec289b09dfcadf12692424f64d155e79fe0ec804077de2cbfe332","sha256:70c0cf208139e50a0fddc711437a6f35aec6c2dfa7643f0e87b714cb073f21d7"],"state_sha256":"6e20c75174716ac5f56cfea8666fd10ec65f0e83138a074fc6188a148f35c3db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rAOVla2AOjTi+YnQq8I2cHH1qXroaq/zyV0Ktwi1/lUID+VwutGGKfq889NbrtZJQ+hksUzi4QRlmsESWRe+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:27:45.120988Z","bundle_sha256":"9a8e6f5748359cfcf327776d0a39210ee42923e68815ed79a76e82483085d6a2"}}