{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OGTOIQ2SPTPA3L5QHK6NG7GGNF","short_pith_number":"pith:OGTOIQ2S","schema_version":"1.0","canonical_sha256":"71a6e443527cde0dafb03abcd37cc6696b2a16d12ec7f35b6e3f5d30b0c408bb","source":{"kind":"arxiv","id":"1709.07249","version":1},"attestation_state":"computed","paper":{"title":"Sorting with Recurrent Comparison Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barbara Geissmann, Chih-Hung Liu, Paolo Penna, Stefano Leucci","submitted_at":"2017-09-21T10:38:28Z","abstract_excerpt":"We present a sorting algorithm for the case of recurrent random comparison errors. The algorithm essentially achieves simultaneously good properties of previous algorithms for sorting $n$ distinct elements in this model. In particular, it runs in $O(n^2)$ time, the maximum dislocation of the elements in the output is $O(\\log n)$, while the total dislocation is $O(n)$. These guarantees are the best possible since we prove that even randomized algorithms cannot achieve $o(\\log n)$ maximum dislocation with high probability, or $o(n)$ total dislocation in expectation, regardless of their running t"},"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":"1709.07249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-21T10:38:28Z","cross_cats_sorted":[],"title_canon_sha256":"61d27bb4dc81ceb2bfacb75284e875747072ac372e715e524bb32b00df56b024","abstract_canon_sha256":"5ecd63caf9ff35cc61e276d107e5d0da2f7655e3f9170fbbe933efacefc1660c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:36.211489Z","signature_b64":"68e4oRNwsAkJh7cMWrfKJadb+CLmmCucf6csxCgUNCkQM/QxVB/lB6b0suxScx+hPjaT+Y+I8bZWB948E3nqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71a6e443527cde0dafb03abcd37cc6696b2a16d12ec7f35b6e3f5d30b0c408bb","last_reissued_at":"2026-05-18T00:34:36.211030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:36.211030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorting with Recurrent Comparison Errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barbara Geissmann, Chih-Hung Liu, Paolo Penna, Stefano Leucci","submitted_at":"2017-09-21T10:38:28Z","abstract_excerpt":"We present a sorting algorithm for the case of recurrent random comparison errors. The algorithm essentially achieves simultaneously good properties of previous algorithms for sorting $n$ distinct elements in this model. In particular, it runs in $O(n^2)$ time, the maximum dislocation of the elements in the output is $O(\\log n)$, while the total dislocation is $O(n)$. These guarantees are the best possible since we prove that even randomized algorithms cannot achieve $o(\\log n)$ maximum dislocation with high probability, or $o(n)$ total dislocation in expectation, regardless of their running t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07249","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":"1709.07249","created_at":"2026-05-18T00:34:36.211098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.07249v1","created_at":"2026-05-18T00:34:36.211098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07249","created_at":"2026-05-18T00:34:36.211098+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGTOIQ2SPTPA","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGTOIQ2SPTPA3L5Q","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGTOIQ2S","created_at":"2026-05-18T12:31:34.259226+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/OGTOIQ2SPTPA3L5QHK6NG7GGNF","json":"https://pith.science/pith/OGTOIQ2SPTPA3L5QHK6NG7GGNF.json","graph_json":"https://pith.science/api/pith-number/OGTOIQ2SPTPA3L5QHK6NG7GGNF/graph.json","events_json":"https://pith.science/api/pith-number/OGTOIQ2SPTPA3L5QHK6NG7GGNF/events.json","paper":"https://pith.science/paper/OGTOIQ2S"},"agent_actions":{"view_html":"https://pith.science/pith/OGTOIQ2SPTPA3L5QHK6NG7GGNF","download_json":"https://pith.science/pith/OGTOIQ2SPTPA3L5QHK6NG7GGNF.json","view_paper":"https://pith.science/paper/OGTOIQ2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.07249&json=true","fetch_graph":"https://pith.science/api/pith-number/OGTOIQ2SPTPA3L5QHK6NG7GGNF/graph.json","fetch_events":"https://pith.science/api/pith-number/OGTOIQ2SPTPA3L5QHK6NG7GGNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGTOIQ2SPTPA3L5QHK6NG7GGNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGTOIQ2SPTPA3L5QHK6NG7GGNF/action/storage_attestation","attest_author":"https://pith.science/pith/OGTOIQ2SPTPA3L5QHK6NG7GGNF/action/author_attestation","sign_citation":"https://pith.science/pith/OGTOIQ2SPTPA3L5QHK6NG7GGNF/action/citation_signature","submit_replication":"https://pith.science/pith/OGTOIQ2SPTPA3L5QHK6NG7GGNF/action/replication_record"}},"created_at":"2026-05-18T00:34:36.211098+00:00","updated_at":"2026-05-18T00:34:36.211098+00:00"}