{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VMWQ5BOE372SXATDZ43LEOLA2Y","short_pith_number":"pith:VMWQ5BOE","canonical_record":{"source":{"id":"1803.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-12T20:14:19Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"66d0c1ac536d070cd7017397bab77c70c34dcd5956be20b6580ea6592948f21a","abstract_canon_sha256":"3c694ac2a14298e1da140e409257d873ef3e292bad17fb6d299272fea5e8458e"},"schema_version":"1.0"},"canonical_sha256":"ab2d0e85c4dff52b8263cf36b23960d62dd273f62ff7bf8baaca2e9a2c9ac8fa","source":{"kind":"arxiv","id":"1803.04509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04509","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04509v1","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04509","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"VMWQ5BOE372S","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VMWQ5BOE372SXATD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VMWQ5BOE","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VMWQ5BOE372SXATDZ43LEOLA2Y","target":"record","payload":{"canonical_record":{"source":{"id":"1803.04509","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-12T20:14:19Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"66d0c1ac536d070cd7017397bab77c70c34dcd5956be20b6580ea6592948f21a","abstract_canon_sha256":"3c694ac2a14298e1da140e409257d873ef3e292bad17fb6d299272fea5e8458e"},"schema_version":"1.0"},"canonical_sha256":"ab2d0e85c4dff52b8263cf36b23960d62dd273f62ff7bf8baaca2e9a2c9ac8fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:18.871214Z","signature_b64":"1napj26h2adUDOPVaGkCKC6b3NQHWoKDTmUrboTWVWTxmJvx8dYnPCAad4TVFqfcNRa03z2xVO0l3IeW43vWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab2d0e85c4dff52b8263cf36b23960d62dd273f62ff7bf8baaca2e9a2c9ac8fa","last_reissued_at":"2026-05-18T00:21:18.869467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:18.869467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.04509","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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wWSyQlUWc47R7Np1dyBAqLewpLTPgB5Fn6JW/SINqagdCARuB9BWodHEwuMdKFSmR1Y8QpomsG9voG1rJAtuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:03:52.251240Z"},"content_sha256":"be6865f7f8f3c37867bcaa29c718389fd3bd88986ba26fa7b135981a64b88f15","schema_version":"1.0","event_id":"sha256:be6865f7f8f3c37867bcaa29c718389fd3bd88986ba26fa7b135981a64b88f15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VMWQ5BOE372SXATDZ43LEOLA2Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sorting by Swaps with Noisy Comparisons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.NE","authors_text":"Barbara Geissmann, Johannes Lengler, Tom\\'a\\v{s} Gaven\\v{c}iak","submitted_at":"2018-03-12T20:14:19Z","abstract_excerpt":"We study sorting of permutations by random swaps if each comparison gives the wrong result with some fixed probability $p<1/2$. We use this process as prototype for the behaviour of randomized, comparison-based optimization heuristics in the presence of noisy comparisons. As quality measure, we compute the expected fitness of the stationary distribution. To measure the runtime, we compute the minimal number of steps after which the average fitness approximates the expected fitness of the stationary distribution.\n  We study the process where in each round a random pair of elements at distance a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04509","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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2dsTVRe4Ek/MxH1Gb5vQDVuImy1aqKesa4p+Y5E8/ElSn2/beGGS61Wl1mRi0a+S02D3Z7zwCiWtZ6T3XIKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:03:52.251943Z"},"content_sha256":"566c8edea5f863da2f901b907a80224ef4466c2b770e8785d21edf990f35826e","schema_version":"1.0","event_id":"sha256:566c8edea5f863da2f901b907a80224ef4466c2b770e8785d21edf990f35826e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VMWQ5BOE372SXATDZ43LEOLA2Y/bundle.json","state_url":"https://pith.science/pith/VMWQ5BOE372SXATDZ43LEOLA2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VMWQ5BOE372SXATDZ43LEOLA2Y/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-05-26T17:03:52Z","links":{"resolver":"https://pith.science/pith/VMWQ5BOE372SXATDZ43LEOLA2Y","bundle":"https://pith.science/pith/VMWQ5BOE372SXATDZ43LEOLA2Y/bundle.json","state":"https://pith.science/pith/VMWQ5BOE372SXATDZ43LEOLA2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VMWQ5BOE372SXATDZ43LEOLA2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VMWQ5BOE372SXATDZ43LEOLA2Y","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":"3c694ac2a14298e1da140e409257d873ef3e292bad17fb6d299272fea5e8458e","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-12T20:14:19Z","title_canon_sha256":"66d0c1ac536d070cd7017397bab77c70c34dcd5956be20b6580ea6592948f21a"},"schema_version":"1.0","source":{"id":"1803.04509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04509","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04509v1","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04509","created_at":"2026-05-18T00:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"VMWQ5BOE372S","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VMWQ5BOE372SXATD","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VMWQ5BOE","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:566c8edea5f863da2f901b907a80224ef4466c2b770e8785d21edf990f35826e","target":"graph","created_at":"2026-05-18T00:21:18Z","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 study sorting of permutations by random swaps if each comparison gives the wrong result with some fixed probability $p<1/2$. We use this process as prototype for the behaviour of randomized, comparison-based optimization heuristics in the presence of noisy comparisons. As quality measure, we compute the expected fitness of the stationary distribution. To measure the runtime, we compute the minimal number of steps after which the average fitness approximates the expected fitness of the stationary distribution.\n  We study the process where in each round a random pair of elements at distance a","authors_text":"Barbara Geissmann, Johannes Lengler, Tom\\'a\\v{s} Gaven\\v{c}iak","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-12T20:14:19Z","title":"Sorting by Swaps with Noisy Comparisons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04509","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:be6865f7f8f3c37867bcaa29c718389fd3bd88986ba26fa7b135981a64b88f15","target":"record","created_at":"2026-05-18T00:21:18Z","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":"3c694ac2a14298e1da140e409257d873ef3e292bad17fb6d299272fea5e8458e","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-03-12T20:14:19Z","title_canon_sha256":"66d0c1ac536d070cd7017397bab77c70c34dcd5956be20b6580ea6592948f21a"},"schema_version":"1.0","source":{"id":"1803.04509","kind":"arxiv","version":1}},"canonical_sha256":"ab2d0e85c4dff52b8263cf36b23960d62dd273f62ff7bf8baaca2e9a2c9ac8fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab2d0e85c4dff52b8263cf36b23960d62dd273f62ff7bf8baaca2e9a2c9ac8fa","first_computed_at":"2026-05-18T00:21:18.869467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:18.869467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1napj26h2adUDOPVaGkCKC6b3NQHWoKDTmUrboTWVWTxmJvx8dYnPCAad4TVFqfcNRa03z2xVO0l3IeW43vWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:18.871214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be6865f7f8f3c37867bcaa29c718389fd3bd88986ba26fa7b135981a64b88f15","sha256:566c8edea5f863da2f901b907a80224ef4466c2b770e8785d21edf990f35826e"],"state_sha256":"62d6a19c79d6fe0db92739a39a7927ee33c35687e30194396386492a78a6c4d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibll30RaA4LFhH7Ag0E73vS25cL5Q3adqrNok7QaKdwbko4+F8JTAgpEvBNZInbZtocT7yVdjF/Tph3gnB8tBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:03:52.256091Z","bundle_sha256":"210744800af84624d73ac60e8946da282ac7f060060892ac272066b3e2f0b699"}}