{"as_of":"2026-08-16T20:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f5f5b6c4ec70dbb64c1b6f031029be659d7be9765d263862368cccefdd7e4757","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T10:35:56.183336Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"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/2607.24621/citation-record","integrity":"/paper/2607.24621/integrity","json":"/paper/2607.24621/citation-record.json","paper":"/paper/2607.24621"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:53.855795Z","title":"Fredman and Robert Endre Tarjan , title =","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:53.855795Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:065d45712b4a18021a8cae40bdaab344425ab1da03b2fb5172e3482f54e4d374","observation_id":"7e901745-c521-41f4-9aab-a89f2ad1862e","resolution":{"observed_at":"2026-07-31T10:35:53.855795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:53.941905Z","title":"Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps , booktitle =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:53.941905Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:6a7382b2d12e952e1e7e354c57b1a18c553b566ae3fbe54947c64bc9dfdd3c40","observation_id":"f658350d-15b0-43a6-b0df-4c487afa6211","resolution":{"observed_at":"2026-07-31T10:35:53.941905Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-026-01387-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Fast and Simple Sorting Using Partial Information , journal =","venue":"Algorithmica","work_id":"8cd1b769-92d4-4997-aef6-58b877ef08a6","year":2026},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:53.996281Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:e7afad3c3e602ca2667de2a45948c59cfe28104090851b506b85b2289bd32a9a","observation_id":"9d66f0c7-30e3-4727-9fa7-b43ed1fe2f81","resolution":{"observed_at":"2026-07-31T10:36:18.237415Z","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-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-44985-x_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Improved Upper Bounds for Pairing Heaps , booktitle =","venue":"Lecture notes in computer science","work_id":"8c1b9b2c-02fc-4683-a757-036e1651d0d2","year":2000},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.072458Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:7baf08af1982a065ecc0e08ff65c70f5713eb2eabcfb0a1e354aebe11ef9a83f","observation_id":"5e6686b3-a8c5-41b7-b609-450fc2cea303","resolution":{"observed_at":"2026-07-31T10:36:18.124108Z","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-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-07-31T10:35:54.133603Z","title":"Fredman and Robert Sedgewick and Daniel Dominic Sleator and Robert Endre Tarjan , title =","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.133603Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:a64212eeb9aff1b5a73a14ea290d0241768e5776054f15bec19a790c9a1690c6","observation_id":"f82b7660-4c34-4ba8-8edf-b0aea22eed9a","resolution":{"observed_at":"2026-07-31T10:35:54.133603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:54.187459Z","title":"Soviet Mathematics Doklady , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.187459Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:ca0d8505652e6cf38e52aab498c8a25735e315db0429009be8a41bd3bbb8e05f","observation_id":"5e80a349-6abe-4b29-b7fa-77c56b95e2a7","resolution":{"observed_at":"2026-07-31T10:35:54.187459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:54.267606Z","title":"Guibas and Robert Sedgewick , title =","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.267606Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:99490b42ef172e3e7376a7c61725ede00577d8008d931a51f68216192b2399f0","observation_id":"98a84983-c23e-4c18-995a-7bb57015cb25","resolution":{"observed_at":"2026-07-31T10:35:54.267606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:54.355042Z","title":null,"venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.355042Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:b0ba3b9d44709baf15ef2ea66d38750f9b956d9aa524a79088e78905fca09a4d","observation_id":"ca898748-c340-4825-b388-5b30801244ca","resolution":{"observed_at":"2026-07-31T10:35:54.355042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3093240","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tarjan and Uri Zwick , title =","venue":"ACM Transactions on Algorithms","work_id":"78513e9c-6f48-4e5b-ab84-949aac8f2d50","year":2017},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.417624Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:b29ac004ba1b13417c0125fe35e96f28b875757d4aa146c55586dfde28be6f51","observation_id":"1e793a13-f949-4fc8-9444-034851d05c03","resolution":{"observed_at":"2026-07-31T10:36:17.958666Z","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-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-07-31T10:35:54.478220Z","title":"Worst-Case Efficient Priority Queues , booktitle =","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.478220Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:36a70c696ddf3ccace7a7673d8da269e55a906e215802256abb9b28d562fcf27","observation_id":"e57ffef6-e904-4e08-931f-68adff0d4d07","resolution":{"observed_at":"2026-07-31T10:35:54.478220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-36136-7_20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Funnel Heap --","venue":"Lecture notes in computer science","work_id":"94066958-5136-431f-9699-bd59072ebcfc","year":2002},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.520086Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:cbf66730b6a6d9b0a7345da1a8d8e21522a3fbed2bd9103e4cfb296129a35e07","observation_id":"46f43288-f852-473e-832e-7e511caccefd","resolution":{"observed_at":"2026-07-31T10:36:17.835730Z","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-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-07-31T10:35:54.586423Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.586423Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:07e14d24b3c28cb5d8b980d61199175b4c7252f6587d53e604b66c4f567e5b2a","observation_id":"3d26c8a0-1ff1-4a5d-a1cc-80ce5b36afde","resolution":{"observed_at":"2026-07-31T10:35:54.586423Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:54.653686Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.653686Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:dd826dd0e1aa46631e7e2482531f9cbad39d43a3805bf80bc94ee609b5e4854a","observation_id":"51fa9f9f-ba8d-4f75-b7d7-6a3ffcc0668c","resolution":{"observed_at":"2026-07-31T10:35:54.653686Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:54.711208Z","title":"Smooth Heaps and a Dual View of Self-Adjusting Data Structures , journal =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.711208Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:3d003adf7271ea316e79e06f3976e45ea1492c78e9c01fbca36fdc32f4abdc50","observation_id":"68281d4b-7a05-44e3-8223-7e0cab1c1cab","resolution":{"observed_at":"2026-07-31T10:35:54.711208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07-31T10:35:54.762459Z","title":"Ian Munro and Richard Peng and Sebastian Wild and Lingyi Zhang , title =","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.762459Z"},"links":{"cited_paper":"/paper/1908.00563","citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:76cc81e033b20df9d14e6c0665cf6a37a5737aa2ae0f4ae8fcacc692991289f1","observation_id":"a2fc0bcd-9ad0-4879-b184-8e1cf89c97fc","resolution":{"observed_at":"2026-07-31T10:35:54.762459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00236-013-0180-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Acta Informatica , volume =","venue":"Acta Informatica","work_id":"ee1caa56-f530-4294-bf09-3a974747c356","year":2013},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.838380Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:e6e847905afce6370fdd7448f020903984f04281ee773a37a0bfe165b4ca2083","observation_id":"f40b901e-4d90-4a44-920a-164283baa1b9","resolution":{"observed_at":"2026-07-31T10:36:17.565724Z","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-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-642-40273-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A History of Distribution-Sensitive Data Structures , booktitle =","venue":"Lecture notes in computer science","work_id":"b61a782e-3094-42a9-94ff-bf2b2192d3f5","year":2013},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.919502Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:b2d88ba841d5a08194d35a292b73b140d50767ebc43ea8e9c188c70420f908c9","observation_id":"508b81d0-c4fa-43df-8b18-a57b333e4329","resolution":{"observed_at":"2026-07-31T10:36:17.486596Z","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-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-07-31T10:35:54.987043Z","title":"2023 , eprint =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:54.987043Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:79d9de8f22f729d0735c570a087dca89e661370eaa4a71fe186579d09c6cca7a","observation_id":"1ff618c8-504f-4eb8-bad6-6def79faaccc","resolution":{"observed_at":"2026-07-31T10:35:54.987043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:55.042716Z","title":"2015 , url =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.042716Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:d5c6b9a2f16769f2b63c0d115f57404f51ad0e0996b8ebd15cb801fe6036d6b0","observation_id":"cdfd2277-154f-43f4-8858-cb157f8c97ff","resolution":{"observed_at":"2026-07-31T10:35:55.042716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:55.143935Z","title":"Simpler Optimal Sorting from a Directed Acyclic Graph , booktitle =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.143935Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:dcd1a7802e5f7b9731f038d9fb299bd4427443a120f9975b1cb5cdd010c4c0cd","observation_id":"0591fbf4-34ba-4612-a7db-981e791e9389","resolution":{"observed_at":"2026-07-31T10:35:55.143935Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/100785351","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2011 , url =","venue":"SIAM Journal on Computing","work_id":"8d8f61fe-ac99-412b-a0a1-024f9ad41268","year":2011},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.190543Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:5fcb721bcf75526f43e3516365520dd63f098064bc7c3e73247106cb848a3902","observation_id":"b5faa384-25e0-4d0b-9fd7-e7d94f3b0141","resolution":{"observed_at":"2026-07-31T10:36:17.377379Z","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-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-07-31T10:35:55.295174Z","title":"Alternatives to splay trees with O(log n) worst-case access times , booktitle =","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.295174Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:d45f06d37fd9415a24603f2c03fb1b9c5c9b465c8b4fa00156fcdd10dd174792","observation_id":"be404456-413a-4663-ae41-417c20dc4408","resolution":{"observed_at":"2026-07-31T10:35:55.295174Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:55.370681Z","title":"2007 , publisher =","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.370681Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:76fcf43802563fc1f4d6c31cd860c490bf3d8eca3dce38fb075cc9ed4b5db9dd","observation_id":"9832091c-2930-4947-b757-4b8b118b54a3","resolution":{"observed_at":"2026-07-31T10:35:55.370681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539797326988","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Schmidt and Alan Siegel , title =","venue":"SIAM Journal on Computing","work_id":"cc66315a-13dd-4ee9-a768-77dc028a4ffc","year":2000},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.448347Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:ecc4543155bda19d1d0335f9426c821e9d9848dfe68e1f07ab359e6dc915d654","observation_id":"ad8afa5d-9549-4141-bea4-a55d503903b0","resolution":{"observed_at":"2026-07-31T10:36:17.247322Z","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-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s009753979732699x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2000 , url =","venue":"SIAM Journal on Computing","work_id":"21a2dbc3-828b-45e9-9b0e-0d40349b73f6","year":2000},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.558539Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:1b7399e57e5a0bd31233f4dc252d94b794ef8211681d114a8709e3cb361211b8","observation_id":"d1a7c119-5446-43cc-8c6d-6a35b6cf1523","resolution":{"observed_at":"2026-07-31T10:36:17.091004Z","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-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.24134","last_updated":"2026-07-02T12:52:51Z","snapshot_observed_at":"2026-08-02T10:52:38.241070Z","submitted_at":"2026-04-27T07:42:51Z","title":"Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines","version":2},"cited_work":{"arxiv_id":"2604.24134","doi":"10.48550/arxiv.2604.24134","metadata_source":"pith","pith_arxiv_id":"2604.24134","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines","venue":"cs.DS","work_id":"dd17c79b-87a5-4bd7-9808-9afbe2b5f03c","year":2026},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.630588Z"},"links":{"cited_paper":"/paper/2604.24134","citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:915552d2247b30b110e2b72b851bcc2a22cab6f9388f811bc23d7478af127fcd","observation_id":"8a4bd4f6-e0ee-463a-9b5b-ea651d89c82e","resolution":{"observed_at":"2026-07-31T10:36:16.856157Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:55.689633Z","title":"Simpler Universally Optimal Dijkstra , booktitle =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.689633Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:2058f0ad7956fc2d6f5ac634e9ae6e22883772f5a3432ba46a43f6cdfc6fcefc","observation_id":"a4b89bbb-4ed0-4f55-80ed-f2573dc86508","resolution":{"observed_at":"2026-07-31T10:35:55.689633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.12653","last_updated":"2026-04-14T12:22:02Z","snapshot_observed_at":"2026-08-13T18:15:10.648171Z","submitted_at":"2026-04-14T12:22:02Z","title":"Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.12653","snapshot_observed_at":"2026-07-31T10:35:55.769485Z","title":"CoRR , volume =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.769485Z"},"links":{"cited_paper":"/paper/2604.12653","citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:e2af798a20cceb07ca5e3cf187c6974c91d208998b7f3ba58ad9d7fa82482af9","observation_id":"a62f22ef-cc95-4bfa-b5de-3d1cd9607fbf","resolution":{"observed_at":"2026-07-31T10:35:55.769485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:55.886703Z","title":"2023 , eprint =","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.886703Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:7e112a7a943cf43733c74b46f5217443df7c5ce2cd2d99415dd72d625e41ee9a","observation_id":"85821afa-b961-4c75-8743-8e17ba4d1106","resolution":{"observed_at":"2026-07-31T10:35:55.886703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:55.974863Z","title":"2024 , eprint =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:55.974863Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:5b386113f2af5b85cd59f317d612f0a0796bc1a3029292fb7c001a778a6077ad","observation_id":"85d22a74-9a0f-4458-b615-9456e0e32299","resolution":{"observed_at":"2026-07-31T10:35:55.974863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00453-004-1139-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Algorithmica , volume =","venue":"Algorithmica","work_id":"fffaba52-2c32-4826-910f-e0834e22aaa4","year":2005},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:56.057796Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:94b45eea532fbb00e4192e53ccef66566218f10dc39380fe9429eef8a5f14287","observation_id":"64da913c-8e5f-48f4-9c2c-406872e801ed","resolution":{"observed_at":"2026-07-31T10:36:16.684382Z","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-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-07-31T10:35:56.113119Z","title":"1977 , publisher =","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:56.113119Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:b31ff8cb633b136a48cecb748d19d0b05fd42ca0dffe4d6750b0878faac2c52c","observation_id":"68b99511-07bd-4b2a-8fb8-11dac16736fd","resolution":{"observed_at":"2026-07-31T10:35:56.113119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T10:35:56.183336Z","title":"Purely Functional Representations of Catenable Sorted Lists , booktitle =","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-31T10:35:56.183336Z"},"links":{"citing_paper":"/paper/2607.24621"},"observation_digest":"sha256:38991f23b63a29b47b986a847a3016cc9d0f39a586e8024d5d454e516907c7f6","observation_id":"d328cf29-ff13-4e8b-8b3c-fb614c2adc84","resolution":{"observed_at":"2026-07-31T10:35:56.183336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.24621","last_updated":"2026-07-27T16:16:53Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-10T09:35:56.979584Z","submitted_at":"2026-07-27T16:16:53Z","title":"Heaps and Their Working Sets"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":11,"verified_fuzzy":0},"total_outbound_references":33},"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 16 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2607.24621."}