{"as_of":"2026-08-07T06:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:104255fb4df2e231014439abdd8434f8fd3b0d4b664fcca52789c1ab0d12fe61","coverage":[{"denominator":70,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":70,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T11:55:24.720497Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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.22588/citation-record","integrity":"/paper/2607.22588/integrity","json":"/paper/2607.22588/citation-record.json","paper":"/paper/2607.22588"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.14771","last_updated":"2024-09-23T07:39:01Z","snapshot_observed_at":"2026-08-07T00:29:12.636736Z","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-02T11:55:17.534575Z","title":"Tal Kadosh, Niranjan Hasabnis, Prema Soundararajan, Vy A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:17.534575Z"},"links":{"cited_paper":"/paper/2409.14771","citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:d5e6f60cd67b8149ae1f929e8a2f8ceea48e141f611e44a9307db61425dc93a5","observation_id":"2fe4b56d-d998-43f7-bf3b-575b126d460a","resolution":{"observed_at":"2026-08-02T11:55:17.534575Z","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-08-02T11:55:18.116087Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:18.116087Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:5953f8913f68f0c7f836e04493e1b79c4fa1173ff6f09c16343090087699efcb","observation_id":"5190c8f8-1df2-482f-8c9c-9580430dcdab","resolution":{"observed_at":"2026-08-02T11:55:18.116087Z","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-08-02T11:55:18.296539Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:18.296539Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:184e4234d461ea764ed92467b609afd0576a420829e4a9e747612e9f37e23359","observation_id":"0b223bd6-5af5-4627-80f5-5cc7748656c7","resolution":{"observed_at":"2026-08-02T11:55:18.296539Z","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-08-02T11:55:18.427678Z","title":"If any expected target file cannot be recovered or the extracted content is empty after all tiers, the task is classified as EXTRACT_FAIL","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:18.427678Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:4cc6d0d51b92d18ae6a7bc36c6c06465be4a8ad2b8b116b8a8f4a3ba36c2a783","observation_id":"205de562-cada-42a8-a44d-1e83e3daaa55","resolution":{"observed_at":"2026-08-02T11:55:18.427678Z","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-08-02T11:55:17.688796Z","title":"Elias Konstantinidis and Yiannis Cotronis","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:17.688796Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:88b23c3f92de5496fd37a4cc406071031e65b5c1aadfecf7499a84c641c19559","observation_id":"bb75f3b0-cd6c-4141-9189-1fbc2511cc42","resolution":{"observed_at":"2026-08-02T11:55:17.688796Z","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-08-02T11:55:20.034522Z","title":"Code files are included up to a cumulative 50,000-character limit","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.034522Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:5d954ea29d97830b446abb4d7c61422485efececb9edffff473570c35ab82bbb","observation_id":"17169d96-ea01-42ac-8ad6-158118db3c67","resolution":{"observed_at":"2026-08-02T11:55:20.034522Z","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-08-02T11:55:17.961734Z","title":"This is the highest-confidence tier","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:17.961734Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:e32429041e6477d437ba43e24ec060e9ae2dd25a108907fb209c6e63249a855e","observation_id":"8699f4df-2d4c-4152-b934-380836c30b74","resolution":{"observed_at":"2026-08-02T11:55:17.961734Z","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-08-02T11:55:22.333194Z","title":"H.3 Valid Claims The following conclusions can be drawn from PARBENCHresults when accompanied by the stated conditions:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:22.333194Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:4f6321c5874f727dac030eda2e692f2dc55574f266c65a32673e3946cf8f3338","observation_id":"5c79254e-e438-4bc7-bbb6-f38de146c0ef","resolution":{"observed_at":"2026-08-02T11:55:22.333194Z","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-08-02T11:55:24.720497Z","title":"the model understands parallel programming","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.720497Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:fd500e4cc9424b02e5644bcd6249a01f5863297ed1e60139c8885f550db38bd9","observation_id":"ddaacc60-6a2d-410f-87ef-1d9705e0bb53","resolution":{"observed_at":"2026-08-02T11:55:24.720497Z","resolver_source":null,"status":"malformed_identifier"},"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-08-02T11:55:18.558812Z","title":"While repository- level co-occurrence with CUDA and OpenMP is high, the kernel-level material is insufficient for the multi-direction evaluation design that PARBENCHrequires","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:18.558812Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:f2f923bacfefad0e1070465e74c102eaf08d256c2f49f962cdf2a599ae60a236","observation_id":"cc83510e-8000-410b-ab1f-04986fd49145","resolution":{"observed_at":"2026-08-02T11:55:18.558812Z","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-08-02T11:55:18.736325Z","title":"Including both would provide diminishing returns in programming-model diversity","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:18.736325Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:45d1596c979e76df18129a5e25d0ce8dd524a44c5de564ca59323403e62bd21a","observation_id":"b9ef4701-c0dd-49e3-aa12-8abcdbf0b336","resolution":{"observed_at":"2026-08-02T11:55:18.736325Z","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-08-02T11:55:18.872604Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:18.872604Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:53ca0f2ebff7c9002284963820123e856e086a596313b45006deb7bc92e83a0c","observation_id":"b9100052-8288-4660-a581-451cec8279dd","resolution":{"observed_at":"2026-08-02T11:55:18.872604Z","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-08-02T11:55:18.996248Z","title":"Default GCC and Clang installations support only CPU-threaded OpenMP; GPU offloading requires custom builds with target-offload support enabled","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:18.996248Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:1590973a1be6f5c014c91b0b63c41045c17a25bdd43a1c018aa3a2db91fc01e1","observation_id":"24d85293-f70d-4fa5-b594-5694c4210cf8","resolution":{"observed_at":"2026-08-02T11:55:18.996248Z","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-08-02T11:55:19.089166Z","title":"Within PARBENCH’s curated corpus, OpenMP target implementations are available for 12 kernels: 10 from HeCBench, 1 from XSBench, and 1 from RSBench","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.089166Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:a4c9ba614af6533f4ee91191e236407bdf40343c4b0eae6f265b49e4559c72c3","observation_id":"a90be6c7-16cd-484e-bd65-d97d62d998c0","resolution":{"observed_at":"2026-08-02T11:55:19.089166Z","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-08-02T11:55:19.162112Z","title":"available parallel code","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.162112Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:0b394b4fdaf002780452466fa9ea11bab68270b19d3649a4bbc7c2e87d6c187c","observation_id":"67b7b7f8-f4eb-4916-8139-880110dad00c","resolution":{"observed_at":"2026-08-02T11:55:19.162112Z","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-08-02T11:55:19.237246Z","title":"This is the dominant build-time failure mode for CUDA-targeting directions across all three models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.237246Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:b4ec7ae5b50ea0bb2418a688cad73a69c7bb5c76239526290b0f772f93808187","observation_id":"47b6aebb-5ba2-4c4c-a4c7-e8daf43de173","resolution":{"observed_at":"2026-08-02T11:55:19.237246Z","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-08-02T11:55:19.313659Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.313659Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:63d3cf4b2e2aab94637b8eeeac51836aee10b9a75588e46bc1f9c836eba8e3c5","observation_id":"7848378b-7c4d-4981-9835-212f56aac835","resolution":{"observed_at":"2026-08-02T11:55:19.313659Z","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-08-02T11:55:19.419837Z","title":"CUDA”, “OpenMP","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.419837Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:7c26d189cc4e20ae0229a031674ce5a94b912751499b438d4c34a7fb7abaea49","observation_id":"783e363f-b499-41fd-91c6-3d85247fa567","resolution":{"observed_at":"2026-08-02T11:55:19.419837Z","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-08-02T11:55:19.575344Z","title":"The kernel name and benchmark description arenotincluded (anonymization)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.575344Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:e1dcf6003b09af2e6fd4ed9016800cf0ce27db297d3ef535760c8453cbe54e35","observation_id":"f5d6c1cf-fb8a-425d-a40e-aa50c5c947cc","resolution":{"observed_at":"2026-08-02T11:55:19.575344Z","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-08-02T11:55:19.647006Z","title":"When target infrastructure context is provided, an explanatory note clarifies that only these files replace existing project files","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.647006Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:6e52d4fd3ca4c2975327e39d23c943544bb60c3d87dbf4e3b5fb9d22b1dd14bf","observation_id":"c051e371-4501-4117-b8a2-33da05abd59f","resolution":{"observed_at":"2026-08-02T11:55:19.647006Z","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-08-02T11:55:19.724997Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.724997Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:a7e42763ddb7bdb65f508c487a7f65f048162c8b0a249f8ea9cc614913dc933d","observation_id":"ecf884d8-0bcc-4bbe-b29c-c6eebd40672f","resolution":{"observed_at":"2026-08-02T11:55:19.724997Z","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-08-02T11:55:19.812312Z","title":"CUDA Toolkit ≥ 11.0","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.812312Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:39613d5a38a37b7426959801ffd423b35a6f0f84724b8b8ca4306ebb8e0d8671","observation_id":"c2e0565a-748e-49f7-a874-b3e32af3811d","resolution":{"observed_at":"2026-08-02T11:55:19.812312Z","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-08-02T11:55:19.923648Z","title":"Source Code (CUDA)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:19.923648Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:9faa860300d3db522f1a5dfef90b54da07b0bd2b674d237ca4e0c983b01414c7","observation_id":"fb5c2cfe-0a62-4ba1-b15a-931a11e4344b","resolution":{"observed_at":"2026-08-02T11:55:19.923648Z","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-08-02T11:55:20.149419Z","title":"DO NOT MODIFY – for reference only","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.149419Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:f79c14e3dfa9afc0f4a69df43be767c8607b682eb3aaf931f3498fbdde10bd59","observation_id":"50c466a6-a12f-4ee5-a87e-4e096925aca0","resolution":{"observed_at":"2026-08-02T11:55:20.149419Z","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-08-02T11:55:20.316635Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.316635Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:a17d6b4aa60291f17f04a6d28abf3749eb5fe3d1ced522f0bb3b26a112495462","observation_id":"97f89d0a-ba66-4a58-b86a-33a0cd8b40ac","resolution":{"observed_at":"2026-08-02T11:55:20.316635Z","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-08-02T11:55:20.412215Z","title":"The stripper uses a state-machine parser that preserves string, character, and raw string literals","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.412215Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:6fa1c5c2dfa1e72e19b49a94be6fcb201103da76c5c1652301bf5dfe644096a5","observation_id":"d0910c8a-dded-4550-b00a-9b64078e45a0","resolution":{"observed_at":"2026-08-02T11:55:20.412215Z","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-08-02T11:55:20.486710Z","title":"Support files are labeled Header FileN or Code FileN by extension","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.486710Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:745d1840fa058c3e2cef53e5483bf1dac0fd5d943ff7b7ecce5f9906a6afa21b","observation_id":"feca387b-a762-4fbd-9330-d336caaac09b","resolution":{"observed_at":"2026-08-02T11:55:20.486710Z","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-08-02T11:55:20.566026Z","title":"An internal mapping restores original filenames when writing LLM output to disk, including any cross-file#includereferences the LLM emits using the generic names","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.566026Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:d9aaf80d9fc0edde5eaab80646f15f1fa5e7817e28a14593721e5685f1e8b9a3","observation_id":"948535bc-f413-49d6-8302-a63583b68e24","resolution":{"observed_at":"2026-08-02T11:55:20.566026Z","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-08-02T11:55:20.673751Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.673751Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:ec21a807fb0bd459ae7c1beb9254a553b5ebf4cfe9c7d7330f264187503ea0ed","observation_id":"ad793202-62c2-4a3a-8fce-5cfa7db40b83","resolution":{"observed_at":"2026-08-02T11:55:20.673751Z","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-08-02T11:55:20.746659Z","title":"CUDA”, “OpenMP","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.746659Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:b527da8a29a65bf9efd5892e383f43e1a5f568a6f67ccb76a0b50efd0780a06d","observation_id":"bb4bd823-80a1-4064-9790-c5ee32ff992a","resolution":{"observed_at":"2026-08-02T11:55:20.746659Z","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-08-02T11:55:20.798866Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.798866Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:f1b5ec2af8655a55cc550e391f883c943e0d7524068f75e923fdb9274ddfe7ab","observation_id":"9bbc56c4-4e17-45ab-926e-7e0407095799","resolution":{"observed_at":"2026-08-02T11:55:20.798866Z","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-08-02T11:55:20.863342Z","title":"The evaluation matrix covers 142 unique source–target pairs (Section 2.3)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.863342Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:644792d4b20054dceb170bb1f44d814b8b41565e1c69a4ee01ece10b44dde6c4","observation_id":"f1dad8c2-ce97-425e-9485-0b48e145fb0c","resolution":{"observed_at":"2026-08-02T11:55:20.863342Z","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-08-02T11:55:20.959789Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:20.959789Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:51e4653096d1ab97b33fa647183f4617ac26c1272c0ed135822eec623595ebab","observation_id":"18c7562c-4acb-49ae-afc7-484cc20bba00","resolution":{"observed_at":"2026-08-02T11:55:20.959789Z","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-08-02T11:55:21.070692Z","title":"The augmentation campaign applies only to direction–kernel pairs that qualify under the L0-conditional filter","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.070692Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:5bdd18fc20e6a9df13fba5ecc6fa81ed2cf451c40fdd17d0fb1cccec0faf2864","observation_id":"669e0a64-d1cc-43cb-91ab-68797e3ecb0b","resolution":{"observed_at":"2026-08-02T11:55:21.070692Z","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-08-02T11:55:21.146536Z","title":"CUDA-to-OpenMP consistently passes at higher rates than OpenCL-to-CUDA across all three evaluated models (Section 5.3)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.146536Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:fdc37765cf949796734f53a08df7a16767827043d31e455a9851cb92f95209f0","observation_id":"559f60c4-4c4e-4efa-aa8f-79424fea03ee","resolution":{"observed_at":"2026-08-02T11:55:21.146536Z","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-08-02T11:55:21.221596Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.221596Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:d319aef38cff16fcd25d08bcebc5e688eb12c2ec0f4f7618a3c1684b24416d5d","observation_id":"b61208cf-0c78-42bb-8702-75ff15cbe972","resolution":{"observed_at":"2026-08-02T11:55:21.221596Z","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-08-02T11:55:21.300629Z","title":"H.2 What PARBENCHDoes Not Measure The following properties are explicitly outside PARBENCH’s measurement scope:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.300629Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:adee900a39ad0dd89016cdc58ee869231743979fe03e0d8efd51c2158046afef","observation_id":"8c17564b-7f98-4a60-947a-0603c7c8224f","resolution":{"observed_at":"2026-08-02T11:55:21.300629Z","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-08-02T11:55:21.365909Z","title":"Wall-clock time is captured but is un- reliable for sub-millisecond baselines","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.365909Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:b9d37ad9d4608634ab1892600871e738ea57088569033457c71950e020814227","observation_id":"6a3ec0e3-c06a-40f7-950b-f1af01b73bc0","resolution":{"observed_at":"2026-08-02T11:55:21.365909Z","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-08-02T11:55:21.442146Z","title":"A harness-passing but unreadable translation receives PASS","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.442146Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:d95c15e4a7a7fcfcd7b556945a0cb58fa4a94f6f0c22803591cc59529470cfcf","observation_id":"b0176628-e9ce-42fc-b01b-f744d4b172f6","resolution":{"observed_at":"2026-08-02T11:55:21.442146Z","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-08-02T11:55:21.506820Z","title":"There is no partial-credit classifica- tion","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.506820Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:2fc6ace8a7a9170b8a031d3db68c6ef456bec01bf424acc0c8f13c9fc4adad87","observation_id":"7d267ff2-c598-4c9e-92dd-ad0a996d6407","resolution":{"observed_at":"2026-08-02T11:55:21.506820Z","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-08-02T11:55:21.635694Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.635694Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:8fe0855f63ea71868aa4112e4659d75b7582de02488a70d5518ccff7c1f2c166","observation_id":"60b69df6-87d3-4708-8ce1-694f5841ec82","resolution":{"observed_at":"2026-08-02T11:55:21.635694Z","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-08-02T11:55:21.784948Z","title":"The evaluation pipeline implements iterative repair (multi-turn error feedback with linker analysis via --max-retries), but all reported results use max_retries=1 (zero-shot)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.784948Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:c87b19cb0cea5eb08d332de5986342a1b39bd6517bcb432145d84015941f7eb1","observation_id":"8b932632-295b-4a2f-8979-bcfa44b0dd69","resolution":{"observed_at":"2026-08-02T11:55:21.784948Z","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-08-02T11:55:21.942691Z","title":"No testing on other GPU architectures (A100, H100), CPU-only environments, or other OS configurations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:21.942691Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:fc3beee9217ba205e718768afbbed8d3dabdc4cb3d9e800e024d2a38b98ac080","observation_id":"5b734ac0-448c-4f4f-ba4a-351c89619170","resolution":{"observed_at":"2026-08-02T11:55:21.942691Z","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-08-02T11:55:22.134566Z","title":"Host code, Makefiles, and I/O routines remain fixed","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:22.134566Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:1e48537a198275bf405d4a09e72d40de8d57f609973cc7d7570f939363f3e467","observation_id":"ccf7ce7c-4fed-4e9d-9f65-f3642352f134","resolution":{"observed_at":"2026-08-02T11:55:22.134566Z","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-08-02T11:55:22.488911Z","title":"Model X achieves Y% pass@k on kernel-centric parallel code translation across Z directions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:22.488911Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:286ba90fb496f9d2d576eb53b32149ae11e85c24e6a7dd007ea86aa28b221143","observation_id":"10c2698a-aeb0-4467-9320-de33d45fe7ed","resolution":{"observed_at":"2026-08-02T11:55:22.488911Z","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-08-02T11:55:22.577667Z","title":"Build-stage failure is the dominant failure mode for Model X","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:22.577667Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:864791ffb1f7d221e0d0f7171a3d2a3d88e5333580a5c91e92a25a06b6004f91","observation_id":"e042c835-1c78-4827-98da-753e67ce1366","resolution":{"observed_at":"2026-08-02T11:55:22.577667Z","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-08-02T11:55:22.737640Z","title":"Direction A→B is harder/easier than Direction C→D for Model X","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:22.737640Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:b54f0d9ad09c07d1b7aaffb0c9ae812aa2f21ba59c0b41f2316958f78bfe70cd","observation_id":"eb0e260d-9bd8-4b37-8439-8c09bf1d25ff","resolution":{"observed_at":"2026-08-02T11:55:22.737640Z","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-08-02T11:55:22.834685Z","title":"Model X maintains declared-oracle pass rates across L1–L4 on the L0-conditional subset","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:22.834685Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:c666c8bafa35ca1c71d36796291ed8028768df5bca49a3b6592a0767659ce18d","observation_id":"434f465b-094e-4128-a8a1-5f09e9186f8f","resolution":{"observed_at":"2026-08-02T11:55:22.834685Z","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-08-02T11:55:22.927867Z","title":"Model X discriminates from Model Y on PARBENCH","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:22.927867Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:a204b45eeb2d09d8e20872339aa2f944a1e32b5fd429655f8861d6f112b1cd47","observation_id":"2b5bf37c-b286-4f42-8cc2-e324b1adee29","resolution":{"observed_at":"2026-08-02T11:55:22.927867Z","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-08-02T11:55:22.998703Z","title":"Kernel K is harder to translate than Kernel J","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:22.998703Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:b2b652c1a33fc97588fad6a767687422066b7eb9f323f9b07e7e9926c515b7a4","observation_id":"164624fa-f6c5-483f-b5cd-dfd71d2fa76a","resolution":{"observed_at":"2026-08-02T11:55:22.998703Z","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-08-02T11:55:23.100836Z","title":"Model X produces efficient/fast parallel code","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:23.100836Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:115020f45feff1893bf76715769db47ad15de4ba08bb3fba9161ea80c4bce57b","observation_id":"28bb6ee6-1747-41ac-8f24-19a769ba0aba","resolution":{"observed_at":"2026-08-02T11:55:23.100836Z","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-08-02T11:55:23.166504Z","title":"Model X’s translations are production-ready","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:23.166504Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:55add07f59a80e98d9124b7339235f943f289f28d9c30cc76fc2c9575494064d","observation_id":"74871600-3aaa-479d-a6c0-7f0ab8bb3b36","resolution":{"observed_at":"2026-08-02T11:55:23.166504Z","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-08-02T11:55:23.328548Z","title":"Model X understands parallel programming","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:23.328548Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:9dbb8d6ba89533e27394f0340e07a038e67b66c54281a90d9f47a77a68f648e3","observation_id":"971b2d41-1982-4229-a87a-652b6f68610f","resolution":{"observed_at":"2026-08-02T11:55:23.328548Z","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-08-02T11:55:23.469755Z","title":"PARBENCHpass rate generalizes to all HPC translation tasks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:23.469755Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:0c747b5761a5ca3aee9dcad7be447626392c2e2768008f1019af43c782799ed0","observation_id":"8de83f10-ff34-4457-8129-f72f5e95c3e4","resolution":{"observed_at":"2026-08-02T11:55:23.469755Z","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-08-02T11:55:23.601797Z","title":"Model X is definitively better than Model Y at parallel translation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:23.601797Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:22ca24e1da320c2ca9c529af53a33999fbf6d5bb8695fa9058d0931ae2ae6604","observation_id":"0eb0c4b1-f487-4ca6-802f-c396590896e6","resolution":{"observed_at":"2026-08-02T11:55:23.601797Z","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-08-02T11:55:23.755954Z","title":"Surface-form robustness proves the model is not memorizing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:23.755954Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:83f03151f7bb75613dad3d96c26619c50f50df79f7e4310323ee43af29f12fc6","observation_id":"3cac358f-b1e0-48f7-a1fe-778f85eed179","resolution":{"observed_at":"2026-08-02T11:55:23.755954Z","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-08-02T11:55:23.943815Z","title":"A PASSmeans the translation is numerically faithful","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:23.943815Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:3daee1f2de2819ff65800bcc8b17e70efff4675db4b9982ecc92efb75eb2ff35","observation_id":"343d7832-8109-416a-a967-d0dbae300739","resolution":{"observed_at":"2026-08-02T11:55:23.943815Z","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-08-02T11:55:24.158881Z","title":"OpenCL→CUDA is impossible for LLMs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.158881Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:a28dca86d911413333d638b0e5a7b4d9261afcfa16e1a1475a7292b4e4ca296c","observation_id":"db3428d0-2d76-4a5f-b33d-55e1e43fb5aa","resolution":{"observed_at":"2026-08-02T11:55:24.158881Z","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-08-02T11:55:24.251473Z","title":"If a source implemen- tation has a latent bug, faithful translations of that bug would pass the declared oracle","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.251473Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:cbd2355f49657411103ea8eb6b00b7f10999efe0b3f62cf04f40a9004ff8d3b3","observation_id":"461c9b99-6cb8-4871-94ea-41eb6b3ff6ce","resolution":{"observed_at":"2026-08-02T11:55:24.251473Z","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-08-02T11:55:24.313425Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.313425Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:15bd940eef08093e89869becbaf60b6be49cfa41143478f74e4d48425cf4cbcb","observation_id":"185bbd3c-791d-4249-9479-f7f1ab9f58a4","resolution":{"observed_at":"2026-08-02T11:55:24.313425Z","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-08-02T11:55:24.373518Z","title":"Different GPU architectures may have different compiler behavior, runtime characteristics, or memory limits","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.373518Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:c0176e116d8944ae0b4137859d2d4cb61d940693b0e587f2cd603a9c8e13c0dc","observation_id":"5df7baf1-ae1d-4502-ba25-dcc2111efc92","resolution":{"observed_at":"2026-08-02T11:55:24.373518Z","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-08-02T11:55:24.419476Z","title":"The pass@1-to-pass@3 gap (11.3 pp for Qwen 3.5, 7.0 pp for GPT-5.4, 5.6 pp for GPT-5.3-codex) suggests moderate within-task variance","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.419476Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:1cc08b992f3e1ec03eb4fd9187dd90d79aa90fe129773ea4e500e86bf1464a12","observation_id":"18a2572c-ecc2-44a6-b9b1-3b43ecf3e272","resolution":{"observed_at":"2026-08-02T11:55:24.419476Z","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-08-02T11:55:24.471586Z","title":"ParEval-Repo’s 0% at>133 SLoC Davis et al","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.471586Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:ca11edb0f873d293458484862585453f47dd228f1a74b7f161362ffeb25a516b","observation_id":"77d9061f-1496-4e56-a7a7-40f716bfb7f2","resolution":{"observed_at":"2026-08-02T11:55:24.471586Z","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-08-02T11:55:24.525577Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.525577Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:ddb9cf4ffbee20ecab25c506d68d25ec31797c30e8795fc004e657963b2bb8bd","observation_id":"14570b89-f011-413e-86b9-6e53c70dbff2","resolution":{"observed_at":"2026-08-02T11:55:24.525577Z","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-08-02T11:55:24.592724Z","title":"[2009], HeCBench: 2023 Jin and Vetter [2023], XSBench: ANL Tramm et al","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.592724Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:4335389f4fef02881d8afcc0733ed3b2b8d982fe8e6a64f52fcbd80d789e89a3","observation_id":"a1128190-80b5-463c-9ab8-7f71491ad546","resolution":{"observed_at":"2026-08-02T11:55:24.592724Z","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-08-02T11:55:24.663504Z","title":"80 of 87 specs pass all L1–L4 augmented baseline verification","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:24.663504Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:cb9461606c7cba36020b58db923acd2cb4eb94096f4381f8f45db485a5c251f9","observation_id":"8807c898-22e8-4cbe-a543-193e04205f95","resolution":{"observed_at":"2026-08-02T11:55:24.663504Z","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-08-02T11:55:17.818807Z","title":"ide nt it y","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:17.818807Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:839db8ee7fda955e657e1ce20b30a2d3ec6efe6c00e6f56236ea644829d00c9b","observation_id":"551e368f-295a-48aa-9455-2ed9748943f7","resolution":{"observed_at":"2026-08-02T11:55:17.818807Z","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-08-02T11:55:17.110434Z","title":"ISBN 978-3-031-69576-6","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:17.110434Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:c2399d07611384ce6c2c9ee62da72a280215be34ba4cd9275e4920922f5d0637","observation_id":"561fea2d-8bf6-42db-8d3d-f2efaa613cd4","resolution":{"observed_at":"2026-08-02T11:55:17.110434Z","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-08-02T11:55:17.193540Z","title":"ISBN 9798400720741","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:17.193540Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:3284c097a9fc0f4cf2924e3d06f48ff4be91061218450ff5be1b268022ebb219","observation_id":"afd5e86c-e6e7-4dc2-962a-53077a875bef","resolution":{"observed_at":"2026-08-02T11:55:17.193540Z","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-08-02T11:55:17.376460Z","title":"Carlos E Jimenez, John Yang, Alexander Wettig, Shunyu Yao, Kexin Pei, Ofir Press, and Karthik R Narasimhan","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-02T11:55:17.376460Z"},"links":{"citing_paper":"/paper/2607.22588"},"observation_digest":"sha256:6d6643c740dfd105e1e2d7990a5b893109b2238c6c4b14e63097834520613e4d","observation_id":"215744db-5338-46ae-a023-4dcd22c19d6c","resolution":{"observed_at":"2026-08-02T11:55:17.376460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22588","last_updated":"2026-06-09T19:00:09Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-05T01:47:03.930497Z","submitted_at":"2026-06-09T19:00:09Z","title":"ParBench: A Benchmark for Reliable Evaluation of LLM Parallel Code Translation"},"reference_resolution":{"displayed":70,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":69,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":70},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 70 of 70 outbound references and 0 inbound Pith citation observations for arXiv:2607.22588."}