{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FF72JKAA2HD4HVUGWKQVMRWNGN","short_pith_number":"pith:FF72JKAA","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"},"canonical_sha256":"297fa4a800d1c7c3d686b2a15646cd33762d866fbc0c3dd2eee6e397b249a3b0","source":{"kind":"arxiv","id":"1407.6183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6183","created_at":"2026-05-18T02:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6183v1","created_at":"2026-05-18T02:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6183","created_at":"2026-05-18T02:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"FF72JKAA2HD4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FF72JKAA2HD4HVUG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FF72JKAA","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FF72JKAA2HD4HVUGWKQVMRWNGN","target":"record","payload":{"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"},"canonical_sha256":"297fa4a800d1c7c3d686b2a15646cd33762d866fbc0c3dd2eee6e397b249a3b0","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"},"source_kind":"arxiv","source_id":"1407.6183","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f6pjE14yaFhXpKCA9SjjSItd+VCWSsOirAB+MWjZ3LUttQ8GxRHLzbGrNvSaUOT6b1ArBdwGVGT70co82OeoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:27:38.034625Z"},"content_sha256":"dd5020f17c4b350a8592f4ffe830858106c01104f6687c09278f101bacbb1707","schema_version":"1.0","event_id":"sha256:dd5020f17c4b350a8592f4ffe830858106c01104f6687c09278f101bacbb1707"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FF72JKAA2HD4HVUGWKQVMRWNGN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G43MP33EgIesOEOBm6ip7Jv8VEY7bbgfUhcYVYzigkXlg+yGlhCNZa/s3Y2XZhbqKmlCYxNTRSgSTr1++yp5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:27:38.034968Z"},"content_sha256":"0c167166839db142667a40d96a1acff7b4b0389580350d653bc1b8e701ee72d7","schema_version":"1.0","event_id":"sha256:0c167166839db142667a40d96a1acff7b4b0389580350d653bc1b8e701ee72d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/bundle.json","state_url":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T22:27:38Z","links":{"resolver":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN","bundle":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/bundle.json","state":"https://pith.science/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FF72JKAA2HD4HVUGWKQVMRWNGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FF72JKAA2HD4HVUGWKQVMRWNGN","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":"106d32a4d892ec4e3abf48a54dcb57121f059ed3fa5d0b668c9e4f8a5d03129c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-23T11:58:11Z","title_canon_sha256":"f019cedd561495a9cfea08083cb6b235e9e81c28c75a941ec2cb90d7030a1624"},"schema_version":"1.0","source":{"id":"1407.6183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.6183","created_at":"2026-05-18T02:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1407.6183v1","created_at":"2026-05-18T02:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.6183","created_at":"2026-05-18T02:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"FF72JKAA2HD4","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FF72JKAA2HD4HVUG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FF72JKAA","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:0c167166839db142667a40d96a1acff7b4b0389580350d653bc1b8e701ee72d7","target":"graph","created_at":"2026-05-18T02:46:58Z","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":"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","authors_text":"Domenico Cantone, Marcello La Rocca","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-23T11:58:11Z","title":"NeatSort - A practical adaptive algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6183","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:dd5020f17c4b350a8592f4ffe830858106c01104f6687c09278f101bacbb1707","target":"record","created_at":"2026-05-18T02:46:58Z","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":"106d32a4d892ec4e3abf48a54dcb57121f059ed3fa5d0b668c9e4f8a5d03129c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-23T11:58:11Z","title_canon_sha256":"f019cedd561495a9cfea08083cb6b235e9e81c28c75a941ec2cb90d7030a1624"},"schema_version":"1.0","source":{"id":"1407.6183","kind":"arxiv","version":1}},"canonical_sha256":"297fa4a800d1c7c3d686b2a15646cd33762d866fbc0c3dd2eee6e397b249a3b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"297fa4a800d1c7c3d686b2a15646cd33762d866fbc0c3dd2eee6e397b249a3b0","first_computed_at":"2026-05-18T02:46:58.741725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:58.741725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c0BspTQBB7Dp1AgHQWxo9rnJ67U+1TGznfMiHF6zGtoHUx3zK1boahTeTB73PBxjnoQFqPteDmuchYNgKCanCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:58.742302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.6183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd5020f17c4b350a8592f4ffe830858106c01104f6687c09278f101bacbb1707","sha256:0c167166839db142667a40d96a1acff7b4b0389580350d653bc1b8e701ee72d7"],"state_sha256":"df3b7e3d2de6c26f43c880b2dc3b8b94779ee3eb82686c0e6db67dadcdcfc323"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Aut31VGzXdVdlHtcu5rgMESF5BiMeN+qfPROptig6BdItkwdfEVypC1xyIrVq9qinl6agvwn4oe4dGmO5u2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:27:38.036902Z","bundle_sha256":"57d48f033c6a65eb8b3cf98ee2723c3ad5d72d61c83e9e90e64d7222ff26762e"}}