{"as_of":"2026-08-19T13:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2305f41df69300fd4c624849bbb3703c48de77a07b534b25e14a7ef5bc480d66","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T22:04:23.846745Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2506.22703/citation-record","integrity":"/paper/2506.22703/integrity","json":"/paper/2506.22703/citation-record.json","paper":"/paper/2506.22703"},"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-06T22:04:26.566470Z","title":"Efficient calculation of triangle centrality in big data networks,","venue":null,"work_id":"f6020fc2-e56f-4314-9d3a-ee9587464579","year":2022},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:22.488776Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:729fa46498d3d9a186c46b4f025bc1b564b05a44f841d238233c1c3c3814bc3c","observation_id":"dec03382-5896-4b33-9bf5-3509a5fd81bb","resolution":{"observed_at":"2026-08-06T22:04:26.639240Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:26.363707Z","title":"A sparse matrix approach for covering large complex networks by cliques,","venue":null,"work_id":"572f3528-f5e6-47d3-8afc-f5a99250ab30","year":2022},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:22.560803Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:845a245379189bbcf76e9af597f276048d0aa2562039d5034b539b48f0fb83a0","observation_id":"b61168ed-4b5a-4369-93b2-b4548b923137","resolution":{"observed_at":"2026-08-06T22:04:26.458970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:26.167268Z","title":null,"venue":null,"work_id":"68b1b429-f76c-4f8b-9f35-11e8bd7facd6","year":2025},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:22.661865Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:d76dd7574aec45e91c151b65f728588943e054617e8f294c4abbe19aacccc33a","observation_id":"f5633e7f-96a7-47a9-b262-0dd2864b363e","resolution":{"observed_at":"2026-08-06T22:04:26.267570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:26.020629Z","title":"Ompgpt: A generative pre-trained transformer model for openmp,","venue":null,"work_id":"c234e8b6-7052-4af4-9a25-b77dd69644d0","year":2024},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:22.729089Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:a3dc53d55d4b7ff6907774df1f7f9fa0eb21bdaf2172794d11702ed234a219ed","observation_id":"ce5eba72-a493-4111-ba26-220de4124a63","resolution":{"observed_at":"2026-08-06T22:04:26.078813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14771","last_updated":"2024-09-23T07:39:01Z","snapshot_observed_at":"2026-08-16T13:16:22.091816Z","submitted_at":"2024-09-23T07:39:01Z","title":"OMPar: Automatic Parallelization with AI-Driven Source-to-Source Compilation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14771","snapshot_observed_at":"2026-08-06T22:04:22.798146Z","title":"Ompar: Automatic paral- lelization with ai-driven source-to-source compilation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:22.798146Z"},"links":{"cited_paper":"/paper/2409.14771","citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:8916899d0de1b6755546a65f0df69c9fb7b3c555c2c07762c9f709c10a7ad10e","observation_id":"a95ef6be-067c-4ce6-b3b3-91533bfdb10e","resolution":{"observed_at":"2026-08-06T22:04:22.798146Z","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-06T22:04:25.853335Z","title":"Lassi: An llm- based automated self-correcting pipeline for translating parallel scientific codes,","venue":null,"work_id":"a110ee86-e5d8-4d49-8fe6-a42d6e555af9","year":2024},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:22.866742Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:cfcb705445c98f67a50efdb30a654a6f9e52997f413cea69cdbd0f53a9a65ef9","observation_id":"0b5932fb-ab39-41f0-b071-89795c234236","resolution":{"observed_at":"2026-08-06T22:04:25.950350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:25.716592Z","title":"Pragformer: data-driven parallel source code classification with trans- formers,","venue":null,"work_id":"084badf3-66e5-45ec-b7b7-a310e1442aea","year":2025},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:22.957196Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:3e5811fb020be73f562f76c5859089824b404759b45d21c52d52a4aba3d8f43f","observation_id":"c5fe0029-eef9-4143-a8de-b0e03406c8da","resolution":{"observed_at":"2026-08-06T22:04:25.797910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:25.615999Z","title":"Advising openmp parallelization via a graph-based approach with transformers,","venue":null,"work_id":"478abf11-8d89-4278-8fcc-c592cb4d0016","year":2023},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.006260Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:10f3244f8d3a665a410cb1fe9bd5bf0688212ce4597b1a6406d3d8e247849d27","observation_id":"f858978b-3b6f-4214-9a21-44a0a75b462f","resolution":{"observed_at":"2026-08-06T22:04:25.658834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:25.469019Z","title":"Cotran: An llm-based code translator using reinforcement learning with feedback from compiler and symbolic execution,","venue":null,"work_id":"ff8fb5ce-ec0e-4d42-bff3-1b5ea798cec2","year":2024},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.118794Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:e9aec05f24d74ab027505a550a9a3a84abefe831458d84cedfc04a0dc199178f","observation_id":"a5b3856b-b879-405d-820b-924d09924921","resolution":{"observed_at":"2026-08-06T22:04:25.508283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:25.290995Z","title":"Detecting data races in openmp with deep learning and large language models,","venue":null,"work_id":"062fe740-c407-4fb3-84ce-39bc3de6885e","year":2024},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.174120Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:75bc966026e344473f058d753add2cfa4ea1870e3338e7e6519a665d1fc57c32","observation_id":"1c7c74da-4171-4e5d-a046-25edc757f094","resolution":{"observed_at":"2026-08-06T22:04:25.384477Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:25.085966Z","title":"Developing an interactive openmp programming book with large language models,","venue":null,"work_id":"d509134a-53c1-4e11-b671-e793ab75202d","year":2024},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.247430Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:07217579e4e6c18fab27e91af784923f7a41292f51143fc8385e21b8701cc7f6","observation_id":"0796065e-ed11-4631-be71-0223c1c15743","resolution":{"observed_at":"2026-08-06T22:04:25.179542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:24.929583Z","title":"An assessment of large language models for openmp-based code parallelization: a user perspective,","venue":null,"work_id":"f3eb17c8-32d2-47ff-8d6c-1504dc8eb41d","year":2024},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.328844Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:544cbde97d29da3228d6f071a4e9e4ebf23e3194deb070efa7bf6b3292454ea5","observation_id":"6d076612-a0f6-49f9-a9ce-6ab8b8beaca3","resolution":{"observed_at":"2026-08-06T22:04:24.982170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:24.721434Z","title":"Gpt-driven source-to-source trans- formation for generating compilable parallel cuda code for nussinov’s algorithm,","venue":null,"work_id":"f4ad20e2-5bf4-4fd1-8a0f-5b83980bdbf1","year":2024},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.371143Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:1bc40ff205b2870395007bf52401f23f32ee26675f7d80772d37d752f88152ec","observation_id":"46d180b0-d6dc-4012-afc2-24fc3ef6b632","resolution":{"observed_at":"2026-08-06T22:04:24.814693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:24.466356Z","title":"Llm-aided compilation for tensor accelerators,","venue":null,"work_id":"94ecfc87-dfbf-40b4-b3d4-0dfb7d1471dd","year":2024},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.487596Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:993ea830e8a16f4aac927dfad6ec05e30fc04110b605e36c17d6b33046456483","observation_id":"9348aa26-daf2-4e9e-9ada-9d9bbda16d23","resolution":{"observed_at":"2026-08-06T22:04:24.597677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.10517","last_updated":"2025-02-14T19:30:53Z","snapshot_observed_at":"2026-08-16T10:36:49.395324Z","submitted_at":"2025-02-14T19:30:53Z","title":"KernelBench: Can LLMs Write Efficient GPU Kernels?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.10517","snapshot_observed_at":"2026-08-06T22:04:23.597645Z","title":"Kernelbench: Can llms write efficient gpu kernels?","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.597645Z"},"links":{"cited_paper":"/paper/2502.10517","citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:bd7a0d4c64529f7bea76c327358ab2b2be2093064e2fe89c3d756f9756cae9e6","observation_id":"81b12a15-36fa-4168-b065-690294fca0b5","resolution":{"observed_at":"2026-08-06T22:04:23.597645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.11460","last_updated":"2025-02-17T05:37:02Z","snapshot_observed_at":"2026-08-16T12:57:52.309928Z","submitted_at":"2025-02-17T05:37:02Z","title":"UnitCoder: Scalable Iterative Code Synthesis with Unit Test Guidance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.11460","snapshot_observed_at":"2026-08-06T22:04:23.671765Z","title":"Unitcoder: Scalable iterative code synthesis with unit test guidance,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.671765Z"},"links":{"cited_paper":"/paper/2502.11460","citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:c1cafc76bb64ef3353b210aceb009a4eb67f9d6f9e53ea9a97691307124e84d0","observation_id":"c0a74950-8627-4e07-a6b6-d5398f2790bd","resolution":{"observed_at":"2026-08-06T22:04:23.671765Z","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":"2502.05310","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T22:04:24.112948Z","title":"Oracular programming: A modu- lar foundation for building llm-enabled software,","venue":null,"work_id":"3e5fd1a1-f647-41f8-9f49-204127026dd0","year":2025},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.776596Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:de85c91af33b6761b99ff610c79bedb6fa38faf9b7359d7b2582c28d22a175f7","observation_id":"3327c3e2-9db7-47d9-8075-8bb0b50984f8","resolution":{"observed_at":"2026-08-06T22:04:24.184610Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-06T22:04:24.351502Z","title":"Intersection repre- sentation of big data networks and triangle counting,","venue":null,"work_id":"c15f6899-2f79-4470-95df-3f33d496d1b1","year":2021},"citing_paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T22:04:23.846745Z"},"links":{"citing_paper":"/paper/2506.22703"},"observation_digest":"sha256:288e6d315bdd5e27771d680f77a4de2906cdf7a8006f9b6048c411b757dd22e4","observation_id":"c35aa60c-3fef-49b7-b9a9-6d970488f731","resolution":{"observed_at":"2026-08-06T22:04:24.410244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.22703","last_updated":"2025-06-28T01:06:34Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-15T05:17:52.816043Z","submitted_at":"2025-06-28T01:06:34Z","title":"P4OMP: Retrieval-Augmented Prompting for OpenMP Parallelism in Serial Code"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":13},"total_outbound_references":18},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2506.22703."}