{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:E5UF7Q4IQCUMQ4UCBFGE4GKWDI","short_pith_number":"pith:E5UF7Q4I","canonical_record":{"source":{"id":"1804.07575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-20T12:33:42Z","cross_cats_sorted":[],"title_canon_sha256":"2ba0edefb66e18b461471c6db008517b8ed68ce0adef45e7d01f96e12ef4054c","abstract_canon_sha256":"5bec961778f35974879f92145b1025e88fe3d3505460c50991010966c7b0b449"},"schema_version":"1.0"},"canonical_sha256":"27685fc38880a8c87282094c4e19561a3167db35037b07e9eef5203a92d1ba66","source":{"kind":"arxiv","id":"1804.07575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07575","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07575v1","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07575","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"E5UF7Q4IQCUM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5UF7Q4IQCUMQ4UC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5UF7Q4I","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:E5UF7Q4IQCUMQ4UCBFGE4GKWDI","target":"record","payload":{"canonical_record":{"source":{"id":"1804.07575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-20T12:33:42Z","cross_cats_sorted":[],"title_canon_sha256":"2ba0edefb66e18b461471c6db008517b8ed68ce0adef45e7d01f96e12ef4054c","abstract_canon_sha256":"5bec961778f35974879f92145b1025e88fe3d3505460c50991010966c7b0b449"},"schema_version":"1.0"},"canonical_sha256":"27685fc38880a8c87282094c4e19561a3167db35037b07e9eef5203a92d1ba66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:58.424363Z","signature_b64":"z6poePl9xfE5niSx844UBZWMIkPu1CTJTWbCV1ytOS4wxQxU0x6ze5lDZLRv65Qhec6XP8ILNtLNYiJvd/m6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27685fc38880a8c87282094c4e19561a3167db35037b07e9eef5203a92d1ba66","last_reissued_at":"2026-05-18T00:17:58.423835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:58.423835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.07575","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-18T00:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFsrGvUx6nHyg6UJS7QPj8j8PKotrK0lUy863GJkgBhky/f8stSb975sqU1Q8LAy3uaW0m9ctVz1cIgscRddBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:30:39.953629Z"},"content_sha256":"9f1d0e9467f59a10be2f27f00fd8e2b4b54c90a32bc6c5dad325ae09b4da9ce0","schema_version":"1.0","event_id":"sha256:9f1d0e9467f59a10be2f27f00fd8e2b4b54c90a32bc6c5dad325ae09b4da9ce0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:E5UF7Q4IQCUMQ4UCBFGE4GKWDI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Sorting with Persistent 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":"2018-04-20T12:33:42Z","abstract_excerpt":"We consider the problem of sorting $n$ elements in the case of \\emph{persistent} comparison errors. In this model (Braverman and Mossel, SODA'08), each comparison between two elements can be wrong with some fixed (small) probability $p$, and \\emph{comparisons cannot be repeated}. Sorting perfectly in this model is impossible, and the objective is to minimize the \\emph{dislocation} of each element in the output sequence, that is, the difference between its true rank and its position. Existing lower bounds for this problem show that no algorithm can guarantee, with high probability, \\emph{maximu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07575","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-18T00:17:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXOnmd6igbyvhascDYtpARk8E00L8f1BVQypcrH4Bfop8eTeCDjq01hkM3Ik0HYmZrX3lMCRFhbIcBPywXPlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:30:39.954275Z"},"content_sha256":"c5c0baff7c979c9e2c1a414f420d3d93a879c8c95f55be5381e820b1ed7fb6c5","schema_version":"1.0","event_id":"sha256:c5c0baff7c979c9e2c1a414f420d3d93a879c8c95f55be5381e820b1ed7fb6c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5UF7Q4IQCUMQ4UCBFGE4GKWDI/bundle.json","state_url":"https://pith.science/pith/E5UF7Q4IQCUMQ4UCBFGE4GKWDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5UF7Q4IQCUMQ4UCBFGE4GKWDI/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-05T02:30:39Z","links":{"resolver":"https://pith.science/pith/E5UF7Q4IQCUMQ4UCBFGE4GKWDI","bundle":"https://pith.science/pith/E5UF7Q4IQCUMQ4UCBFGE4GKWDI/bundle.json","state":"https://pith.science/pith/E5UF7Q4IQCUMQ4UCBFGE4GKWDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5UF7Q4IQCUMQ4UCBFGE4GKWDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:E5UF7Q4IQCUMQ4UCBFGE4GKWDI","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":"5bec961778f35974879f92145b1025e88fe3d3505460c50991010966c7b0b449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-20T12:33:42Z","title_canon_sha256":"2ba0edefb66e18b461471c6db008517b8ed68ce0adef45e7d01f96e12ef4054c"},"schema_version":"1.0","source":{"id":"1804.07575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07575","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07575v1","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07575","created_at":"2026-05-18T00:17:58Z"},{"alias_kind":"pith_short_12","alias_value":"E5UF7Q4IQCUM","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"E5UF7Q4IQCUMQ4UC","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"E5UF7Q4I","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:c5c0baff7c979c9e2c1a414f420d3d93a879c8c95f55be5381e820b1ed7fb6c5","target":"graph","created_at":"2026-05-18T00:17: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 consider the problem of sorting $n$ elements in the case of \\emph{persistent} comparison errors. In this model (Braverman and Mossel, SODA'08), each comparison between two elements can be wrong with some fixed (small) probability $p$, and \\emph{comparisons cannot be repeated}. Sorting perfectly in this model is impossible, and the objective is to minimize the \\emph{dislocation} of each element in the output sequence, that is, the difference between its true rank and its position. Existing lower bounds for this problem show that no algorithm can guarantee, with high probability, \\emph{maximu","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":"2018-04-20T12:33:42Z","title":"Optimal Sorting with Persistent Comparison Errors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07575","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:9f1d0e9467f59a10be2f27f00fd8e2b4b54c90a32bc6c5dad325ae09b4da9ce0","target":"record","created_at":"2026-05-18T00:17: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":"5bec961778f35974879f92145b1025e88fe3d3505460c50991010966c7b0b449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-20T12:33:42Z","title_canon_sha256":"2ba0edefb66e18b461471c6db008517b8ed68ce0adef45e7d01f96e12ef4054c"},"schema_version":"1.0","source":{"id":"1804.07575","kind":"arxiv","version":1}},"canonical_sha256":"27685fc38880a8c87282094c4e19561a3167db35037b07e9eef5203a92d1ba66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27685fc38880a8c87282094c4e19561a3167db35037b07e9eef5203a92d1ba66","first_computed_at":"2026-05-18T00:17:58.423835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:58.423835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z6poePl9xfE5niSx844UBZWMIkPu1CTJTWbCV1ytOS4wxQxU0x6ze5lDZLRv65Qhec6XP8ILNtLNYiJvd/m6Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:58.424363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f1d0e9467f59a10be2f27f00fd8e2b4b54c90a32bc6c5dad325ae09b4da9ce0","sha256:c5c0baff7c979c9e2c1a414f420d3d93a879c8c95f55be5381e820b1ed7fb6c5"],"state_sha256":"da053c19bafc6ea9cd1a246a262ba16c0bb84a03ac34c2d732f434a8e0332459"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FqSBbF6mT/ZX6KpDxBABoR0RDlaa+vA2zCDQRHEaR8AsbqcMVD4qH8VrwcoARlWl3Vh2lpH9zNBvr9zRJD/1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:30:39.957523Z","bundle_sha256":"e1ab3bf6970b2900f34bf7574221fbb5e33d71a015bd3c7045c0a9ae34f78db6"}}