{"as_of":"2026-08-17T05:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:105e477ea446b02c28b7fd3a343a9231d455f5ea4d97d6a3c8eeb9aaca9de270","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T00:16:17.284749Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.08348/citation-record","integrity":"/paper/2608.08348/integrity","json":"/paper/2608.08348/citation-record.json","paper":"/paper/2608.08348"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2023.25","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:18.044824Z","title":"European Symposium on Algorithms (ESA) , year =","venue":null,"work_id":"2aaa5741-b527-4917-82a3-7a0ba3ea737e","year":2023},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.118026Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:73f6d73449a63df067dd550b41aec11be1e90326137910f2bd195e319e1f1c84","observation_id":"9f45c851-844e-4f17-9e2a-70e54e742f7b","resolution":{"observed_at":"2026-08-12T00:16:18.074744Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-12T23:08:17.061434+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-12T23:08:17.061434+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3664195","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:17.934838Z","title":"Adaptive Shivers Sort: An Alternative Sorting Algorithm , volume =","venue":null,"work_id":"70202a32-0401-4be4-b595-9141964eeca4","year":null},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.126964Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:dfccdc141058b6405daeded6112db8c3d1472a26e12b3322476921319a1489ff","observation_id":"0785d278-d2ee-421f-aa40-69ad65980c9f","resolution":{"observed_at":"2026-08-12T00:16:17.974827Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-12T23:08:17.119495+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-12T23:08:17.119495+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:22.364884Z","title":null,"venue":null,"work_id":"9a4952c1-37fa-4c32-b608-1f035110997d","year":null},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.153891Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:0a99099d433c85b58cf0549242daa60298439e384c3660abac2e89bd47db01ef","observation_id":"4fa7a59c-e2fb-4cb3-b7b3-c5b5964479a0","resolution":{"observed_at":"2026-08-12T00:16:22.414756Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:22.214869Z","title":"2009 , note =","venue":null,"work_id":"eeb31c78-d45a-44f0-9e82-8e309925ec22","year":2009},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.186324Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:c504384914de24c0b74435f5647b556be61c553701079cdb83896e94d1b1590a","observation_id":"5ed100e2-1c14-4c03-a733-32d24fbd9457","resolution":{"observed_at":"2026-08-12T00:16:22.265115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:22.046477Z","title":"Algorithmica , volume =","venue":null,"work_id":"ceeed350-5750-4f1c-8133-87b2fb05083f","year":null},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.205473Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:8c6366b59fddaf65ec6a6dbc4132446fb3914ef51589d1cd280424ebdee57914","observation_id":"02dd29db-ecb3-423b-84e3-ccf0fa013fbd","resolution":{"observed_at":"2026-08-12T00:16:22.114750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-24766-9_29","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"2019 , publisher =","venue":"Lecture notes in computer science","work_id":"7fee45e0-a11c-453a-b630-c7985fe9b593","year":2019},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.224743Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:eb06fd9aa43378d0693cd89bb1495e1f484023a519e49861d680821b4001a5b8","observation_id":"2a3c095f-7670-4df2-84d8-c5844943fcb2","resolution":{"observed_at":"2026-08-12T00:16:17.824831Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-12T23:08:17.180914+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-12T23:08:17.180914+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.00563","last_updated":"2019-08-01T18:08:19Z","snapshot_observed_at":"2026-08-16T11:43:23.829392Z","submitted_at":"2019-08-01T18:08:19Z","title":"Dynamic Optimality Refuted -- For Tournament Heaps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00563","snapshot_observed_at":"2026-08-12T00:16:16.268144Z","title":"arXiv , arxivId =:1908.00563 , year =","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.268144Z"},"links":{"cited_paper":"/paper/1908.00563","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:229066ab985ea85284cd45964f9e37db9e1a380588f8849a7eb4f38c32149695","observation_id":"aff3077b-fb7e-4e84-8855-25c69e2035ac","resolution":{"observed_at":"2026-08-12T00:16:16.268144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02533","last_updated":"2019-03-06T18:13:33Z","snapshot_observed_at":"2026-08-14T17:06:23.036187Z","submitted_at":"2019-03-06T18:13:33Z","title":"Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space","version":1},"cited_work":{"arxiv_id":"1903.02533","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.02533","snapshot_observed_at":"2026-08-12T00:16:20.738360Z","title":"Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space","venue":"cs.DS","work_id":"a1d4198e-02b4-41fa-a8e3-c96915953bff","year":2019},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.304749Z"},"links":{"cited_paper":"/paper/1903.02533","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:b379c72a3f3ca6ab633eb3e841836fa256e26779a15964bf4d8e6fed6b40d059","observation_id":"b7146d2e-a05a-4412-8201-91fbd88e4fd2","resolution":{"observed_at":"2026-08-12T00:16:20.757648Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:21.864795Z","title":null,"venue":null,"work_id":"6832e2d8-31f8-4ae7-b9e8-de3f313f6d28","year":null},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.334742Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:ad9c875dab93bcf235cef14922609bd378c940bf3113eba79ef9f510b942b3ae","observation_id":"e69f2071-e8fb-4bc0-b3ef-1b0fc9e80ed6","resolution":{"observed_at":"2026-08-12T00:16:21.914764Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.08513","last_updated":"2018-10-30T15:01:46Z","snapshot_observed_at":"2026-08-14T21:37:56.386987Z","submitted_at":"2016-09-27T16:05:10Z","title":"Median-of-k Jumplists and Dangling-Min BSTs","version":3},"cited_work":{"arxiv_id":"1609.08513","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.08513","snapshot_observed_at":"2026-08-12T00:16:20.637250Z","title":"Median-of-k Jumplists and Dangling-Min BSTs","venue":"cs.DS","work_id":"5744594c-4d71-4832-9b7d-70dfcc83c29d","year":2016},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.384744Z"},"links":{"cited_paper":"/paper/1609.08513","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:8a36cdd3ed92462f5620693f60200a3e84a6f55708a2dc551f28e6e6291f60d7","observation_id":"4bdf3016-7413-402d-a75d-99262beb2815","resolution":{"observed_at":"2026-08-12T00:16:20.682991Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.12322","last_updated":"2018-10-29T18:02:20Z","snapshot_observed_at":"2026-08-14T18:07:36.272546Z","submitted_at":"2018-10-29T18:02:20Z","title":"Sesquickselect: One and a half pivots for cache-efficient selection","version":1},"cited_work":{"arxiv_id":"1810.12322","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.12322","snapshot_observed_at":"2026-08-12T00:16:20.494836Z","title":"Sesquickselect: One and a half pivots for cache-efficient selection","venue":"cs.DS","work_id":"36def348-2323-4d30-8514-282384cdc80e","year":2018},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.434748Z"},"links":{"cited_paper":"/paper/1810.12322","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:615d912375e8798976f746f84bf8acdf12339ab822ee30152962f9df1ed7208b","observation_id":"7552f9f8-4235-4bd4-8284-ef38cefdc2f5","resolution":{"observed_at":"2026-08-12T00:16:20.530612Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.01259","last_updated":"2018-11-03T18:00:29Z","snapshot_observed_at":"2026-08-14T18:04:43.281390Z","submitted_at":"2018-11-03T18:00:29Z","title":"QuickXsort - A Fast Sorting Scheme in Theory and Practice","version":1},"cited_work":{"arxiv_id":"1811.01259","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.01259","snapshot_observed_at":"2026-08-12T00:16:20.314760Z","title":"QuickXsort - A Fast Sorting Scheme in Theory and Practice","venue":"cs.DS","work_id":"57907e98-2d5c-4047-bc6d-a4fdfdd3705e","year":2018},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.477162Z"},"links":{"cited_paper":"/paper/1811.01259","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:cfdbbe852eb538bf0075c31b15b373d75aeeae91fc445fed59ddd44e43d32482","observation_id":"d83bd7aa-c7ea-4bba-aa90-4305d4ad65b6","resolution":{"observed_at":"2026-08-12T00:16:20.356853Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1515/itit-2018-0012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:17.581256Z","title":"it - Information Technology , year =","venue":null,"work_id":"b5677f93-d53f-4892-8bb9-e9df389073aa","year":2018},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.535014Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:92d5af92da6c6ecd7b5aaa693d1c60010b5297af1312fcbda73bd22e1002ea52","observation_id":"892ebc4b-c086-4aae-bf8a-7d637e8cab90","resolution":{"observed_at":"2026-08-12T00:16:17.634751Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-12T23:08:17.255365+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-12T23:08:17.255365+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:21.674905Z","title":"European Symposium on Algorithms (ESA) , pages =","venue":null,"work_id":"b5c69234-1160-4fe8-9e53-2dd588ddfc5d","year":2018},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.594751Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:798cadd5d9d5ffbb763c67631bd4118a34a7f44a407cdd2965e66baf6c437a5b","observation_id":"e1407978-9642-48a3-8845-c3c04c8faad4","resolution":{"observed_at":"2026-08-12T00:16:21.714828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:16.664772Z","title":"Average Cost of","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.664772Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:d6961025589f189cd3453e2fa40e986cacc1b46259484dad5cb0f3f1be25a301","observation_id":"418085e5-2185-4e8f-b858-d373c25cc285","resolution":{"observed_at":"2026-08-12T00:16:16.664772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1608.04906","last_updated":"2017-11-01T17:00:19Z","snapshot_observed_at":"2026-08-14T21:43:52.700574Z","submitted_at":"2016-08-17T09:41:53Z","title":"Quicksort Is Optimal For Many Equal Keys","version":4},"cited_work":{"arxiv_id":"1608.04906","doi":null,"metadata_source":"pith","pith_arxiv_id":"1608.04906","snapshot_observed_at":"2026-08-12T00:16:20.074842Z","title":"Quicksort Is Optimal For Many Equal Keys","venue":"cs.DS","work_id":"fd156e3f-60d0-4292-8349-e6b8c2745b96","year":2016},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.678447Z"},"links":{"cited_paper":"/paper/1608.04906","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:92323b3feb8bed5f6e2edc1382b718b89c230f8ba01c302c29fea9c53a323ece","observation_id":"5594769b-b86a-4013-a078-2db4a446a43b","resolution":{"observed_at":"2026-08-12T00:16:20.125137Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1504.06475","last_updated":"2017-12-05T16:38:10Z","snapshot_observed_at":"2026-08-15T17:21:02.592958Z","submitted_at":"2015-04-24T11:37:00Z","title":"A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment","version":4},"cited_work":{"arxiv_id":"1504.06475","doi":null,"metadata_source":"pith","pith_arxiv_id":"1504.06475","snapshot_observed_at":"2026-08-12T00:16:19.855379Z","title":"A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment","venue":"cs.DS","work_id":"1766cf2c-30d9-462c-b6a4-7014f899e011","year":2015},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.714751Z"},"links":{"cited_paper":"/paper/1504.06475","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:04eaa4004641646c2a141dfe3ef63385670df56d48345c6c7dffafe7817dec31","observation_id":"a4f79b1c-5e74-46aa-aeda-b724aa88f95a","resolution":{"observed_at":"2026-08-12T00:16:19.894740Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1502.04048","last_updated":"2017-11-03T17:22:24Z","snapshot_observed_at":"2026-08-14T23:00:06.571597Z","submitted_at":"2015-02-13T16:22:18Z","title":"Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts","version":3},"cited_work":{"arxiv_id":"1502.04048","doi":null,"metadata_source":"pith","pith_arxiv_id":"1502.04048","snapshot_observed_at":"2026-08-12T00:16:19.618929Z","title":"Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts","venue":"cs.DS","work_id":"acc5d2eb-d812-4c56-8c9e-c683befe8337","year":2015},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.754749Z"},"links":{"cited_paper":"/paper/1502.04048","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:5f7d9c02e1238314df0e4ec73092bb79cc1cd2be6a8e7e99277ec1445f6eb423","observation_id":"7ca4db05-f978-4ffd-9b00-b183499b22b1","resolution":{"observed_at":"2026-08-12T00:16:19.674749Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:21.484820Z","title":"2016 , isbn =","venue":null,"work_id":"09ad0a2d-c6b9-4b9e-9ef5-51d14487ed4c","year":2016},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.814760Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:83ecc631f2ec3d4048bf13b7eb9c2dcfab7326a1079b5d12a863fdf568131e27","observation_id":"5ba6ea79-3f8b-4b1a-9a9a-0374ebfc3ca1","resolution":{"observed_at":"2026-08-12T00:16:21.544750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.0193","last_updated":"2015-08-10T07:03:08Z","snapshot_observed_at":"2026-08-14T23:09:39.135057Z","submitted_at":"2014-11-30T07:49:11Z","title":"Analysis of Pivot Sampling in Dual-Pivot Quicksort","version":2},"cited_work":{"arxiv_id":"1412.0193","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.0193","snapshot_observed_at":"2026-08-12T00:16:19.405250Z","title":"Analysis of Pivot Sampling in Dual-Pivot Quicksort","venue":"cs.DS","work_id":"c877c74e-07e6-4a36-a81d-9c9992a8d439","year":2014},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.864750Z"},"links":{"cited_paper":"/paper/1412.0193","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:3268e7bda668531d0f7c4ac5055bed9f435d1f3aadf7028f2f306089ac0ff808","observation_id":"497b955f-64de-4f78-9121-14f46bcf0113","resolution":{"observed_at":"2026-08-12T00:16:19.454838Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1304.0988","last_updated":"2015-02-13T16:38:39Z","snapshot_observed_at":"2026-08-15T00:22:45.472900Z","submitted_at":"2013-04-03T15:37:50Z","title":"Average Case and Distributional Analysis of Dual-Pivot Quicksort","version":3},"cited_work":{"arxiv_id":"1304.0988","doi":null,"metadata_source":"pith","pith_arxiv_id":"1304.0988","snapshot_observed_at":"2026-08-12T00:16:19.154825Z","title":"Average Case and Distributional Analysis of Dual-Pivot Quicksort","venue":"cs.DS","work_id":"755467a0-8086-4568-a48a-9cdd33db975f","year":2013},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.934752Z"},"links":{"cited_paper":"/paper/1304.0988","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:a9cf65b7bb85e1c79e9df15905552946a2e7e231add9c34fc145ca688d8d79a6","observation_id":"2c0b5855-1962-467b-bc72-6304bff77551","resolution":{"observed_at":"2026-08-12T00:16:19.214852Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.2059","last_updated":"2014-11-07T23:20:37Z","snapshot_observed_at":"2026-08-14T23:12:28.415008Z","submitted_at":"2014-11-07T23:20:37Z","title":"Analysis of Branch Misses in Quicksort","version":1},"cited_work":{"arxiv_id":"1411.2059","doi":null,"metadata_source":"pith","pith_arxiv_id":"1411.2059","snapshot_observed_at":"2026-08-12T00:16:18.924811Z","title":"Analysis of Branch Misses in Quicksort","venue":"cs.DS","work_id":"f1eed3be-2359-400d-8f44-4decabcf75c9","year":2014},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.984747Z"},"links":{"cited_paper":"/paper/1411.2059","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:fb293ecbb9873e1198701ab10dafed695f3b778549e7f6bbb23a05473c291301","observation_id":"8e166a2b-8b39-4750-a5e4-089313bc4159","resolution":{"observed_at":"2026-08-12T00:16:18.966380Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1306.3819","last_updated":"2014-11-15T13:54:05Z","snapshot_observed_at":"2026-08-15T00:13:52.115450Z","submitted_at":"2013-06-17T11:44:54Z","title":"Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm","version":3},"cited_work":{"arxiv_id":"1306.3819","doi":null,"metadata_source":"pith","pith_arxiv_id":"1306.3819","snapshot_observed_at":"2026-08-12T00:16:18.706217Z","title":"Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm","venue":"cs.DS","work_id":"0e7b69db-841f-45d2-b3a1-ff89909b7383","year":2013},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:17.014745Z"},"links":{"cited_paper":"/paper/1306.3819","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:1693684f22f872c03999225a4abc3525bf2facf4be06da2bf27933991fdb6ed3","observation_id":"f9dda184-56b1-4430-b02e-b61e10018f28","resolution":{"observed_at":"2026-08-12T00:16:18.755951Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1403.6602","last_updated":"2014-06-13T08:44:20Z","snapshot_observed_at":"2026-08-14T23:39:55.005888Z","submitted_at":"2014-03-26T09:37:30Z","title":"Pivot Sampling in Dual-Pivot Quicksort","version":2},"cited_work":{"arxiv_id":"1403.6602","doi":null,"metadata_source":"pith","pith_arxiv_id":"1403.6602","snapshot_observed_at":"2026-08-12T00:16:18.478203Z","title":"Pivot Sampling in Dual-Pivot Quicksort","venue":"cs.DS","work_id":"dc2c71c2-3cd3-4383-9c63-1f62a8090f73","year":2014},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:17.037014Z"},"links":{"cited_paper":"/paper/1403.6602","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:09b248676682ca158d8796cf2db478201401aa3ad1f371f0abe57f6493bef476","observation_id":"25699139-21d8-4982-9ad7-8124580ede5c","resolution":{"observed_at":"2026-08-12T00:16:18.514845Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:21.305166Z","title":"and Reitzig, Raphael and Laube, Ulrich , booktitle =","venue":null,"work_id":"0911b42d-bc97-4db4-8b65-e21b3d39f58b","year":2013},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:17.084751Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:7ee5bff11d9035a1d7e72909995cec34837421be4b10c142574f85baa7a59fab","observation_id":"9b6a9e57-6784-4e08-a560-af3537d0aa9e","resolution":{"observed_at":"2026-08-12T00:16:21.365944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1310.7409","last_updated":"2013-10-28T13:28:09Z","snapshot_observed_at":"2026-08-14T23:57:25.900054Z","submitted_at":"2013-10-28T13:28:09Z","title":"Average Case Analysis of Java 7's Dual Pivot Quicksort","version":1},"cited_work":{"arxiv_id":"1310.7409","doi":null,"metadata_source":"pith","pith_arxiv_id":"1310.7409","snapshot_observed_at":"2026-08-12T00:16:18.274747Z","title":"Average Case Analysis of Java 7's Dual Pivot Quicksort","venue":"cs.DS","work_id":"523e14e0-acf8-4717-9fdb-4e90867e59aa","year":2013},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:17.144757Z"},"links":{"cited_paper":"/paper/1310.7409","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:8c855c474dc7b8e6a06165c1e0ced750d54e366f2f4c6a5d7df1d10811f119dd","observation_id":"0e704151-efee-446d-979a-50a7e00c55e0","resolution":{"observed_at":"2026-08-12T00:16:18.314744Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:21.136030Z","title":"2012 , type =","venue":null,"work_id":"5d92108b-38a5-4fac-aeef-cbd50da0e2bd","year":2012},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:17.194748Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:db6db5b8b86d5c20473b8b203c7ba606d7388815ab63df52b2e1b6f55b75bb3f","observation_id":"1cc2ebe4-98a1-4cbe-9657-fa7403ed98fa","resolution":{"observed_at":"2026-08-12T00:16:21.194752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:21.025201Z","title":"Journal of Bioinformatics and Computational Biology , doi =","venue":null,"work_id":"d003907c-c634-417e-bfd4-7625051f07f6","year":2011},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:17.234749Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:e3e8f030c5aa372ffa2c0905524630e5f2d928343046d254d425424d17b6b62d","observation_id":"174c00cc-29b0-48b8-981d-d62f5a2262ab","resolution":{"observed_at":"2026-08-12T00:16:21.056305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T00:16:20.874919Z","title":null,"venue":null,"work_id":"9222dada-eadd-49c1-896c-cdb7e3820e8b","year":null},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:17.284749Z"},"links":{"citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:35aec3ea72ad78663d1d5a956aa0feefc88255a324bfb77fe84899e8abf4cc7b","observation_id":"ddfdbb3b-8986-4051-9041-3327c3724180","resolution":{"observed_at":"2026-08-12T00:16:20.924895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":8,"parse_uncertain":1,"unresolved":4,"verified_exact":9,"verified_fuzzy":7},"total_outbound_references":29},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2608.08348."}