{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YBSCJSNGEDP3ZTECNYHDJSEKIY","short_pith_number":"pith:YBSCJSNG","canonical_record":{"source":{"id":"1805.05443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T20:54:56Z","cross_cats_sorted":[],"title_canon_sha256":"8e513a35a1776203daac6455f2beb0375d74a39dd2abf0dbbcc5daa293427761","abstract_canon_sha256":"4d8bc366f6d7ccca629184efed712e4288617c9a1090165e62b4e869a3209217"},"schema_version":"1.0"},"canonical_sha256":"c06424c9a620dfbccc826e0e34c88a462e52a6c09199d914889eb3bd02b4c3c4","source":{"kind":"arxiv","id":"1805.05443","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05443","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05443v1","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05443","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"YBSCJSNGEDP3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YBSCJSNGEDP3ZTEC","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YBSCJSNG","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YBSCJSNGEDP3ZTECNYHDJSEKIY","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T20:54:56Z","cross_cats_sorted":[],"title_canon_sha256":"8e513a35a1776203daac6455f2beb0375d74a39dd2abf0dbbcc5daa293427761","abstract_canon_sha256":"4d8bc366f6d7ccca629184efed712e4288617c9a1090165e62b4e869a3209217"},"schema_version":"1.0"},"canonical_sha256":"c06424c9a620dfbccc826e0e34c88a462e52a6c09199d914889eb3bd02b4c3c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:00.623938Z","signature_b64":"g0QAW6G144cYhWXXQhX9L8ZcOPY5yV+iS73hWQv8N3EbrElg0z30Vsu9FHgBL8qt5lQu51iTeJAb6QlQSEpcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c06424c9a620dfbccc826e0e34c88a462e52a6c09199d914889eb3bd02b4c3c4","last_reissued_at":"2026-05-18T00:16:00.623487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:00.623487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05443","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:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"233jnCLiANplXHoDmZASLqtbr1rPqBjvtBa0emRaJRwR7T+ZWStnwFnt70Hmk2ZogmvHrMveZZjDq4hZ47qLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:07:41.258599Z"},"content_sha256":"363c1b7b31128b42d53ca07b92a6117132b340340b61054f815a073fd9158188","schema_version":"1.0","event_id":"sha256:363c1b7b31128b42d53ca07b92a6117132b340340b61054f815a073fd9158188"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YBSCJSNGEDP3ZTECNYHDJSEKIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Eppstein, Juan Jose Besa, Michael Goodrich, Timothy Johnson, William E. Devanny","submitted_at":"2018-05-14T20:54:56Z","abstract_excerpt":"We empirically study sorting in the evolving data model. In this model, a sorting algorithm maintains an approximation to the sorted order of a list of data items while simultaneously, with each comparison made by the algorithm, an adversary randomly swaps the order of adjacent items in the true sorted order. Previous work studies only two versions of quicksort, and has a gap between the lower bound of Omega(n) and the best upper bound of O(n log log n). The experiments we perform in this paper provide empirical evidence that some quadratic-time algorithms such as insertion sort and bubble sor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05443","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:16:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4yWwx5XlD2HVv3Lm4qiQolzJbJ/U8ScTao/DVR84dmmUAEj8APpc/uM5UlnMXUfDbm/nguHn9KsT2/fjrZRCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:07:41.259261Z"},"content_sha256":"1456f3b373113214d31120002743eb346b3612d6fd45d6f5edbc357c9a494319","schema_version":"1.0","event_id":"sha256:1456f3b373113214d31120002743eb346b3612d6fd45d6f5edbc357c9a494319"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBSCJSNGEDP3ZTECNYHDJSEKIY/bundle.json","state_url":"https://pith.science/pith/YBSCJSNGEDP3ZTECNYHDJSEKIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBSCJSNGEDP3ZTECNYHDJSEKIY/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-05T20:07:41Z","links":{"resolver":"https://pith.science/pith/YBSCJSNGEDP3ZTECNYHDJSEKIY","bundle":"https://pith.science/pith/YBSCJSNGEDP3ZTECNYHDJSEKIY/bundle.json","state":"https://pith.science/pith/YBSCJSNGEDP3ZTECNYHDJSEKIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBSCJSNGEDP3ZTECNYHDJSEKIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YBSCJSNGEDP3ZTECNYHDJSEKIY","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":"4d8bc366f6d7ccca629184efed712e4288617c9a1090165e62b4e869a3209217","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T20:54:56Z","title_canon_sha256":"8e513a35a1776203daac6455f2beb0375d74a39dd2abf0dbbcc5daa293427761"},"schema_version":"1.0","source":{"id":"1805.05443","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05443","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05443v1","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05443","created_at":"2026-05-18T00:16:00Z"},{"alias_kind":"pith_short_12","alias_value":"YBSCJSNGEDP3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YBSCJSNGEDP3ZTEC","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YBSCJSNG","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:1456f3b373113214d31120002743eb346b3612d6fd45d6f5edbc357c9a494319","target":"graph","created_at":"2026-05-18T00:16:00Z","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 empirically study sorting in the evolving data model. In this model, a sorting algorithm maintains an approximation to the sorted order of a list of data items while simultaneously, with each comparison made by the algorithm, an adversary randomly swaps the order of adjacent items in the true sorted order. Previous work studies only two versions of quicksort, and has a gap between the lower bound of Omega(n) and the best upper bound of O(n log log n). The experiments we perform in this paper provide empirical evidence that some quadratic-time algorithms such as insertion sort and bubble sor","authors_text":"David Eppstein, Juan Jose Besa, Michael Goodrich, Timothy Johnson, William E. Devanny","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T20:54:56Z","title":"Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05443","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:363c1b7b31128b42d53ca07b92a6117132b340340b61054f815a073fd9158188","target":"record","created_at":"2026-05-18T00:16:00Z","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":"4d8bc366f6d7ccca629184efed712e4288617c9a1090165e62b4e869a3209217","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-14T20:54:56Z","title_canon_sha256":"8e513a35a1776203daac6455f2beb0375d74a39dd2abf0dbbcc5daa293427761"},"schema_version":"1.0","source":{"id":"1805.05443","kind":"arxiv","version":1}},"canonical_sha256":"c06424c9a620dfbccc826e0e34c88a462e52a6c09199d914889eb3bd02b4c3c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c06424c9a620dfbccc826e0e34c88a462e52a6c09199d914889eb3bd02b4c3c4","first_computed_at":"2026-05-18T00:16:00.623487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:00.623487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g0QAW6G144cYhWXXQhX9L8ZcOPY5yV+iS73hWQv8N3EbrElg0z30Vsu9FHgBL8qt5lQu51iTeJAb6QlQSEpcCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:00.623938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05443","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:363c1b7b31128b42d53ca07b92a6117132b340340b61054f815a073fd9158188","sha256:1456f3b373113214d31120002743eb346b3612d6fd45d6f5edbc357c9a494319"],"state_sha256":"7eeeef0f203270f9fa837412a48da974845d635482b4a237b692623c3ed2cbfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jd5c3bwyG/yNCjDmb3awq50A6daCYhziWPOE2YtnLf8S7DCuh7ViUTN5AZ3haIJNRbar2BNnhnN66345vSlJAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:07:41.262712Z","bundle_sha256":"44e094de2637819ac197b71345143c2c3d475316223e07595e82ed3e85e4d214"}}