{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RSP2RUXVFM46F5VXCN6YSNCG25","short_pith_number":"pith:RSP2RUXV","schema_version":"1.0","canonical_sha256":"8c9fa8d2f52b39e2f6b7137d893446d777f92080c58a25cb14778e9ea6e35eaa","source":{"kind":"arxiv","id":"2508.19785","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","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":"2025-08-27T11:06:36Z","abstract_excerpt":"We consider the problem of sorting $n$ elements subject to persistent random comparison errors. In this problem, each comparison between two elements can be wrong with some fixed (small) probability $p$, and comparing the same pair of elements multiple times always yields the same result. Sorting perfectly in this model is impossible, and the objective is to minimize the dislocation of each element in the output sequence, i.e., the difference between its position in the sequence and its true rank.\n  In this paper, we present the first $O(n\\log n)$-time sorting algorithm that guarantees both $O"},"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":"2508.19785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-08-27T11:06:36Z","cross_cats_sorted":[],"title_canon_sha256":"182591086b054f43fbceb18569cbbd64509e64ac9007f80ecb05b8744a6c290c","abstract_canon_sha256":"213a6a463d53fc93c28f2a5ad66f06628034bc70ef465e722fcc4f0fa96548a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:17.732925Z","signature_b64":"CaygI68vAPMxsqSZHJHoR9VNePQ2mW+Ard1HpYaAT+yrIku7Q/kG3tBQSb2QyNb5U3XCcV4trGUGCfYUd5DyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c9fa8d2f52b39e2f6b7137d893446d777f92080c58a25cb14778e9ea6e35eaa","last_reissued_at":"2026-07-05T12:00:17.732522Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:17.732522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","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":"2025-08-27T11:06:36Z","abstract_excerpt":"We consider the problem of sorting $n$ elements subject to persistent random comparison errors. In this problem, each comparison between two elements can be wrong with some fixed (small) probability $p$, and comparing the same pair of elements multiple times always yields the same result. Sorting perfectly in this model is impossible, and the objective is to minimize the dislocation of each element in the output sequence, i.e., the difference between its position in the sequence and its true rank.\n  In this paper, we present the first $O(n\\log n)$-time sorting algorithm that guarantees both $O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.19785","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.19785/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.19785","created_at":"2026-07-05T12:00:17.732577+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.19785v1","created_at":"2026-07-05T12:00:17.732577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.19785","created_at":"2026-07-05T12:00:17.732577+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSP2RUXVFM46","created_at":"2026-07-05T12:00:17.732577+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSP2RUXVFM46F5VX","created_at":"2026-07-05T12:00:17.732577+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSP2RUXV","created_at":"2026-07-05T12:00:17.732577+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/RSP2RUXVFM46F5VXCN6YSNCG25","json":"https://pith.science/pith/RSP2RUXVFM46F5VXCN6YSNCG25.json","graph_json":"https://pith.science/api/pith-number/RSP2RUXVFM46F5VXCN6YSNCG25/graph.json","events_json":"https://pith.science/api/pith-number/RSP2RUXVFM46F5VXCN6YSNCG25/events.json","paper":"https://pith.science/paper/RSP2RUXV"},"agent_actions":{"view_html":"https://pith.science/pith/RSP2RUXVFM46F5VXCN6YSNCG25","download_json":"https://pith.science/pith/RSP2RUXVFM46F5VXCN6YSNCG25.json","view_paper":"https://pith.science/paper/RSP2RUXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.19785&json=true","fetch_graph":"https://pith.science/api/pith-number/RSP2RUXVFM46F5VXCN6YSNCG25/graph.json","fetch_events":"https://pith.science/api/pith-number/RSP2RUXVFM46F5VXCN6YSNCG25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSP2RUXVFM46F5VXCN6YSNCG25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSP2RUXVFM46F5VXCN6YSNCG25/action/storage_attestation","attest_author":"https://pith.science/pith/RSP2RUXVFM46F5VXCN6YSNCG25/action/author_attestation","sign_citation":"https://pith.science/pith/RSP2RUXVFM46F5VXCN6YSNCG25/action/citation_signature","submit_replication":"https://pith.science/pith/RSP2RUXVFM46F5VXCN6YSNCG25/action/replication_record"}},"created_at":"2026-07-05T12:00:17.732577+00:00","updated_at":"2026-07-05T12:00:17.732577+00:00"}