{"as_of":"2026-08-09T20:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:df43f51f53c72f9d46d98d0099dd4c2b0a38c29f189464df663a461743b6f99c","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:33:32.495238Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2505.21669/citation-record","integrity":"/paper/2505.21669/integrity","json":"/paper/2505.21669/citation-record.json","paper":"/paper/2505.21669"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:33:35.267188Z","title":"V., and Corasick, M","venue":null,"work_id":"8f5eb2c6-92ea-4931-9e41-c4fbdc4cfde9","year":1975},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:31.099030Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:95bef41c370b527bba0f9319145b37ea39e97f61063d50faa3e2c336ca4b0241","observation_id":"30bb13e3-ca66-4606-888d-a810576fc41d","resolution":{"observed_at":"2026-08-07T13:33:35.339729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:33.313143Z","title":"S., Yun, T.-S., Byeon, S., Koo, Y","venue":null,"work_id":"484515a8-592c-4ff3-b942-aa74a221d962","year":2022},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:32.337388Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:0d5b08b9fe82fa1c736f78be46dd671d39bf31b3bb25232e3cf679e270af3945","observation_id":"a15ff136-f68c-40d7-8fb8-8144892b86d8","resolution":{"observed_at":"2026-08-07T13:33:33.411622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:32.730408Z","title":null,"venue":null,"work_id":"6ca30bed-4443-4450-b742-833f09f925c7","year":2022},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:32.458243Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:738261ef75a514a58c4804bed1ea8e9f2d47dcac9a2b8d3fdfd64f3b7560b4ee","observation_id":"218dc16e-957a-42b5-9398-346567059a0a","resolution":{"observed_at":"2026-08-07T13:33:32.998044Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:33.103601Z","title":"S.Effective jump-pointer prefetching for linked data structures","venue":null,"work_id":"d5054437-c083-4d99-9168-6e368c6c5d76","year":1999},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":126,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:32.407128Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:5947d3433fc82c909ee105897dafbbed32e485a18fa10dcdfadce8885963b331","observation_id":"5417b680-87b5-4246-a3b0-181ff412d217","resolution":{"observed_at":"2026-08-07T13:33:33.188958Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:34.596171Z","title":null,"venue":null,"work_id":"58ef9d87-4e10-4aae-8d19-da35aeabb5da","year":2002},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":137,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:31.575574Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:560140700e7baecf40f5a61a0025f69e9d0c72ddd9eb46c14881aa7e0669e053","observation_id":"7ce1ede8-5e68-49a0-bd98-02f8e2a68465","resolution":{"observed_at":"2026-08-07T13:33:34.666503Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:34.150108Z","title":"B., and Kim, H.Spare register aware prefetching for graph algorithms on GPUs","venue":null,"work_id":"aaf3468c-521f-40d1-8932-d23326e135ca","year":2014},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":543,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:31.900874Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:3fc30772aaba8c5c0bd2a23b3d0479e0e7edf9db439e46aab616e1d770ec186f","observation_id":"4dccbd60-3a0a-4e9e-96db-cb28c4cfd00a","resolution":{"observed_at":"2026-08-07T13:33:34.191602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:34.947881Z","title":"E., Heirman, W., and Eeckhout, L.Sniper: Exploring the level of abstraction for scalable and accurate parallel multi-core simulation","venue":null,"work_id":"799c72e1-fac3-44af-bdf0-ec14d92b747f","year":2024},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:31.287609Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:6121fd3f941881b9d6881253be1a0da32cf98e738a3c66581d3903ffc747d920","observation_id":"7e200edf-4f61-4ac7-bd5d-8133e62fbcf7","resolution":{"observed_at":"2026-08-07T13:33:35.015428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:34.413953Z","title":"In2011 IEEE 3rd International Conference on Communication Software and Networks(May 2011), pp","venue":null,"work_id":"31bec8b8-0968-4c50-91c7-6ff4cbb0aad5","year":2011},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:31.701188Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:28c646cd21d370523f98b51e8456caabf32517e5574ca1034f28a4604eb80b8e","observation_id":"46899a65-14c0-40ee-915b-9fc2b058aeb6","resolution":{"observed_at":"2026-08-07T13:33:34.476567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:34.782545Z","title":"Proceedings.(Nov","venue":null,"work_id":"c7eb4254-81c8-4f30-92a6-1ab46b0a3415","year":2002},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:31.445005Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:2bbaf91a69135ec7ce736abc9708be6b7c8197f470ed555fcda389940bc77085","observation_id":"ca179efe-9fc7-4bb7-8f66-45aaa2558e95","resolution":{"observed_at":"2026-08-07T13:33:34.837708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.08478","last_updated":"2026-07-30T22:10:34Z","snapshot_observed_at":"2026-08-06T05:53:23.871131Z","submitted_at":"2025-01-14T22:41:29Z","title":"SEQC: Stratify-Elaborate Quantum Compilation Towards Modular Hybrid Architectures","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.08478","snapshot_observed_at":"2026-08-07T13:33:32.495238Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:32.495238Z"},"links":{"cited_paper":"/paper/2501.08478","citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:0f4bea1a69c48218a981cf3c525af311a1def86b0f1a20428cec3fbdd244402e","observation_id":"3cfae91e-e3db-4369-bceb-376dde7b2f9c","resolution":{"observed_at":"2026-08-07T13:33:32.495238Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T13:33:33.990551Z","title":"2004), pp","venue":null,"work_id":"2f4119a8-65f0-468a-b258-3c4a3e05c161","year":2004},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:31.992232Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:a88681ce42c7e8a554b742084109cb503f28d3322cf028bb56a539cc046064e6","observation_id":"202d6077-5c6e-4ad1-bb21-e0e541cc39b7","resolution":{"observed_at":"2026-08-07T13:33:34.073983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:35.097939Z","title":"In2012 21st International Conference on Parallel Architectures and Compilation Techniques (PACT)(Sept","venue":null,"work_id":"e54089fa-c1d5-4f72-8f63-efe7275628bc","year":2012},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:31.211714Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:fe03f1d0f2e1fb26322636c287e1db95318093fd8b8c2914e09c6682ff7ef656","observation_id":"5e3f4123-7c27-4754-9c00-2571f41aa2aa","resolution":{"observed_at":"2026-08-07T13:33:35.185643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:34.300826Z","title":"InPro- ceedings of the 24th Annual International Symposium on Computer Architecture (New York, NY, USA, May 1997), ISCA ’97, Association for Computing Machin- ery, pp","venue":null,"work_id":"1a75857b-df82-4123-b1f3-fa88b38a80f7","year":1997},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:31.805262Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:5fc96b7a0998830d7fc7c9494678b5cf3bdcdb675cb4c98e3e518669e9b41043","observation_id":"af7a6029-eeef-4e40-bd0e-ae39762f333c","resolution":{"observed_at":"2026-08-07T13:33:34.355597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:33.799789Z","title":"In2010 IEEE 16th International Conference on Parallel and Distributed Systems(Dec","venue":null,"work_id":"eecde42a-fb5a-43ee-b1d5-af24a91b9ebb","year":2010},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:32.110658Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:4819e5d3ec965232058b943ec813150b662753161d7e34620b35524d80755aad","observation_id":"68fd74df-ee2b-47c7-b0e5-6889776d4ed1","resolution":{"observed_at":"2026-08-07T13:33:33.879487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T13:33:33.549428Z","title":"[43]Mittal, S.A Survey of Recent Prefetching Techniques for Processor Caches.ACM Computing Surveys 49, 2 (June 2017), 1–35","venue":null,"work_id":"17cdabe3-22b2-403c-83a9-013bb0443004","year":1982},"citing_paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:32.221742Z"},"links":{"citing_paper":"/paper/2505.21669"},"observation_digest":"sha256:a52c26549f1a464305dac832d37f3d5028aacd7601b53c081d3689f4b0f553e6","observation_id":"618d0327-7eb2-4d38-85d8-37c7707e8625","resolution":{"observed_at":"2026-08-07T13:33:33.649456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.21669","last_updated":"2025-05-27T18:47:34Z","latest_version":1,"primary_category":"cs.AR","snapshot_observed_at":"2026-08-07T13:23:00.026451Z","submitted_at":"2025-05-27T18:47:34Z","title":"Improved Prefetching Techniques for Linked Data Structures"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":12},"total_outbound_references":15},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2505.21669."}