{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N67A6L3EIPAOZ45Z2M3V7WNUKH","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":"c701db3fc509db7f58ebcf2e9ef8af0470f00c5dd9ea93bc320e6f797cbf5bbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-13T16:36:44Z","title_canon_sha256":"1072c4911759fe337dd46cd6bdd28e8e34d1761b427433fe6c4c82aa9ae57c46"},"schema_version":"1.0","source":{"id":"1704.04205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04205","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04205v1","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04205","created_at":"2026-05-18T00:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"N67A6L3EIPAO","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N67A6L3EIPAOZ45Z","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N67A6L3E","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:4125fdfc744adb440ded9b1ddf4b200f5db13d4be6882b6487e20226c8f7aedf","target":"graph","created_at":"2026-05-18T00:46:22Z","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":"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 - ","authors_text":"Margarita Markina, Maxim Buzdalov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-13T16:36:44Z","title":"Hybridizing Non-dominated Sorting Algorithms: Divide-and-Conquer Meets Best Order Sort"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04205","kind":"arxiv","version":1},"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:8be899e6e32a6499d27e4262e03de58944c79e457d428a1ffc5e0dbddee5e3c6","target":"record","created_at":"2026-05-18T00:46:22Z","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":"c701db3fc509db7f58ebcf2e9ef8af0470f00c5dd9ea93bc320e6f797cbf5bbe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-13T16:36:44Z","title_canon_sha256":"1072c4911759fe337dd46cd6bdd28e8e34d1761b427433fe6c4c82aa9ae57c46"},"schema_version":"1.0","source":{"id":"1704.04205","kind":"arxiv","version":1}},"canonical_sha256":"6fbe0f2f6443c0ecf3b9d3375fd9b451ddd4e64ef610d963cb3413d1bdb79b92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fbe0f2f6443c0ecf3b9d3375fd9b451ddd4e64ef610d963cb3413d1bdb79b92","first_computed_at":"2026-05-18T00:46:22.837997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:22.837997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uG4+auxIhPDxVzGqYMbwF+6urVRACdrGubLFxP1eHsncdcgb7E541irf3dBW4oe1p8ROMtf2sdbow++GbUWEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:22.838529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8be899e6e32a6499d27e4262e03de58944c79e457d428a1ffc5e0dbddee5e3c6","sha256:4125fdfc744adb440ded9b1ddf4b200f5db13d4be6882b6487e20226c8f7aedf"],"state_sha256":"3afd4ee4c31eca1a4d9f35449dede3428fe0c5fa980d431ecf28ec51d224d959"}