{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OGTOIQ2SPTPA3L5QHK6NG7GGNF","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":"5ecd63caf9ff35cc61e276d107e5d0da2f7655e3f9170fbbe933efacefc1660c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-21T10:38:28Z","title_canon_sha256":"61d27bb4dc81ceb2bfacb75284e875747072ac372e715e524bb32b00df56b024"},"schema_version":"1.0","source":{"id":"1709.07249","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07249","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07249v1","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07249","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"OGTOIQ2SPTPA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OGTOIQ2SPTPA3L5Q","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OGTOIQ2S","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:8b7829f9e4e478247ced4c300e88398fdc0f77d87b4a4f3d3c80b9e1c850cc56","target":"graph","created_at":"2026-05-18T00:34:36Z","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 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","authors_text":"Barbara Geissmann, Chih-Hung Liu, Paolo Penna, Stefano Leucci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-21T10:38:28Z","title":"Sorting with Recurrent Comparison Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07249","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:adb3fdd51f59af45f58407d15b2c42ceb9cb76d94415d5c305de918cfb059f68","target":"record","created_at":"2026-05-18T00:34:36Z","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":"5ecd63caf9ff35cc61e276d107e5d0da2f7655e3f9170fbbe933efacefc1660c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-21T10:38:28Z","title_canon_sha256":"61d27bb4dc81ceb2bfacb75284e875747072ac372e715e524bb32b00df56b024"},"schema_version":"1.0","source":{"id":"1709.07249","kind":"arxiv","version":1}},"canonical_sha256":"71a6e443527cde0dafb03abcd37cc6696b2a16d12ec7f35b6e3f5d30b0c408bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71a6e443527cde0dafb03abcd37cc6696b2a16d12ec7f35b6e3f5d30b0c408bb","first_computed_at":"2026-05-18T00:34:36.211030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:36.211030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"68e4oRNwsAkJh7cMWrfKJadb+CLmmCucf6csxCgUNCkQM/QxVB/lB6b0suxScx+hPjaT+Y+I8bZWB948E3nqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:36.211489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07249","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adb3fdd51f59af45f58407d15b2c42ceb9cb76d94415d5c305de918cfb059f68","sha256:8b7829f9e4e478247ced4c300e88398fdc0f77d87b4a4f3d3c80b9e1c850cc56"],"state_sha256":"f7b7d616ec60a050fc52a1dc8b108b5d26e1777321503de521eb734620db873e"}