{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YW76WBJFJBPPDUMIHPGIODIDH2","short_pith_number":"pith:YW76WBJF","schema_version":"1.0","canonical_sha256":"c5bfeb0525485ef1d1883bcc870d033eb588e5bb37afa3ace2c98ff48b64f25a","source":{"kind":"arxiv","id":"1404.0948","version":2},"attestation_state":"computed","paper":{"title":"The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Luis Cruz-Filipe, Michael Codish, Peter Schneider-Kamp","submitted_at":"2014-04-03T15:02:11Z","abstract_excerpt":"Previous work identifying depth-optimal $n$-channel sorting networks for $9\\leq n \\leq 16$ is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper revisits the problem of generating two-layer prefixes modulo symmetries. An improved notion of symmetry is provided and a novel technique based on regular languages and graph isomorphism is shown to generate the set of non-symmetric representations. An empirical evaluation demonstrates that the new method outperforms the generate-and-test approach by orders"},"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":"1404.0948","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-03T15:02:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"7a085ee97e0ed342d6d53fdae7a2c2c26d0c46c17d4e988a59f2f5d78fc283e4","abstract_canon_sha256":"a2ed50f1180912515f03adc46ae3c96500c7f76b88d6f9856a3007d4ffecddaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:26.402332Z","signature_b64":"eIvFXRXeN37G0uzA1UL2BiW9uLrqUx3f8olpoqVvzPttZyuGHy2HZ9gkVe1JO2c6F0KR73UnXHx9eF5rnORdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5bfeb0525485ef1d1883bcc870d033eb588e5bb37afa3ace2c98ff48b64f25a","last_reissued_at":"2026-05-18T00:56:26.401700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:26.401700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Quest for Optimal Sorting Networks: Efficient Generation of Two-Layer Prefixes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Luis Cruz-Filipe, Michael Codish, Peter Schneider-Kamp","submitted_at":"2014-04-03T15:02:11Z","abstract_excerpt":"Previous work identifying depth-optimal $n$-channel sorting networks for $9\\leq n \\leq 16$ is based on exploiting symmetries of the first two layers. However, the naive generate-and-test approach typically applied does not scale. This paper revisits the problem of generating two-layer prefixes modulo symmetries. An improved notion of symmetry is provided and a novel technique based on regular languages and graph isomorphism is shown to generate the set of non-symmetric representations. An empirical evaluation demonstrates that the new method outperforms the generate-and-test approach by orders"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0948","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":"1404.0948","created_at":"2026-05-18T00:56:26.401789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.0948v2","created_at":"2026-05-18T00:56:26.401789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0948","created_at":"2026-05-18T00:56:26.401789+00:00"},{"alias_kind":"pith_short_12","alias_value":"YW76WBJFJBPP","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"YW76WBJFJBPPDUMI","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"YW76WBJF","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/YW76WBJFJBPPDUMIHPGIODIDH2","json":"https://pith.science/pith/YW76WBJFJBPPDUMIHPGIODIDH2.json","graph_json":"https://pith.science/api/pith-number/YW76WBJFJBPPDUMIHPGIODIDH2/graph.json","events_json":"https://pith.science/api/pith-number/YW76WBJFJBPPDUMIHPGIODIDH2/events.json","paper":"https://pith.science/paper/YW76WBJF"},"agent_actions":{"view_html":"https://pith.science/pith/YW76WBJFJBPPDUMIHPGIODIDH2","download_json":"https://pith.science/pith/YW76WBJFJBPPDUMIHPGIODIDH2.json","view_paper":"https://pith.science/paper/YW76WBJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.0948&json=true","fetch_graph":"https://pith.science/api/pith-number/YW76WBJFJBPPDUMIHPGIODIDH2/graph.json","fetch_events":"https://pith.science/api/pith-number/YW76WBJFJBPPDUMIHPGIODIDH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YW76WBJFJBPPDUMIHPGIODIDH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YW76WBJFJBPPDUMIHPGIODIDH2/action/storage_attestation","attest_author":"https://pith.science/pith/YW76WBJFJBPPDUMIHPGIODIDH2/action/author_attestation","sign_citation":"https://pith.science/pith/YW76WBJFJBPPDUMIHPGIODIDH2/action/citation_signature","submit_replication":"https://pith.science/pith/YW76WBJFJBPPDUMIHPGIODIDH2/action/replication_record"}},"created_at":"2026-05-18T00:56:26.401789+00:00","updated_at":"2026-05-18T00:56:26.401789+00:00"}