{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O2YWLB4FADTT5WU67BKFJF4U4T","short_pith_number":"pith:O2YWLB4F","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"},"canonical_sha256":"76b165878500e73eda9ef854549794e4e94f299c96dcfd8c409f193166783f89","source":{"kind":"arxiv","id":"1805.03350","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03350","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03350v1","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03350","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"O2YWLB4FADTT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O2YWLB4FADTT5WU6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O2YWLB4F","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O2YWLB4FADTT5WU67BKFJF4U4T","target":"record","payload":{"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"},"canonical_sha256":"76b165878500e73eda9ef854549794e4e94f299c96dcfd8c409f193166783f89","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"},"source_kind":"arxiv","source_id":"1805.03350","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZcmjxo5i8CoEXWsQntXKQ0ORuFQD9pffWA2En6UsLxDaTURPYBsFUZ3BgYgdWTN1BAL4BtcpphbDBCub9CjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:15:23.012569Z"},"content_sha256":"ec076e4049ca1dda8ad52f5afcf4b402624e681e77d139a21ee3925f9ac5f984","schema_version":"1.0","event_id":"sha256:ec076e4049ca1dda8ad52f5afcf4b402624e681e77d139a21ee3925f9ac5f984"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O2YWLB4FADTT5WU67BKFJF4U4T","target":"graph","payload":{"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"},"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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1byNL+W5UpQeAFSf65tSMh1rEywz9Rwg6BBeZmJT8fefys/FZq+ukoXEwWGpQvj4irQnSSuSa+J4sGY6FeIdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:15:23.013205Z"},"content_sha256":"b33ec9ebedf676e391912cecb4de7fce16759783d6a47352368da37b959abd31","schema_version":"1.0","event_id":"sha256:b33ec9ebedf676e391912cecb4de7fce16759783d6a47352368da37b959abd31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T/bundle.json","state_url":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2YWLB4FADTT5WU67BKFJF4U4T/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-05T16:15:23Z","links":{"resolver":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T","bundle":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T/bundle.json","state":"https://pith.science/pith/O2YWLB4FADTT5WU67BKFJF4U4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2YWLB4FADTT5WU67BKFJF4U4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O2YWLB4FADTT5WU67BKFJF4U4T","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":"00bb70760662ee498e3c6da4331ab8c57335aeff442bc2d9a8872b4893b2ce71","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-05-09T02:13:31Z","title_canon_sha256":"16b50e2ba433d3c61a870c09181b0e25e1a71af248f542817ea9e09afd144541"},"schema_version":"1.0","source":{"id":"1805.03350","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03350","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03350v1","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03350","created_at":"2026-05-18T00:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"O2YWLB4FADTT","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O2YWLB4FADTT5WU6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O2YWLB4F","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:b33ec9ebedf676e391912cecb4de7fce16759783d6a47352368da37b959abd31","target":"graph","created_at":"2026-05-18T00:16:20Z","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 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","authors_text":"David Eppstein, Juan Jose Besa, Michael T. Goodrich, Timothy Johnson, William E. Devanny","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-05-09T02:13:31Z","title":"Optimally Sorting Evolving Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03350","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:ec076e4049ca1dda8ad52f5afcf4b402624e681e77d139a21ee3925f9ac5f984","target":"record","created_at":"2026-05-18T00:16:20Z","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":"00bb70760662ee498e3c6da4331ab8c57335aeff442bc2d9a8872b4893b2ce71","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-05-09T02:13:31Z","title_canon_sha256":"16b50e2ba433d3c61a870c09181b0e25e1a71af248f542817ea9e09afd144541"},"schema_version":"1.0","source":{"id":"1805.03350","kind":"arxiv","version":1}},"canonical_sha256":"76b165878500e73eda9ef854549794e4e94f299c96dcfd8c409f193166783f89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76b165878500e73eda9ef854549794e4e94f299c96dcfd8c409f193166783f89","first_computed_at":"2026-05-18T00:16:20.422625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:20.422625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SmuZZZZlBJb50YslxWfyVQW+IoaPdNTQnVB2Y+/kSuqCXntIbEn7rCpscI992anFLRPYqQG/+wgzGL32atM5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:20.423067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03350","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec076e4049ca1dda8ad52f5afcf4b402624e681e77d139a21ee3925f9ac5f984","sha256:b33ec9ebedf676e391912cecb4de7fce16759783d6a47352368da37b959abd31"],"state_sha256":"91567318ba260244bd0cede16b03800e2d66baa117262dcbdd90960de132d316"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/p6HyLjQ31LXEe6I7iki9w1GIoAj3DYaEVYjLyo7CawyFQQ3HCrfsPBLX7VsDl+OGlzBnpmXEYFGLH9cqBpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:15:23.016346Z","bundle_sha256":"0311200e7ab2333ca9c0b37e4679e5f6c533a11341f14473742e8b21aa90c5ad"}}