{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O2YWLB4FADTT5WU67BKFJF4U4T","short_pith_number":"pith:O2YWLB4F","schema_version":"1.0","canonical_sha256":"76b165878500e73eda9ef854549794e4e94f299c96dcfd8c409f193166783f89","source":{"kind":"arxiv","id":"1805.03350","version":1},"attestation_state":"computed","paper":{"title":"Optimally Sorting Evolving Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Eppstein, Juan Jose Besa, Michael T. Goodrich, Timothy Johnson, William E. Devanny","submitted_at":"2018-05-09T02:13:31Z","abstract_excerpt":"We give optimal sorting algorithms in the evolving data framework, where an algorithm's input data is changing while the algorithm is executing. In this framework, instead of producing a final output, an algorithm attempts to maintain an output close to the correct output for the current state of the data, repeatedly updating its best estimate of a correct output over time. We show that a simple repeated insertion-sort algorithm can maintain an O(n) Kendall tau distance, with high probability, between a maintained list and an underlying total order of n items in an evolving data model where ea"},"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":"1805.03350","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-05-09T02:13:31Z","cross_cats_sorted":[],"title_canon_sha256":"16b50e2ba433d3c61a870c09181b0e25e1a71af248f542817ea9e09afd144541","abstract_canon_sha256":"00bb70760662ee498e3c6da4331ab8c57335aeff442bc2d9a8872b4893b2ce71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:20.423067Z","signature_b64":"SmuZZZZlBJb50YslxWfyVQW+IoaPdNTQnVB2Y+/kSuqCXntIbEn7rCpscI992anFLRPYqQG/+wgzGL32atM5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76b165878500e73eda9ef854549794e4e94f299c96dcfd8c409f193166783f89","last_reissued_at":"2026-05-18T00:16:20.422625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:20.422625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimally Sorting Evolving Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Eppstein, Juan Jose Besa, Michael T. Goodrich, Timothy Johnson, William E. Devanny","submitted_at":"2018-05-09T02:13:31Z","abstract_excerpt":"We give optimal sorting algorithms in the evolving data framework, where an algorithm's input data is changing while the algorithm is executing. In this framework, instead of producing a final output, an algorithm attempts to maintain an output close to the correct output for the current state of the data, repeatedly updating its best estimate of a correct output over time. We show that a simple repeated insertion-sort algorithm can maintain an O(n) Kendall tau distance, with high probability, between a maintained list and an underlying total order of n items in an evolving data model where ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03350","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.03350","created_at":"2026-05-18T00:16:20.422692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03350v1","created_at":"2026-05-18T00:16:20.422692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03350","created_at":"2026-05-18T00:16:20.422692+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2YWLB4FADTT","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2YWLB4FADTT5WU6","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2YWLB4F","created_at":"2026-05-18T12:32:40.477152+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/O2YWLB4FADTT5WU67BKFJF4U4T","json":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T.json","graph_json":"https://pith.science/api/pith-number/O2YWLB4FADTT5WU67BKFJF4U4T/graph.json","events_json":"https://pith.science/api/pith-number/O2YWLB4FADTT5WU67BKFJF4U4T/events.json","paper":"https://pith.science/paper/O2YWLB4F"},"agent_actions":{"view_html":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T","download_json":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T.json","view_paper":"https://pith.science/paper/O2YWLB4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03350&json=true","fetch_graph":"https://pith.science/api/pith-number/O2YWLB4FADTT5WU67BKFJF4U4T/graph.json","fetch_events":"https://pith.science/api/pith-number/O2YWLB4FADTT5WU67BKFJF4U4T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T/action/storage_attestation","attest_author":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T/action/author_attestation","sign_citation":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T/action/citation_signature","submit_replication":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T/action/replication_record"}},"created_at":"2026-05-18T00:16:20.422692+00:00","updated_at":"2026-05-18T00:16:20.422692+00:00"}