{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FF72JKAA2HD4HVUGWKQVMRWNGN","short_pith_number":"pith:FF72JKAA","schema_version":"1.0","canonical_sha256":"297fa4a800d1c7c3d686b2a15646cd33762d866fbc0c3dd2eee6e397b249a3b0","source":{"kind":"arxiv","id":"1407.6183","version":1},"attestation_state":"computed","paper":{"title":"NeatSort - A practical adaptive algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Domenico Cantone, Marcello La Rocca","submitted_at":"2014-07-23T11:58:11Z","abstract_excerpt":"We present a new adaptive sorting algorithm which is optimal for most disorder metrics and, more important, has a simple and quick implementation. On input $X$, our algorithm has a theoretical $\\Omega (|X|)$ lower bound and a $\\mathcal{O}(|X|\\log|X|)$ upper bound, exhibiting amazing adaptive properties which makes it run closer to its lower bound as disorder (computed on different metrics) diminishes. From a practical point of view, \\textit{NeatSort} has proven itself competitive with (and often better than) \\textit{qsort} and any \\textit{Random Quicksort} implementation, even on random arrays"},"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":"1407.6183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-23T11:58:11Z","cross_cats_sorted":[],"title_canon_sha256":"f019cedd561495a9cfea08083cb6b235e9e81c28c75a941ec2cb90d7030a1624","abstract_canon_sha256":"106d32a4d892ec4e3abf48a54dcb57121f059ed3fa5d0b668c9e4f8a5d03129c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:58.742302Z","signature_b64":"c0BspTQBB7Dp1AgHQWxo9rnJ67U+1TGznfMiHF6zGtoHUx3zK1boahTeTB73PBxjnoQFqPteDmuchYNgKCanCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297fa4a800d1c7c3d686b2a15646cd33762d866fbc0c3dd2eee6e397b249a3b0","last_reissued_at":"2026-05-18T02:46:58.741725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:58.741725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NeatSort - A practical adaptive algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Domenico Cantone, Marcello La Rocca","submitted_at":"2014-07-23T11:58:11Z","abstract_excerpt":"We present a new adaptive sorting algorithm which is optimal for most disorder metrics and, more important, has a simple and quick implementation. On input $X$, our algorithm has a theoretical $\\Omega (|X|)$ lower bound and a $\\mathcal{O}(|X|\\log|X|)$ upper bound, exhibiting amazing adaptive properties which makes it run closer to its lower bound as disorder (computed on different metrics) diminishes. From a practical point of view, \\textit{NeatSort} has proven itself competitive with (and often better than) \\textit{qsort} and any \\textit{Random Quicksort} implementation, even on random arrays"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6183","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":"1407.6183","created_at":"2026-05-18T02:46:58.741803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.6183v1","created_at":"2026-05-18T02:46:58.741803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6183","created_at":"2026-05-18T02:46:58.741803+00:00"},{"alias_kind":"pith_short_12","alias_value":"FF72JKAA2HD4","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FF72JKAA2HD4HVUG","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FF72JKAA","created_at":"2026-05-18T12:28:28.263976+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/FF72JKAA2HD4HVUGWKQVMRWNGN","json":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN.json","graph_json":"https://pith.science/api/pith-number/FF72JKAA2HD4HVUGWKQVMRWNGN/graph.json","events_json":"https://pith.science/api/pith-number/FF72JKAA2HD4HVUGWKQVMRWNGN/events.json","paper":"https://pith.science/paper/FF72JKAA"},"agent_actions":{"view_html":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN","download_json":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN.json","view_paper":"https://pith.science/paper/FF72JKAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.6183&json=true","fetch_graph":"https://pith.science/api/pith-number/FF72JKAA2HD4HVUGWKQVMRWNGN/graph.json","fetch_events":"https://pith.science/api/pith-number/FF72JKAA2HD4HVUGWKQVMRWNGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/action/storage_attestation","attest_author":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/action/author_attestation","sign_citation":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/action/citation_signature","submit_replication":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/action/replication_record"}},"created_at":"2026-05-18T02:46:58.741803+00:00","updated_at":"2026-05-18T02:46:58.741803+00:00"}