{"as_of":"2026-08-16T13:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:73436141785182d903fab0878dac0503a2ebaa1d6d67d934cb4263e238462278","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:49:33.650560Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"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/1908.04511/citation-record","integrity":"/paper/1908.04511/integrity","json":"/paper/1908.04511/citation-record.json","paper":"/paper/1908.04511"},"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-14T13:49:33.933191Z","title":"ARM Architecture Reference Manual","venue":null,"work_id":"443680f1-79ed-4b43-9954-3f5b5c1a99d2","year":2019},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.569672Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:d366ba2620b2c9f8d72ca8d7f822914a3035f24c9888f47be9c543120924d2a6","observation_id":"a7c84caf-c101-44da-9009-8f0e32a674d7","resolution":{"observed_at":"2026-08-14T13:49:33.936616Z","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-14T13:49:33.923415Z","title":null,"venue":null,"work_id":"f85ed621-1a12-442b-8224-be083dd01c85","year":2006},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.573961Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:3d62119accb8bec3da72abc1daede14e23ede521c42b8843d1cbbf791ca7a2bc","observation_id":"0d970d22-d41c-472d-8f4b-0791b66be89a","resolution":{"observed_at":"2026-08-14T13:49:33.926710Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:49:33.912694Z","title":"Fatourou and N","venue":null,"work_id":"1e98f906-aea6-40b6-96c0-62bfb3c3977d","year":2012},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.577455Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:83aa2a46700a0bd1d261dd87ba758b1b4336606b8636defebed8646452f036ee","observation_id":"6ee27cff-6115-417d-8430-20bd3fd0e13d","resolution":{"observed_at":"2026-08-14T13:49:33.916335Z","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-14T13:49:33.902088Z","title":"Feldman and D","venue":null,"work_id":"edc720e5-8c17-41e1-9674-b9230a55c78c","year":2015},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.580948Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:ba9a9ac2c0c10bb0f087d0358d75dacbb1f13d4073f66d6dcd2bd2204ce8087a","observation_id":"ea73b497-98ae-467b-a775-519da4492313","resolution":{"observed_at":"2026-08-14T13:49:33.905649Z","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-14T13:49:33.891200Z","title":"Freudenthal and A","venue":null,"work_id":"dfea61a3-4bc8-47be-9573-133cbaf991af","year":1991},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.584605Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:32cc77b836f53850555821745a5f0ed9f56c1b837f495f71cd0560bc85e1e736","observation_id":"c4fa3834-fcc4-436c-982b-e31255748f43","resolution":{"observed_at":"2026-08-14T13:49:33.894636Z","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-14T13:49:33.880505Z","title":"Hendler, N","venue":null,"work_id":"326b3d18-ce07-46ca-aec5-a36f8ee00984","year":2004},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.588353Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:10d6545146295c3a1070f3d830ff82f5bf63f3cfbf9a05842dad4c1ce8ddc409","observation_id":"000db691-e6de-4582-b5fb-ee918e071205","resolution":{"observed_at":"2026-08-14T13:49:33.884056Z","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-14T13:49:33.869054Z","title":"PowerPC Architecture Book, Version 2.02","venue":null,"work_id":"45ed073e-a539-422a-89b9-ff5ea24784d7","year":2005},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.592787Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:fb58725b8d806e9dad86c3c9b51a751631d31171fdd9a0ba697f205fc75873fb","observation_id":"dbac69fb-dda3-4c17-b445-b7da1d438d99","resolution":{"observed_at":"2026-08-14T13:49:33.873556Z","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-14T13:49:33.857497Z","title":"Intel 64 and IA-32 Architectures Developer’s Manual","venue":null,"work_id":"5b044385-cae4-4c7c-b0c7-1c2b5ae57a40","year":2019},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.596354Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:9675871046dcb4c53864f3809cca8e2731df556e183e603c0dbf2021880fd8d8","observation_id":"d91f2b34-5772-47d2-864f-d9936e72718f","resolution":{"observed_at":"2026-08-14T13:49:33.862670Z","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-14T13:49:33.846799Z","title":null,"venue":null,"work_id":"3cc0bd44-fdb3-4d57-9993-331ce0214b08","year":2013},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.599415Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:8c9a622d6241331922b639eb6d2786ac29fe82959a017462fc4d53be976430fa","observation_id":"d3153a85-a974-444c-8fd1-9fcb20c6ba64","resolution":{"observed_at":"2026-08-14T13:49:33.850598Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:49:33.835131Z","title":"Krizhanovsky","venue":null,"work_id":"1d49d446-3dfd-4186-bd8f-6d5f920d21d4","year":2013},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.602761Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:9e0b63335cef7879a33dd85caba05a7ab40b6d8262cdf78f39536ef97a70d02e","observation_id":"2d5c7f9c-7c9a-4b3f-a2f8-f658d6d9fc97","resolution":{"observed_at":"2026-08-14T13:49:33.838889Z","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-14T13:49:33.822211Z","title":null,"venue":null,"work_id":"fa96acbd-b2c7-49af-8512-fab69be5ebd5","year":1979},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.606073Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:43aaf858805a08254a43b3ba7c13f8b1bc04eef5eff57f074b66ec061189f541","observation_id":"f6ccc439-d536-4b15-95c3-9310cfe9cb40","resolution":{"observed_at":"2026-08-14T13:49:33.826435Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:49:33.810338Z","title":"Lock-free Data Structure Library","venue":null,"work_id":"7d916833-08d4-46ec-ae22-cc6d80b3ad32","year":null},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.610234Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:9524dbf73f57195da53baab3f75e4be948b86c1808e43d0f3ded833172cbe475","observation_id":"5072cf2d-7bbf-4d32-b7cc-2afdfb19744f","resolution":{"observed_at":"2026-08-14T13:49:33.814978Z","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-14T13:49:33.800277Z","title":"Ringbuffer disappointment","venue":null,"work_id":"bf4813b2-a0d0-4440-bc5d-ff9457b7a009","year":2016},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.614025Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:b0c73e503d1876b3b0bb1b19f1555f6f191ead9d5f3a8cf1b44f133fefe163e2","observation_id":"21f7d0ed-1387-41d4-8a33-c13aa39a41c9","resolution":{"observed_at":"2026-08-14T13:49:33.803661Z","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-14T13:49:33.787982Z","title":"Memory Allocator Benchmarks","venue":null,"work_id":"381705f7-eaec-4f40-8fbc-9d8dfe7347dd","year":2019},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.617422Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:224e039bca8084d5b44327be9fce2b704a3f4ee7e8cfa8de599dcc5c0dfee43e","observation_id":"2e5c2d0a-03a7-432a-adde-fe520a792a57","resolution":{"observed_at":"2026-08-14T13:49:33.792333Z","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-14T13:49:33.777780Z","title":null,"venue":null,"work_id":"4f287e71-28d2-497c-92e9-6a54d421dee9","year":2004},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.620654Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:48257e2840171a23f4a0158675939328e06972c9c9fb1494a93e531cbf74431f","observation_id":"457d931b-9d73-42b5-88e1-8c47b9241a36","resolution":{"observed_at":"2026-08-14T13:49:33.781209Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:49:33.767277Z","title":null,"venue":null,"work_id":"eabed968-114f-452e-9a44-452fd2ba7021","year":1998},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.624063Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:ab3dee488c81a79cadd4657fee9067b44b9a158317cee0e576f95beda85ccdf6","observation_id":"749230af-3d25-4e85-8dcc-174ad364f5e1","resolution":{"observed_at":"2026-08-14T13:49:33.771078Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:49:33.756027Z","title":"MIPS32/MIPS64 Rev","venue":null,"work_id":"6f930753-d8e3-4a90-855b-2424bcb099c1","year":2019},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.627229Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:967ba503eb984177085566eeca19d86b74366f952a2fc46b9d242de44c241644","observation_id":"fd3d1a7f-1dbc-4c41-af0f-8af6f78de341","resolution":{"observed_at":"2026-08-14T13:49:33.759695Z","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-14T13:49:33.745200Z","title":null,"venue":null,"work_id":"455c5d27-1075-4203-93d2-896233710133","year":2005},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.630584Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:96c6c9106d96e1dc6e0d04f1a105e7a19019ad1656a7a54c1a7d1fde93113d4b","observation_id":"c8ae0a85-e137-4d81-b1fd-95e9403f9747","resolution":{"observed_at":"2026-08-14T13:49:33.748933Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:49:33.733343Z","title":"Morrison and Y","venue":null,"work_id":"1c435096-a657-464c-a4e5-7765c0fa7cb4","year":2013},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.634231Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:696d8763a38a71c322d1a6926f6417e388deb7e28c60ad698670ded82dececee","observation_id":"4258a83a-d1e7-488f-ada2-da5ae9f37f90","resolution":{"observed_at":"2026-08-14T13:49:33.736977Z","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-14T13:49:33.721105Z","title":"SPARC Architecture 2011","venue":null,"work_id":"5745cdbe-7093-4b4a-a464-cb5653b29c0f","year":2011},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.637181Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:089b36e024299dee2b143d55f1b486c56041af18dbdb99f3515d10e4f0906c2f","observation_id":"081b7b49-8d84-4588-bc7b-520a531d9a69","resolution":{"observed_at":"2026-08-14T13:49:33.725565Z","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-14T13:49:33.710239Z","title":"RISC-V Books","venue":null,"work_id":"43fa032a-73fc-477b-b27a-1e7adafbb5e7","year":2019},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.640558Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:216237b0b06e4da268880c549a611e4540b17e0c99bb23defc5a144198a56400","observation_id":"9f31932b-dcbf-4060-80e1-0dc890a7fa3c","resolution":{"observed_at":"2026-08-14T13:49:33.713799Z","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-14T13:49:33.699300Z","title":"Tsigas and Y","venue":null,"work_id":"bc454b9e-33c5-4e91-bd56-19b92ba67471","year":2001},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.643937Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:e315fbd6cef9732fa611102c90a5c4ac75c1db839c3d45854eddc6e9a68e9345","observation_id":"2e217fbb-8ed5-4a50-84d9-9f8bda1c4e92","resolution":{"observed_at":"2026-08-14T13:49:33.702757Z","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-14T13:49:33.688742Z","title":null,"venue":null,"work_id":"c6ea8936-4653-4fab-b8e0-76ddf43fda07","year":null},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.647181Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:381b8d868172f368c8f4d56e77d2318aba0a6f8b5023cc1f44d9be018d963163","observation_id":"378ce09c-6c64-4a06-82a7-0049569633c8","resolution":{"observed_at":"2026-08-14T13:49:33.692184Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:49:33.675079Z","title":"Yang and J","venue":null,"work_id":"7c7a5cb5-29f5-412a-ba2a-e4dabb8521ef","year":2016},"citing_paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:49:33.650560Z"},"links":{"citing_paper":"/paper/1908.04511"},"observation_digest":"sha256:dda8443a9d6be755ec86fd6db24f6e7247e807dc932063d75c8d64df48ec1921","observation_id":"ea12350e-866d-405f-8ab5-027b4a0d6c79","resolution":{"observed_at":"2026-08-14T13:49:33.679628Z","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"}}],"paper":{"arxiv_id":"1908.04511","last_updated":"2019-08-13T06:34:10Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-14T13:38:34.341389Z","submitted_at":"2019-08-13T06:34:10Z","title":"A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":24},"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 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:1908.04511."}