{"as_of":"2026-08-13T16:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0173225ad10db4d0b7ab769d36a999075c96283202878eba12dcdb26b5e447f","coverage":[{"denominator":72,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":72,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T15:07:26.658557Z","state":"measured"},{"denominator":73,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":73,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T10:48:11.646826Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-10T10:49:56.214892Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"cited_work":{"arxiv_id":"2507.16808","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.16808","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"bea2f889-46b4-4133-83b3-ada5977457e1","year":2025},"citing_paper":{"arxiv_id":"2604.14989","last_updated":"2026-04-26T15:34:21Z","snapshot_observed_at":"2026-08-13T03:00:13.720822Z","submitted_at":"2026-04-16T13:18:24Z","title":"Dr. RTL: Autonomous Agentic RTL Optimization through Tool-Grounded Self-Improvement","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-10T10:48:11.646826Z"},"links":{"cited_paper":"/paper/2507.16808","citing_paper":"/paper/2604.14989"},"observation_digest":"sha256:42ad9c121bb77f640cdcfd6944d12126f67dc630ffd22f13636040e8f7e4ede9","observation_id":"6e485134-e07b-4016-a66d-c676340cc923","resolution":{"observed_at":"2026-05-10T10:49:56.217726Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.16808/citation-record","integrity":"/paper/2507.16808/integrity","json":"/paper/2507.16808/citation-record.json","paper":"/paper/2507.16808"},"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-06T15:07:37.891737Z","title":"Synthesis of finite state machines: Functional optimization,","venue":null,"work_id":"11bdcf4a-6fe9-4a46-b0cd-3eaf6ef22141","year":1998},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:17.905370Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:793064a1bddd639dd588361388288b1a5a2281f55a1c6e8d23c36b18505ca0e6","observation_id":"c581143b-71d6-43e1-9c9a-584e3674bc56","resolution":{"observed_at":"2026-08-06T15:07:38.037635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:37.578548Z","title":"Villa, T","venue":null,"work_id":"16db4a3d-e9cc-439c-9121-1012478a92a3","year":2012},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:17.965986Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:802ab90b143e406f43b588942727801aba2d43e92c57a3e4d7d1e5fb3338ea5c","observation_id":"ab4cfbba-b4a8-4ee0-9a7e-62bfdce10152","resolution":{"observed_at":"2026-08-06T15:07:37.729524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:37.354642Z","title":"Decomposition of finite state machines for area, delay minimization,","venue":null,"work_id":"bf47acab-b8b7-41d1-ae0a-c96f1787a706","year":1999},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:18.044271Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:928f83b2a79b6cebc10f53cc0b3cb2eaf886af0b38890fba2e02db8b58f266ec","observation_id":"8618379f-e0a7-490d-9c73-469e67b3cd7e","resolution":{"observed_at":"2026-08-06T15:07:37.428007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:37.309898Z","title":"Scaling up superoptimization,","venue":null,"work_id":"65e07646-058b-40b7-b513-d3f73f9e69b5","year":2016},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:18.148329Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:dac0cc59b04b19c78696ae044f7ee77b53a55bffc0db7f475dc322f9b1463e66","observation_id":"29c5388c-5ac9-4260-9871-815a60df54b3","resolution":{"observed_at":"2026-08-06T15:07:37.348038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:37.164908Z","title":"Rtlrewriter: Methodologies for large models aided rtl code optimization,","venue":null,"work_id":"56513308-082c-42f0-8373-7291e1972384","year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:18.254886Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:37e2f085faf71d186155945fda02d9832d865a3fffdae93d92ae30de9629d9b9","observation_id":"27c12038-1f7e-4eb0-9547-2b4d9568d002","resolution":{"observed_at":"2026-08-06T15:07:37.228715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:07:18.350676Z","title":"Symrtlo: Enhancing rtl code optimization with llms and neuron-inspired symbolic reasoning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:18.350676Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:f794ae8b65cff99a78f248da0c1ce211a74b2083a067124dfb7be11870e166ad","observation_id":"5f1061a2-80db-4373-aeb4-9d96bc3109af","resolution":{"observed_at":"2026-08-06T15:07:18.350676Z","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-06T15:07:37.055675Z","title":"Yosys-a free verilog synthesis suite,","venue":null,"work_id":"ac8818c5-24ef-447e-8fac-cee51104752d","year":2013},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:18.458363Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:6e602e0d0df51f483ea6d3daf1f73a9676e00ac20ceb3926e9bddf65046b9344","observation_id":"bfa5bbc5-0379-441d-b1f3-d9cfdce32d4a","resolution":{"observed_at":"2026-08-06T15:07:37.105421Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:36.899724Z","title":"Synthesis of pipelined memory access controllers for streamed data applications on fpga-based computing engines,","venue":null,"work_id":"72d269cb-b159-4703-8fdc-da4f586d321c","year":2001},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:18.552492Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:7c5307f6ae576f02b9a7f01513aec1f6e57b9d26e95687b51612820fdb752396","observation_id":"9acd4c45-2fa8-4ff6-a7d6-df5559ceb014","resolution":{"observed_at":"2026-08-06T15:07:36.982199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:07:18.773654Z","title":"Rtllm: An open-source benchmark for design rtl generation with large language model,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:18.773654Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:d25976a6bf17d8305f09229805dae9af429cca9a293cad9f05ae4b4242711e7a","observation_id":"eba0e969-73a5-4990-ab66-b99bd5ab9b19","resolution":{"observed_at":"2026-08-06T15:07:18.773654Z","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-06T15:07:36.755224Z","title":", design automation for microelectronics, springer handbook of automation,","venue":null,"work_id":"a725e27c-4dbc-4d66-baf1-9a98d1b67ea5","year":2009},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:18.878097Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:56c974115a06bbb54192002258ccf5ec445780097cc70413e3c52580815be124","observation_id":"302b1714-8b04-49b9-9e38-83cb61703127","resolution":{"observed_at":"2026-08-06T15:07:36.824422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:36.703681Z","title":"Sasao, Logic synthesis and optimization","venue":null,"work_id":"076aefbb-329f-45b2-9c70-4515c69b26dc","year":1993},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:18.976900Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:cdf63045a42b08f42c41c83b97228c4ac046d7084972effb578156c58ffaf4dd","observation_id":"17413ed7-41ba-4c18-b6ad-62f90bf469ab","resolution":{"observed_at":"2026-08-06T15:07:36.718780Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:36.544798Z","title":"Rtl coding guidelines for datapath synthesis,","venue":null,"work_id":"81ef2f87-4750-4016-a42b-99cdf50c8cd0","year":2005},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.070459Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:cca82ef0d75d1221d0619db07781506caff0eb36f258e6c960e45eeae51865a1","observation_id":"5f0e264e-2159-4417-a81c-6f13b3fd794a","resolution":{"observed_at":"2026-08-06T15:07:36.627830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:36.379304Z","title":null,"venue":null,"work_id":"fccee527-2524-4edf-a91c-a7a2b3a16978","year":2011},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.159646Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:0ff0e77b5f582be9adb4cb03e2745caec2b4e0cd99bfe0a30b469961a5291a86","observation_id":"819ce00d-6a7d-4160-9000-f342474a8025","resolution":{"observed_at":"2026-08-06T15:07:36.464666Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:36.207495Z","title":"FSM Optimization: KnowHow Tutorial,","venue":null,"work_id":"4e8588fb-203d-40d5-9986-5e8447ce912b","year":2020},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.250326Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:fc4e03a7070a5f9b3de1dbb5603b639364797e38fb4ec358d47f456927fe59ae","observation_id":"ec05d27a-a2db-403a-b6ce-e5b01d0d6a4a","resolution":{"observed_at":"2026-08-06T15:07:36.282680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:35.988767Z","title":null,"venue":null,"work_id":"81683daa-66ab-4716-bd30-f1925891b4f0","year":2023},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.332811Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:429a557e1fd9508b13706f89121ce2d9ea76234fe3b28f581a8a2951782dba45","observation_id":"7e5b59c0-9256-4e77-94f9-cc845274edff","resolution":{"observed_at":"2026-08-06T15:07:36.104895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:35.788596Z","title":"Clock-domain and reset-domain crossing in low-power design,","venue":null,"work_id":"f0474961-5414-4d85-8c5d-bdd085f782e6","year":2014},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.414423Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:d96c6d7be1ce353f615529540bac885452a0435629e7e1c4ccb3f2dcc05355da","observation_id":"5a4bd0ad-f54c-446e-904c-c07fac7db236","resolution":{"observed_at":"2026-08-06T15:07:35.884444Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:35.600435Z","title":"What techniques can be used to reduce power consump- tion in fpgas?","venue":null,"work_id":"0ecb8f56-1d01-4f06-84f5-d02e9a444d83","year":2025},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.491863Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:4b9f93ab7336cafb584ee3d4184d4a93d94c1472ed302acd3d5f2566748797e3","observation_id":"77e73d9e-c5d6-47c4-a1de-06a5375efac9","resolution":{"observed_at":"2026-08-06T15:07:35.683329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:35.478447Z","title":"Unnikrishnan and S","venue":null,"work_id":"e3813c4a-299f-40f6-8700-e249cbf7a83f","year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.564841Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:1413b8c481471242d861377d3de3623e2042604f55317dfc7236e1f53ac2b8db","observation_id":"fe85f98a-17c8-47c7-ad98-ca3f094769b3","resolution":{"observed_at":"2026-08-06T15:07:35.517941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:35.400968Z","title":"Simtam: Generation diversity test programs for fpga simulation tools testing via timing area mutation,","venue":null,"work_id":"03be2e95-6bb2-4601-a2d8-db9339f31175","year":2025},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.671714Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:08dba4cc92635b6cbf5165fc59a3d972c353c5c6342236a5883d0ddc0f001d04","observation_id":"b68ea3c2-f5d2-4c12-ab9c-13da9d7ec98a","resolution":{"observed_at":"2026-08-06T15:07:35.460894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:35.255310Z","title":"A novel hdl code generator for effectively testing fpga logic synthesis compilers,","venue":null,"work_id":"844f512e-a2b6-444a-a800-13cb59fe51ac","year":2025},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.776337Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:f091e0e9eea5653187c855dd4bd1799a73b8cf1573eef2a4f71434454d64dbb7","observation_id":"93e6edd7-0492-447d-943e-1076c569907e","resolution":{"observed_at":"2026-08-06T15:07:35.332196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:07:19.870213Z","title":"Verilogeval: Evaluating large language models for verilog code generation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.870213Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:01cfe14a16a5b513376e29142453ef8d1d8f0f44f57c1f47c31f560afc3f6f96","observation_id":"45f2f676-739b-4c9e-9db8-32e79a5a40c8","resolution":{"observed_at":"2026-08-06T15:07:19.870213Z","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-06T15:07:35.093816Z","title":"Verigen: A large language model for verilog code generation,","venue":null,"work_id":"a2cf0c6f-a2ed-4f29-83bf-d2019597f1ca","year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:19.959938Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:44cbf7a23af076d5c8513ced5445fee70d49d01c47b26a2f64c838b56ef02c22","observation_id":"2c7e9133-4382-4ff2-bc50-b9ac1bba0ebd","resolution":{"observed_at":"2026-08-06T15:07:35.168435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:34.974782Z","title":"Rtlfixer: Automatically fixing rtl syntax errors with large language model,","venue":null,"work_id":"12bf6a43-1f0e-4601-b5e6-5862953a9612","year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.083555Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:a4443e942f407fce58798a43d3b25b4e660e2e53ac57ad1ce231e247ef3b0623","observation_id":"0572e158-658f-40a2-aa6f-712845af5137","resolution":{"observed_at":"2026-08-06T15:07:35.022428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:34.801811Z","title":"Exploiting code symmetries for learning program semantics,","venue":null,"work_id":"c35f2721-5463-4944-8b72-6636cfd0dad9","year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.193303Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:741b36bcea749fa32185489059c1e4547781049366002d01e59aabb7abcbb620","observation_id":"abea3ec1-b345-455f-8b35-f95386ce2db3","resolution":{"observed_at":"2026-08-06T15:07:34.905112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:34.596188Z","title":"Symlm: Predicting function names in stripped binaries via context-sensitive execution-aware code embeddings,","venue":null,"work_id":"c570dca0-3159-41b2-8f38-624d6a4d7e72","year":2022},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.282774Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:9f512a44ff96789e994e5b4dd9d0f6d163bb5ed2ad8908e77673fabe11235156","observation_id":"0f734f93-4496-4df9-a195-b952fe70342f","resolution":{"observed_at":"2026-08-06T15:07:34.687694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-08-13T04:25:38.282910Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-06T15:07:20.380460Z","title":"Code llama: Open foundation models for code,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.380460Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:66f4865c8e720f60850c0d177b8f164531d9f018a10e20a19aafb482605765be","observation_id":"9f31af7a-a03d-40b2-b14f-4be2eedbf6f1","resolution":{"observed_at":"2026-08-06T15:07:20.380460Z","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-06T15:07:34.398522Z","title":"Semantic robustness of models of source code,","venue":null,"work_id":"72b88247-edae-4969-a6cc-2bb5657890a7","year":2022},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.481559Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:76dbce1e6952cd1417ff3f33c3201835776fec80a3ea57060def9a3645739dd0","observation_id":"b6380327-2bc4-4652-91e4-aebd15c4b1d0","resolution":{"observed_at":"2026-08-06T15:07:34.477076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.12575","last_updated":"2024-07-24T07:49:14Z","snapshot_observed_at":"2026-08-13T04:58:10.634748Z","submitted_at":"2023-12-19T20:19:43Z","title":"LLMs Cannot Reliably Identify and Reason About Security Vulnerabilities (Yet?): A Comprehensive Evaluation, Framework, and Benchmarks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.12575","snapshot_observed_at":"2026-08-06T15:07:20.536909Z","title":"Can large language models identify and reason about security vulner- abilities? not yet,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.536909Z"},"links":{"cited_paper":"/paper/2312.12575","citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:488c9845bef5cd8e37fa0c99be8b82411810bdfc941a5e253434d0cb99fda9b6","observation_id":"466ba651-e18b-424e-bade-bc8ad19b0068","resolution":{"observed_at":"2026-08-06T15:07:20.536909Z","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-06T15:07:34.253053Z","title":"Icarus verilog,","venue":null,"work_id":"20fc672d-3802-43d6-90a2-a705c7a4a938","year":2023},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.610372Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:0266d463094879bf292fb3a25b21d808ea03a2f919ed028b125eec8ec36a18c2","observation_id":"521ed3d2-becd-4ce0-8a8d-24bc16936c7f","resolution":{"observed_at":"2026-08-06T15:07:34.314088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15659","last_updated":"2025-08-24T19:32:34Z","snapshot_observed_at":"2026-08-12T07:53:52.685625Z","submitted_at":"2025-04-22T07:32:46Z","title":"VeriCoder: Enhancing LLM-Based RTL Code Generation through Functional Correctness Validation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15659","snapshot_observed_at":"2026-08-06T15:07:20.735913Z","title":"Vericoder: Enhancing llm-based rtl code generation through functional correctness validation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.735913Z"},"links":{"cited_paper":"/paper/2504.15659","citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:d3084fea61f7172f2f3e119ff69faa4d329370b12f8da102685e5cdf12af7f2a","observation_id":"f50cee16-0218-43c9-9f70-fe4571c03012","resolution":{"observed_at":"2026-08-06T15:07:20.735913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.03040","last_updated":"2025-07-21T08:01:59Z","snapshot_observed_at":"2026-08-11T22:57:19.581479Z","submitted_at":"2025-01-06T14:27:41Z","title":"ChronoSense: Exploring Temporal Understanding in Large Language Models with Time Intervals of Events","version":2},"cited_work":{"arxiv_id":"2501.03040","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.03040","snapshot_observed_at":"2026-08-06T15:07:26.787826Z","title":"ChronoSense: Exploring Temporal Understanding in Large Language Models with Time Intervals of Events","venue":"cs.LG","work_id":"b241a172-365f-4578-a551-12adc0e58c3f","year":2025},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.811804Z"},"links":{"cited_paper":"/paper/2501.03040","citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:11f0475728a2a1bd2c5cf26e20661d73d683160f139b47cde942136081e2a596","observation_id":"b362f35e-96c5-4d3e-8e73-ebba3d579835","resolution":{"observed_at":"2026-08-06T15:07:26.896096Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:34.058931Z","title":"Spiking neural networks,","venue":null,"work_id":"f868f0ee-18e5-4210-baf2-ef151fadbe15","year":2009},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:20.909670Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:d9c1fcdeb64e0664e6d23674a61b439d5ce0ac7e9b7e9378b145490c31c1578e","observation_id":"3687721e-4a5f-495c-9c97-a51644a89fd6","resolution":{"observed_at":"2026-08-06T15:07:34.175610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:33.893187Z","title":"Spikingbert: Distilling bert to train spiking language models using implicit differentiation,","venue":null,"work_id":"1246d74b-b589-4976-b60d-868bfc0dd04c","year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:21.026503Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:f9c220fb9cf42bb1a6d654dd91723f57c5c3d046e122855634b925a5baf0930d","observation_id":"dc83a026-b90c-4cc7-91ff-c0d45dd8310c","resolution":{"observed_at":"2026-08-06T15:07:33.978591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T15:07:21.124108Z","title":"Verigen: A large language model for verilog code generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:21.124108Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:b553f6ed55b66268c4dc7a5606c5d3f63bb99309261279f8ff07057c6d1dd041","observation_id":"9de87732-c69c-45ce-81ce-d08ddb0934ec","resolution":{"observed_at":"2026-08-06T15:07:21.124108Z","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-06T15:07:21.215653Z","title":"Rtl- coder: Fully open-source and efficient llm-assisted rtl code generation technique,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:21.215653Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:9750854f3d907335b1f98f7b1b4576fe0970ba9b4437bca2875ce5b40a956bc5","observation_id":"2105d7ba-df90-46a2-b85e-325d411c69ec","resolution":{"observed_at":"2026-08-06T15:07:21.215653Z","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-06T15:07:33.743708Z","title":"Object code optimization,","venue":null,"work_id":"f0542505-3d82-449b-93fc-0545e245d196","year":1969},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:21.318986Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:2302317218070503d8238769a0eb6469eb6eedb4e98efe3805cf0a34c90586a4","observation_id":"be29debd-fb3c-4e93-972c-af2d1dcd7a5a","resolution":{"observed_at":"2026-08-06T15:07:33.831394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.07867","last_updated":"2024-04-26T16:41:55Z","snapshot_observed_at":"2026-08-13T12:43:52.131189Z","submitted_at":"2023-02-15T18:59:21Z","title":"Learning Performance-Improving Code Edits","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.07867","snapshot_observed_at":"2026-08-06T15:07:21.376914Z","title":"Learning performance-improving code edits,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:21.376914Z"},"links":{"cited_paper":"/paper/2302.07867","citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:621aa6094ecaf3141678f568e93b5703918183aceb733e8b3bee932f7f08b5df","observation_id":"dbc077c0-82c1-4ef0-a18e-a5ecb52170f6","resolution":{"observed_at":"2026-08-06T15:07:21.376914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02524","last_updated":"2024-06-27T21:47:48Z","snapshot_observed_at":"2026-08-12T23:33:15.649101Z","submitted_at":"2024-06-27T21:47:48Z","title":"Meta Large Language Model Compiler: Foundation Models of Compiler Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.02524","snapshot_observed_at":"2026-08-06T15:07:21.473542Z","title":"Meta large language model compiler: Founda- tion models of compiler optimization,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:21.473542Z"},"links":{"cited_paper":"/paper/2407.02524","citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:81af83bb37d0120652816acc45bc83f4a478d8503951b5adfb2a2dc7e9f9ed37","observation_id":"1b52234e-666d-4c1a-9004-91f3ef50c256","resolution":{"observed_at":"2026-08-06T15:07:21.473542Z","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-06T15:07:33.617337Z","title":"Egg: Fast and extensible equality saturation,","venue":null,"work_id":"54e66d8c-25df-48e0-9272-cb9ff5129648","year":2021},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:21.632489Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:9695b9b55d015e1eaaf8472c0a911e03ffe71d06515a908026adf59476192406","observation_id":"f76b8ade-385f-4133-8095-000f136bab06","resolution":{"observed_at":"2026-08-06T15:07:33.682515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:33.422261Z","title":"Efficient binary-level coverage analysis,","venue":null,"work_id":"ea2602cb-6bae-4dc1-aafc-6b48f2c636fb","year":2020},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:21.803459Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:43b6251e0cebbf4c83e44fb3857e13572cc5adbdfc604487b12d1efc5b6e5be8","observation_id":"c5006aaa-948e-47ec-9a50-c6171a67bac7","resolution":{"observed_at":"2026-08-06T15:07:33.536473Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:33.257085Z","title":"Simple and effective link-time optimization of modula-3 programs,","venue":null,"work_id":"592f69f2-3689-43b6-b4ed-95b08b65ee90","year":1995},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:22.020980Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:f43d930c31a99b298a8f18af73716786c63e1f17154244112c372bc7e514ae05","observation_id":"160dc0af-90ad-4264-9993-0ef7c82eb2f3","resolution":{"observed_at":"2026-08-06T15:07:33.352944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:33.090290Z","title":"Duplo: a framework for ocaml post-link optimisation,","venue":null,"work_id":"00cf3e06-cc81-4764-b3c4-edd3af9d2be9","year":2020},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:22.180139Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:299dbeb0ad7eec888c85a1371c44224f155559f0e1e7816001c2fedc2065e1a5","observation_id":"4994494e-5550-4987-909f-039f30af125e","resolution":{"observed_at":"2026-08-06T15:07:33.148869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:32.938919Z","title":"Vespa: static pro- filing for binary optimization,","venue":null,"work_id":"776215c0-f34a-4924-87ee-8cba1d026e45","year":2021},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:22.372083Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:1470a5094adc68da287a680e4b6e3e9587cad2d03e54d82cf6c39f223ea381bf","observation_id":"5f9fe4ac-f93c-4b0f-b755-ab81382790b1","resolution":{"observed_at":"2026-08-06T15:07:33.007904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:32.787467Z","title":"Self-refine: Iter- ative refinement with self-feedback,","venue":null,"work_id":"2c43a374-0767-4b37-9426-a1f48da7e8ae","year":2023},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:22.607673Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:1fd6545941304f5bddda741cc379b71994d7f41508f9842175ba22951ab92930","observation_id":"86d02a6a-f479-4828-b89b-c266a741bcc7","resolution":{"observed_at":"2026-08-06T15:07:32.849145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:32.629241Z","title":"Priority sampling of large language models for compilers,","venue":null,"work_id":"b53bbeea-9f13-475d-ab16-b733814a330a","year":2024},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:22.759064Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:739aecdd571adcc56f1767607ed840eb5b32d1585053ca8ef4bd07f0f0ce9857","observation_id":"e57cc4b5-9d03-4e50-bcdc-a2f32042626f","resolution":{"observed_at":"2026-08-06T15:07:32.698801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:32.436837Z","title":"Deepdev-perf: a deep learning-based approach for improving software performance,","venue":null,"work_id":"dc16de69-686c-4577-8df9-54d98fe011a5","year":2022},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:22.982038Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:813fcbd6061bbe107596e3806fe90ce9edc36eee8cfbb3752bdf3b9084c12867","observation_id":"ee663579-27df-4eaa-b16e-3de3d5389b86","resolution":{"observed_at":"2026-08-06T15:07:32.527395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:32.298511Z","title":"New trends and challenges in source code optimization,","venue":null,"work_id":"91eb3a80-f04b-4430-8adf-b708f69bc5c7","year":2015},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:23.166865Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:65c9e1081a054629a03a93ffea44b9300f530309d92b9be86754bb367e6638af","observation_id":"d1cb2a38-3475-4cd7-a540-903dd8deda97","resolution":{"observed_at":"2026-08-06T15:07:32.371961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:32.098798Z","title":"Iterating pointers: Enabling static analysis for loop-based pointers,","venue":null,"work_id":"a347804f-410a-45e3-a261-f992ec7b76d0","year":2025},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:23.371954Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:ce803ced1e4799f725ae17e93ebc188822cc8ece277d226a500d1de6db9d882d","observation_id":"f6bdf296-0f68-43c1-afda-6da0dc011c8f","resolution":{"observed_at":"2026-08-06T15:07:32.214525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:31.952268Z","title":"Contextual dispatch for function specialization,","venue":null,"work_id":"b845a625-eec2-4f19-91d1-394f70ead117","year":2020},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:23.515961Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:420cd3d40d202ccbe76b6fc8b712f8bd38f2ca70e6759e03a566345aa2a14d22","observation_id":"81fe02ba-0ac5-49ab-bbb6-b87cd403021a","resolution":{"observed_at":"2026-08-06T15:07:32.040465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:31.777677Z","title":"Register allocation & spilling via graph coloring,","venue":null,"work_id":"d476e57a-76f3-4dd4-bddb-c6f5301b7ec0","year":1982},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:23.632421Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:f7f10e9f2fb0893cfe20c395853941b34bb9176f85c9f206b4264f381b0272c4","observation_id":"f0174f0b-d22f-4dca-9b4f-5eeef5ddbf44","resolution":{"observed_at":"2026-08-06T15:07:31.844252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:31.620644Z","title":"All you need is superword- level parallelism: systematic control-flow vectorization with slp,","venue":null,"work_id":"7371df23-a3e9-4ef3-b91f-75513dc6572a","year":2022},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:23.811112Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:d9474a2c594fb388315609bf6282b2ecbd739cc4831aa44ec2e0af8d73db1bb2","observation_id":"be61c831-ca04-4007-b6c3-baa21fee6a9c","resolution":{"observed_at":"2026-08-06T15:07:31.670701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:31.449862Z","title":"Loop and data transformations for sparse matrix code,","venue":null,"work_id":"76b02ca9-7897-4467-9efa-fc8b27a64b13","year":2015},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:23.940667Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:6bd4b9b6d7bc8d1a883a0079c58232224f71170dccaf0b49d7528b617a10ab31","observation_id":"e49c7331-edc4-4302-ba53-63399fa54bc8","resolution":{"observed_at":"2026-08-06T15:07:31.515955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:31.281645Z","title":"Optimizing and evaluating transient gradual typing,","venue":null,"work_id":"2e7f6282-1bd9-4fd8-ba74-fc9c91c3c446","year":2019},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:24.056430Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:2bfcedad523c6ba43f305152de6e10662351482bb43ec3a38e5d3b9c9b081118","observation_id":"dc1c301f-0cbf-45bb-be30-2b0804adcb29","resolution":{"observed_at":"2026-08-06T15:07:31.343688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:31.107970Z","title":"Learning compiler pass orders using coreset and normalized value prediction,","venue":null,"work_id":"992f74be-bf52-4a17-b899-f4e868020eb3","year":2023},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:24.402323Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:ced31f1941212c04009265a8706e7f0f1a061f7f0feac706b3e28b1e8e331d47","observation_id":"1a991ee7-ad83-483b-b990-ce4becfd32d0","resolution":{"observed_at":"2026-08-06T15:07:31.158612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:30.931967Z","title":"Programl: A graph-based program representation for data flow analysis and compiler optimizations,","venue":null,"work_id":"887379aa-37ae-48e8-9931-8b250344f5c1","year":2021},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:24.547465Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:d88b42d2d5f5c3a237e9f2b9d210beebdef90756df4d9d713e9ab3016290cc77","observation_id":"46f33b6b-4e0a-43f0-ba30-84e553beca1d","resolution":{"observed_at":"2026-08-06T15:07:30.994996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.01277","last_updated":"2025-01-03T14:55:21Z","snapshot_observed_at":"2026-08-11T05:44:03.107168Z","submitted_at":"2025-01-02T14:20:36Z","title":"Language Models for Code Optimization: Survey, Challenges and Future Directions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.01277","snapshot_observed_at":"2026-08-06T15:07:24.690765Z","title":"Language models for code optimization: Survey, challenges and future directions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:24.690765Z"},"links":{"cited_paper":"/paper/2501.01277","citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:1a64522ea096e8ddc39b7881dc59d97e6738890a8a03d74833f7ce4ba8bf86c1","observation_id":"4ff324cc-8c6b-482c-99da-fe90de8dcfee","resolution":{"observed_at":"2026-08-06T15:07:24.690765Z","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-06T15:07:30.688344Z","title":"A new algorithm for elimination of common subexpressions,","venue":null,"work_id":"162dd646-1d5c-4ea9-91d5-2624d89bea2c","year":1999},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:24.837594Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:6bff3a52ae57f04d703d2810da9724a2911716181a0be6262044d2c6a7bff36b","observation_id":"ab1bc06c-69d2-4a49-97bb-da2c1746c897","resolution":{"observed_at":"2026-08-06T15:07:30.798033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:30.454167Z","title":"Global common subexpression elimination,","venue":null,"work_id":"b04850f7-e834-41af-94f2-0c4fc344a39e","year":1970},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:24.964719Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:b53bb6c381d4b60503305f699cfecd73293675f3c71a23839afe8b78251961ec","observation_id":"068d1b16-9a90-4f82-806b-9ff9edb3b3dc","resolution":{"observed_at":"2026-08-06T15:07:30.535274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:30.221979Z","title":"Constant propagation with condi- tional branches,","venue":null,"work_id":"cf9d9afc-4f5c-4583-94f5-71212b0f3120","year":1991},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:25.093913Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:a43134ad31b1a3025030ddf6a15cc7673d5cc4f2e7cb76db304823031f5932e3","observation_id":"0456d736-241f-42d2-a5cb-96a5ccb270ea","resolution":{"observed_at":"2026-08-06T15:07:30.334985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:30.001219Z","title":"Interprocedural constant propagation: An empirical study,","venue":null,"work_id":"45e781b9-b554-4c07-9ba4-7dd8444f6bd8","year":1993},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:25.187265Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:35cc2f6590396bb8109e44aa05371789339149eff8a0f04c47cfb4c228d1353e","observation_id":"90726f5e-b691-4821-a8db-70e699857a40","resolution":{"observed_at":"2026-08-06T15:07:30.115471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:29.870739Z","title":"Algebraic simplification,","venue":null,"work_id":"533fd382-1ee8-432b-9d43-7e927f99196a","year":1982},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:25.338075Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:e0051c682ace160fe878cc3e547fb5fdb74f4c169d323584ac74be0cfdddf290","observation_id":"f80441ac-fcc2-4df4-bd21-0c1a0cae7112","resolution":{"observed_at":"2026-08-06T15:07:29.919196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:29.677031Z","title":"Understanding expression simplification,","venue":null,"work_id":"66c67ffb-7c69-4651-96ce-396c504de3d4","year":2004},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:25.470949Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:24fec290f3ed895c805dc5f9d68abe6b9bd4440cc2917a2418bf3eb9919f2df2","observation_id":"a285165d-23d9-4040-b4ee-b31a92514b5b","resolution":{"observed_at":"2026-08-06T15:07:29.788121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:29.490436Z","title":"Partial dead code elimination,","venue":null,"work_id":"36422b4c-0919-446f-a6b0-8d12abab36fa","year":1994},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:25.620782Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:9ec794328b8a4065bd1446b616482102b9728973ea93493f6216174e40475d11","observation_id":"f091f347-f1c3-4cdc-971e-37aec7d8c205","resolution":{"observed_at":"2026-08-06T15:07:29.569479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:29.260638Z","title":"Path profile guided partial dead code elimination using predication,","venue":null,"work_id":"801ee557-01dc-4674-9856-40c5d8ce4c7b","year":1997},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:25.738797Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:54984a95ff7791a5f78cf952c9aadb7063c6b00dbe5e6d8ad011da36e8e4b87f","observation_id":"98e495e8-b2d4-471f-b995-0f06a494b495","resolution":{"observed_at":"2026-08-06T15:07:29.372210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:29.126594Z","title":"Operator strength reduction,","venue":null,"work_id":"76e2faf9-f198-49a3-88f7-3cb74bfad8ae","year":2001},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:25.868456Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:d56d59424563820c018b9edae74cce87e28a05b6e317d95735fc893ce74fcc54","observation_id":"302f6af5-b2a9-4742-99cf-d60690d0768d","resolution":{"observed_at":"2026-08-06T15:07:29.183613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:28.678472Z","title":"Register binding and port assignment for multiplexer optimization,","venue":null,"work_id":"c2ca29fb-55b6-4eae-9175-00d85fba49de","year":2004},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:25.987997Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:63f6d26bc7a4ee0a95a9c7e09aa559caf2f474249ec9a66d78e6bf2754d9bafa","observation_id":"479f51c7-457c-4f97-951a-7506e4c832b9","resolution":{"observed_at":"2026-08-06T15:07:29.025881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:28.304333Z","title":"Optimization of multiplexer combination in rtl logic synthesis,","venue":null,"work_id":"c2533ed9-c07b-4c0b-91f6-1ad9eda4317b","year":2023},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:26.080269Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:a540ea91b91464a6ca1a30a7c5374c53081fcead2fd2f87a28406ccac192653e","observation_id":"e7b345c6-c425-4e94-bc35-8fa7bb71b284","resolution":{"observed_at":"2026-08-06T15:07:28.467267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:28.063988Z","title":"Reduction of multiplexer trees using modified lookup table","venue":null,"work_id":"564bcc26-f3a6-49de-bbc0-af16afae758e","year":null},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:26.222504Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:342716d1c0b6d0251b2845e89702ac623b61ddcac21df4da8d330c5b530068a4","observation_id":"dca62ba7-54a9-401b-9de6-c98dbb2cda88","resolution":{"observed_at":"2026-08-06T15:07:28.171264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:27.847187Z","title":"Efficient multi-ported memories for fpgas,","venue":null,"work_id":"2e29ff7e-b3c1-4034-971e-10fa04e38735","year":2010},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:26.336642Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:c6c6b3c48b022f69d2efd229aeef4811f8ce0c3c3a97edb8a7fb7e0f5b019b43","observation_id":"204ebbdd-a7c4-4286-9c70-2b5a7e8b7ce8","resolution":{"observed_at":"2026-08-06T15:07:27.951652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:27.567728Z","title":"A hypervisor for shared-memory fpga platforms,","venue":null,"work_id":"57bc2896-9764-42ab-948b-4fd0d01dbd9c","year":2020},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:26.450215Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:4666af593b85d6e6b29535a105503f252e430e7cb86e01916b04eaa41bd5e665","observation_id":"2ac35108-cf8a-47ed-9019-5b6a667c73d9","resolution":{"observed_at":"2026-08-06T15:07:27.694831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:27.306339Z","title":"A new approach to automatic memory banking using trace-based address mining,","venue":null,"work_id":"28c53989-fd1c-497d-8f40-e10408ddfcc9","year":2017},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:26.598968Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:5ba8917f09872538f396dbb41ada8ff5f9f764473422d00568505077920c977a","observation_id":"f25fa528-94ab-4799-914b-52fb0e12a014","resolution":{"observed_at":"2026-08-06T15:07:27.391592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06T15:07:27.112668Z","title":"Remap+: An effi- cient banking architecture for multiple writes of algorithmic memory,","venue":null,"work_id":"6db5d87c-68e2-4f7b-a6d2-b298d52c6bea","year":2019},"citing_paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-06T15:07:26.658557Z"},"links":{"citing_paper":"/paper/2507.16808"},"observation_digest":"sha256:223111d049768e5cb929e4b6200784b6b27825e824f7c50af73830b5e3f600b4","observation_id":"cc87bebd-3792-463b-a943-8b4e95654c3e","resolution":{"observed_at":"2026-08-06T15:07:27.204439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.16808","last_updated":"2025-07-22T17:57:02Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-10T01:13:14.652631Z","submitted_at":"2025-07-22T17:57:02Z","title":"Rethinking LLM-Based RTL Code Optimization Via Timing Logic Metamorphosis"},"reference_resolution":{"displayed":72,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":1,"verified_fuzzy":58},"total_outbound_references":72},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 72 of 72 outbound references and 1 inbound Pith citation observation for arXiv:2507.16808."}