{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TEM7QALSCW4STYCP4SODRAZV6Y","short_pith_number":"pith:TEM7QALS","schema_version":"1.0","canonical_sha256":"9919f8017215b929e04fe49c388335f6061bf46870c6e56be006511f8f5c6a20","source":{"kind":"arxiv","id":"1502.04748","version":2},"attestation_state":"computed","paper":{"title":"The Takeoff Towards Optimal Sorting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Gregg, Martin Marinov","submitted_at":"2015-02-16T23:13:32Z","abstract_excerpt":"A complete set of filters $F_n$ for the optimal-depth $n$-input sorting network problem is such that if there exists an $n$-input sorting network of depth $d$ then there exists one of the form $C \\oplus C'$ for some $C \\in F_n$. Previous work on the topic presents a method for finding complete set of filters $R_{n, 1}$ and $R_{n, 2}$ that consists only of networks of depths one and two respectively, whose outputs are minimal and representative up to permutation and reflection. Our main contribution is a practical approach for finding a complete set of filters $R_{n, 3}$ containing only network"},"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":"1502.04748","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-16T23:13:32Z","cross_cats_sorted":[],"title_canon_sha256":"0e647861d35fb321f5a457f41ea8f711e1f2b815ed8f6cac6db8b581212106f5","abstract_canon_sha256":"cc15be848a82c6636b3c9e5fb76e74fcefb6591b5c9b7a69e8dfcf9b7676bb37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:28.202232Z","signature_b64":"r3WgvC12fwwyrn9iQnGYjYS5ZdoAl2j2GhsZunnslPc+3AaxGDmxmBRB24zCXBu0EeBA8q5cwAn2GfdANNb5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9919f8017215b929e04fe49c388335f6061bf46870c6e56be006511f8f5c6a20","last_reissued_at":"2026-05-18T02:24:28.201677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:28.201677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Takeoff Towards Optimal Sorting Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Gregg, Martin Marinov","submitted_at":"2015-02-16T23:13:32Z","abstract_excerpt":"A complete set of filters $F_n$ for the optimal-depth $n$-input sorting network problem is such that if there exists an $n$-input sorting network of depth $d$ then there exists one of the form $C \\oplus C'$ for some $C \\in F_n$. Previous work on the topic presents a method for finding complete set of filters $R_{n, 1}$ and $R_{n, 2}$ that consists only of networks of depths one and two respectively, whose outputs are minimal and representative up to permutation and reflection. Our main contribution is a practical approach for finding a complete set of filters $R_{n, 3}$ containing only network"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04748","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":"1502.04748","created_at":"2026-05-18T02:24:28.201759+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.04748v2","created_at":"2026-05-18T02:24:28.201759+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04748","created_at":"2026-05-18T02:24:28.201759+00:00"},{"alias_kind":"pith_short_12","alias_value":"TEM7QALSCW4S","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TEM7QALSCW4STYCP","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TEM7QALS","created_at":"2026-05-18T12:29:42.218222+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/TEM7QALSCW4STYCP4SODRAZV6Y","json":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y.json","graph_json":"https://pith.science/api/pith-number/TEM7QALSCW4STYCP4SODRAZV6Y/graph.json","events_json":"https://pith.science/api/pith-number/TEM7QALSCW4STYCP4SODRAZV6Y/events.json","paper":"https://pith.science/paper/TEM7QALS"},"agent_actions":{"view_html":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y","download_json":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y.json","view_paper":"https://pith.science/paper/TEM7QALS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.04748&json=true","fetch_graph":"https://pith.science/api/pith-number/TEM7QALSCW4STYCP4SODRAZV6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/TEM7QALSCW4STYCP4SODRAZV6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y/action/storage_attestation","attest_author":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y/action/author_attestation","sign_citation":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y/action/citation_signature","submit_replication":"https://pith.science/pith/TEM7QALSCW4STYCP4SODRAZV6Y/action/replication_record"}},"created_at":"2026-05-18T02:24:28.201759+00:00","updated_at":"2026-05-18T02:24:28.201759+00:00"}