{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N67A6L3EIPAOZ45Z2M3V7WNUKH","short_pith_number":"pith:N67A6L3E","schema_version":"1.0","canonical_sha256":"6fbe0f2f6443c0ecf3b9d3375fd9b451ddd4e64ef610d963cb3413d1bdb79b92","source":{"kind":"arxiv","id":"1704.04205","version":1},"attestation_state":"computed","paper":{"title":"Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Margarita Markina, Maxim Buzdalov","submitted_at":"2017-04-13T16:36:44Z","abstract_excerpt":"Many production-grade algorithms benefit from combining an asymptotically efficient algorithm for solving big problem instances, by splitting them into smaller ones, and an asymptotically inefficient algorithm with a very small implementation constant for solving small subproblems. A well-known example is stable sorting, where mergesort is often combined with insertion sort to achieve a constant but noticeable speed-up.\n  We apply this idea to non-dominated sorting. Namely, we combine the divide-and-conquer algorithm, which has the currently best known asymptotic runtime of $O(N (\\log N)^{M - "},"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":"1704.04205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-13T16:36:44Z","cross_cats_sorted":[],"title_canon_sha256":"1072c4911759fe337dd46cd6bdd28e8e34d1761b427433fe6c4c82aa9ae57c46","abstract_canon_sha256":"c701db3fc509db7f58ebcf2e9ef8af0470f00c5dd9ea93bc320e6f797cbf5bbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:22.838529Z","signature_b64":"uG4+auxIhPDxVzGqYMbwF+6urVRACdrGubLFxP1eHsncdcgb7E541irf3dBW4oe1p8ROMtf2sdbow++GbUWEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fbe0f2f6443c0ecf3b9d3375fd9b451ddd4e64ef610d963cb3413d1bdb79b92","last_reissued_at":"2026-05-18T00:46:22.837997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:22.837997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Margarita Markina, Maxim Buzdalov","submitted_at":"2017-04-13T16:36:44Z","abstract_excerpt":"Many production-grade algorithms benefit from combining an asymptotically efficient algorithm for solving big problem instances, by splitting them into smaller ones, and an asymptotically inefficient algorithm with a very small implementation constant for solving small subproblems. A well-known example is stable sorting, where mergesort is often combined with insertion sort to achieve a constant but noticeable speed-up.\n  We apply this idea to non-dominated sorting. Namely, we combine the divide-and-conquer algorithm, which has the currently best known asymptotic runtime of $O(N (\\log N)^{M - "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04205","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.04205","created_at":"2026-05-18T00:46:22.838074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04205v1","created_at":"2026-05-18T00:46:22.838074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04205","created_at":"2026-05-18T00:46:22.838074+00:00"},{"alias_kind":"pith_short_12","alias_value":"N67A6L3EIPAO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N67A6L3EIPAOZ45Z","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N67A6L3E","created_at":"2026-05-18T12:31:31.346846+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/N67A6L3EIPAOZ45Z2M3V7WNUKH","json":"https://pith.science/pith/N67A6L3EIPAOZ45Z2M3V7WNUKH.json","graph_json":"https://pith.science/api/pith-number/N67A6L3EIPAOZ45Z2M3V7WNUKH/graph.json","events_json":"https://pith.science/api/pith-number/N67A6L3EIPAOZ45Z2M3V7WNUKH/events.json","paper":"https://pith.science/paper/N67A6L3E"},"agent_actions":{"view_html":"https://pith.science/pith/N67A6L3EIPAOZ45Z2M3V7WNUKH","download_json":"https://pith.science/pith/N67A6L3EIPAOZ45Z2M3V7WNUKH.json","view_paper":"https://pith.science/paper/N67A6L3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04205&json=true","fetch_graph":"https://pith.science/api/pith-number/N67A6L3EIPAOZ45Z2M3V7WNUKH/graph.json","fetch_events":"https://pith.science/api/pith-number/N67A6L3EIPAOZ45Z2M3V7WNUKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N67A6L3EIPAOZ45Z2M3V7WNUKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N67A6L3EIPAOZ45Z2M3V7WNUKH/action/storage_attestation","attest_author":"https://pith.science/pith/N67A6L3EIPAOZ45Z2M3V7WNUKH/action/author_attestation","sign_citation":"https://pith.science/pith/N67A6L3EIPAOZ45Z2M3V7WNUKH/action/citation_signature","submit_replication":"https://pith.science/pith/N67A6L3EIPAOZ45Z2M3V7WNUKH/action/replication_record"}},"created_at":"2026-05-18T00:46:22.838074+00:00","updated_at":"2026-05-18T00:46:22.838074+00:00"}