{"as_of":"2026-08-17T23:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dbd2b26893b23ffbf1c911608db327aad18bcd515e6f0595ef881e093982e956","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T15:49:54.895308Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2509.21886/citation-record","integrity":"/paper/2509.21886/integrity","json":"/paper/2509.21886/citation-record.json","paper":"/paper/2509.21886"},"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-15T15:49:55.686848Z","title":"Iwls 2005 benchmarks","venue":null,"work_id":"bba7635b-331b-46cb-a341-d3aced38c366","year":2005},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.726189Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:2e5428ef050db4b95f8f46d81dee06fe065fcb47d5a61bb45bcc2652f7c1d23e","observation_id":"202382c4-6d34-4a72-b519-04809eecb67d","resolution":{"observed_at":"2026-08-15T15:49:55.690881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.05205","last_updated":"2021-03-09T11:53:06Z","snapshot_observed_at":"2026-08-15T07:10:22.387933Z","submitted_at":"2020-06-09T12:04:50Z","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.05205","snapshot_observed_at":"2026-08-15T15:49:54.730207Z","title":"On the bottleneck of graph neural networks and its practical implications","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.730207Z"},"links":{"cited_paper":"/paper/2006.05205","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:e52e32246ed21adee878e0283d46df8048251c33520f5b722d5830001cc41dae","observation_id":"034800e0-796f-4eab-b8c8-0281221502d7","resolution":{"observed_at":"2026-08-15T15:49:54.730207Z","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-15T15:49:55.675441Z","title":"Btor2 , btormc and boolector3.0","venue":null,"work_id":"2a08704c-1c72-4f45-a5df-01e083525a6f","year":2018},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.734037Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:f9509645b6ec95e75f36cf914b34d2658893a8b83c2b625cdfee480b2be0d634","observation_id":"ec43e429-ba2a-4d83-aa8f-db6274347cca","resolution":{"observed_at":"2026-08-15T15:49:55.679991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:55.663615Z","title":"Notes on the iscas'89 benchmark circuits","venue":null,"work_id":"ef4f4df9-4887-4696-ba24-3401797fe6b9","year":1989},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.739762Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:fe4c081aa65dad9b005267705735a4fe1235e9fb7c675cc044f62135d60d68d1","observation_id":"830d51ad-f2ec-4d9c-b337-7408877a7582","resolution":{"observed_at":"2026-08-15T15:49:55.667812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:55.654007Z","title":"Large circuit models: opportunities and challenges","venue":null,"work_id":"9c9fb7c5-cd43-4a05-a55d-86760cd5f9ce","year":2024},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.743417Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:d25990313b9a92f9587768c1438798ab3ef36ed3a93618f127e0c9a702228135","observation_id":"e854485b-6ec0-451a-b0d6-abd03f31d96b","resolution":{"observed_at":"2026-08-15T15:49:55.657460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:55.643768Z","title":"Rt-level itc'99 benchmarks and first atpg results","venue":null,"work_id":"16a113c3-eac4-4c41-8a01-8aac4a71d0e6","year":2002},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.747156Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:842e3d375cda01801c338afa671fc0b0e7894778a23aea4160378b0472aa2d87","observation_id":"880d741d-ec62-4c53-876d-8d2f0bc4867a","resolution":{"observed_at":"2026-08-15T15:49:55.647387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:55.632241Z","title":"Less is more: Hop-wise graph attention for scalable and generalizable learning on circuits","venue":null,"work_id":"f3e67395-73e8-4bc9-acb1-18b1146751f5","year":2024},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.750983Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:328560ced31004a1c13c997bfe056b3be5a1277fd7f2b6785c096ffdede9a05b","observation_id":"5f6f1b85-5cf1-484e-8cd9-81e532ce5486","resolution":{"observed_at":"2026-08-15T15:49:55.636730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.09260","last_updated":"2025-04-12T15:39:25Z","snapshot_observed_at":"2026-08-17T22:15:44.006091Z","submitted_at":"2025-04-12T15:39:25Z","title":"NetTAG: A Multimodal RTL-and-Layout-Aligned Netlist Foundation Model via Text-Attributed Graph","version":1},"cited_work":{"arxiv_id":"2504.09260","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.09260","snapshot_observed_at":"2026-08-15T15:49:55.455722Z","title":"NetTAG: A Multimodal RTL-and-Layout-Aligned Netlist Foundation Model via Text-Attributed Graph","venue":"cs.AR","work_id":"427a26ba-8faf-418e-a67f-a83680af65fc","year":2025},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.754274Z"},"links":{"cited_paper":"/paper/2504.09260","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:97c2a28545b07f3d1d83c8d07955e46de3b21dcec1a0819086019b58f379cd58","observation_id":"b9c58603-a957-455e-a781-382984dc2075","resolution":{"observed_at":"2026-08-15T15:49:55.459819Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.02168","last_updated":"2025-05-04T16:18:57Z","snapshot_observed_at":"2026-08-17T11:49:32.131247Z","submitted_at":"2025-05-04T16:18:57Z","title":"CircuitFusion: Multimodal Circuit Representation Learning for Agile Chip Design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.02168","snapshot_observed_at":"2026-08-15T15:49:54.757833Z","title":"Circuitfusion: multimodal circuit representation learning for agile chip design","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.757833Z"},"links":{"cited_paper":"/paper/2505.02168","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:8cc07c5335bfc8ba1726f02185f4e4b5705c953f45ea7a44e3a98db379a9af7d","observation_id":"33e207a6-6f6e-49d4-ae3f-2df8f4be29c1","resolution":{"observed_at":"2026-08-15T15:49:54.757833Z","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-15T15:49:55.621261Z","title":"A self-supervised, pre-trained, and cross-stage-aligned circuit encoder provides a foundation for various design tasks","venue":null,"work_id":"c6a68daf-d4b5-4eaf-865d-eca9f76900e9","year":2025},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.761572Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:9a02a7ea82ba7ff7255f918f449c0b90f67f194973c1ae8a8f07791e5acfae0a","observation_id":"8ff79e94-655d-42bf-8e6d-a068ad7c5a18","resolution":{"observed_at":"2026-08-15T15:49:55.625077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:54.764868Z","title":"Neural message passing for quantum chemistry","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.764868Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:cf6ff78b6ec6a38a9087bf6a099f92afd2d04f1beeeb8d7f77b7fd26d6c0627c","observation_id":"6b80435e-2e83-4e4e-b34a-b5ecb45363b3","resolution":{"observed_at":"2026-08-15T15:49:54.764868Z","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-15T15:49:54.768419Z","title":"Inductive representation learning on large graphs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.768419Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:4c5a17ce8564153ed8f6c423343bd15e22daf99142643786337dbc475f1de98e","observation_id":"8acb5829-2d0a-42d6-b922-e08b2ce33a53","resolution":{"observed_at":"2026-08-15T15:49:54.768419Z","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-15T15:49:55.598896Z","title":"Deepseq2: Enhanced sequential circuit learning with disentangled representations","venue":null,"work_id":"de7136a0-3111-498a-91dd-2fe869f8fc68","year":2025},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.771924Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:1fa04da3cbbe3ad4afc4dc0013a63144a4e825d07a7c744eed427716f10bd061","observation_id":"815b2665-da5f-45d9-a596-e3450e877783","resolution":{"observed_at":"2026-08-15T15:49:55.602617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-17T10:49:36.026134Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-15T15:49:54.775895Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.775895Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:aa0022ebe9c2f2c8a3fa7055e2738732c47c643c02019d27c5e1e8025ed517de","observation_id":"a2085d99-46ff-402e-84b1-e1b7c6174e85","resolution":{"observed_at":"2026-08-15T15:49:54.775895Z","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-15T15:49:55.588119Z","title":"Deepgate: Learning neural representations of logic gates","venue":null,"work_id":"e8d2afe5-35b1-4d97-bd6d-802f1d43050b","year":2022},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.779808Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:0a277bb4369d46ceb28d900b8fc4307a0c183dee8bf76b378aac607d0ef94305","observation_id":"52a4f7f9-689d-4991-a503-53bd90d0d188","resolution":{"observed_at":"2026-08-15T15:49:55.591781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:55.576769Z","title":"Deeper insights into graph convolutional networks for semi-supervised learning","venue":null,"work_id":"fdfbcdb1-d132-43ea-be82-adc7fe60bb9c","year":2018},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.787849Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:3f05220c842a30eeac188dd8216facbcd39370bdba6cd179911bb6354ee3b721","observation_id":"5fb624f5-ee17-47c3-90a3-d2fead522dec","resolution":{"observed_at":"2026-08-15T15:49:55.580933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18297","last_updated":"2025-02-25T15:34:00Z","snapshot_observed_at":"2026-08-16T12:55:19.697479Z","submitted_at":"2025-02-25T15:34:00Z","title":"DeepCircuitX: A Comprehensive Repository-Level Dataset for RTL Code Understanding, Generation, and PPA Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18297","snapshot_observed_at":"2026-08-15T15:49:54.791838Z","title":"Deepcircuitx: A comprehensive repository-level dataset for rtl code understanding, generation, and ppa analysis","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.791838Z"},"links":{"cited_paper":"/paper/2502.18297","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:f543988b584aed5ba0eb2690cf8ae6917bc04a1d7306ff4d0d1a183dd2a5923b","observation_id":"4010f224-6c10-435b-834f-7fbc66597163","resolution":{"observed_at":"2026-08-15T15:49:54.791838Z","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-15T15:49:55.564916Z","title":"Polargate: Breaking the functionality representation bottleneck of and-inverter graph neural network","venue":null,"work_id":"bf12c621-e36f-499d-a645-18000a5c788b","year":2024},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.795827Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:48b0e0ece144dbc6c03a916c4ecadce62c05fc155478cdd92057b5e707041d96","observation_id":"2bb3cee0-9bee-4d7e-adfb-de723142e3bb","resolution":{"observed_at":"2026-08-15T15:49:55.569191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:55.554470Z","title":"Ithemal: Accurate, portable and fast basic block throughput estimation using deep neural networks","venue":null,"work_id":"2f37bb54-bcc6-474b-bc3a-bff3489a6988","year":2019},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.800225Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:30afe8dd12d60dc120401dc8a59ed2ee1daa5aded3fb7e18f43599cf0871b899","observation_id":"14a0f3ed-2ecc-479a-a3a4-2060a61ad7e2","resolution":{"observed_at":"2026-08-15T15:49:55.558009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:55.544216Z","title":"Songhori, Shen Wang, Young-Joon Lee, Eric Johnson, Omkar Pathak, Azade Nazi, Jiwoo Pak, Andy Tong, Kavya Srinivasa, Will Hang, Emre Tuncer, Quoc V","venue":null,"work_id":"7198707e-0b7f-4be5-b64b-7b8e70895606","year":2021},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.803499Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:5b8692ec6aab8b96e72fe7986cc0d1524da4d796081e376b2510a99eb0640933","observation_id":"5d37cf39-c994-4443-80b9-fd09d053833d","resolution":{"observed_at":"2026-08-15T15:49:55.548060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-08-14T18:53:38.574749Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-15T15:49:54.806592Z","title":"Representation learning with contrastive predictive coding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.806592Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:4162e00db5dfc8020d8ffb16776e2e5b45cec18cfb91b88c76c9d55f19db8055","observation_id":"b5c3ed3e-b152-4225-bc07-1a53930cab1e","resolution":{"observed_at":"2026-08-15T15:49:54.806592Z","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-15T15:49:54.810188Z","title":"Recipe for a general, powerful, scalable graph transformer","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.810188Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:1207d109dfa8c77e307dee8f4d7e19705e61fa71aada206f65cf7ce45a23c977","observation_id":"5fd0b319-2614-46dc-b322-365737ff6678","resolution":{"observed_at":"2026-08-15T15:49:54.810188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1802.03685","last_updated":"2019-03-12T00:56:48Z","snapshot_observed_at":"2026-08-14T19:47:08.047265Z","submitted_at":"2018-02-11T03:04:28Z","title":"Learning a SAT Solver from Single-Bit Supervision","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.03685","snapshot_observed_at":"2026-08-15T15:49:54.814153Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.814153Z"},"links":{"cited_paper":"/paper/1802.03685","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:55a453a43b40c0661b04aba2e45a8e1a8853c0bc7e8fb5e17136591c9526e807","observation_id":"569eb5ad-5fc4-4c82-b5e7-9c2f0ee13b10","resolution":{"observed_at":"2026-08-15T15:49:54.814153Z","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-15T15:49:55.528055Z","title":"Deepgate2: Functionality-aware circuit representation learning","venue":null,"work_id":"472a6c5b-110b-4d8d-9137-e8c7b8ee6cc7","year":2023},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.818178Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:668a0e224e505d228e00bc4d04c2bda90be98fd32b94eea731fb29b66dc69bf3","observation_id":"6d412aa6-262b-4def-a904-89a1e0555095","resolution":{"observed_at":"2026-08-15T15:49:55.531687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.11095","last_updated":"2024-07-15T02:44:21Z","snapshot_observed_at":"2026-08-16T13:34:18.330359Z","submitted_at":"2024-07-15T02:44:21Z","title":"DeepGate3: Towards Scalable Circuit Representation Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.11095","snapshot_observed_at":"2026-08-15T15:49:54.821843Z","title":"Deepgate3: Towards scalable circuit representation learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.821843Z"},"links":{"cited_paper":"/paper/2407.11095","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:f15bfc6f9f1e9e3495180ed0dc6f4abb01e46c573d7f0ed802de97095f94df25","observation_id":"15fe2906-d76c-4a93-95fa-1292b605dc33","resolution":{"observed_at":"2026-08-15T15:49:54.821843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.02016","last_updated":"2025-05-04T07:35:34Z","snapshot_observed_at":"2026-08-16T17:06:12.458999Z","submitted_at":"2025-05-04T07:35:34Z","title":"ForgeEDA: A Comprehensive Multimodal Dataset for Advancing EDA","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.02016","snapshot_observed_at":"2026-08-15T15:49:54.825555Z","title":"Forgeeda: A comprehensive multimodal dataset for advancing eda","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.825555Z"},"links":{"cited_paper":"/paper/2505.02016","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:d80297c3d4033859936ccb58b8e3e93fb7ca48b9953bd855592fd446fad1efa1","observation_id":"702447d1-3711-4dbc-9dbe-dcc52b7d9067","resolution":{"observed_at":"2026-08-15T15:49:54.825555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06816","last_updated":"2025-07-08T03:25:12Z","snapshot_observed_at":"2026-08-16T00:29:33.491980Z","submitted_at":"2025-02-05T02:39:47Z","title":"DeepCell: Self-Supervised Multiview Fusion for Circuit Representation Learning","version":2},"cited_work":{"arxiv_id":"2502.06816","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.06816","snapshot_observed_at":"2026-08-15T15:49:55.315602Z","title":"DeepCell: Self-Supervised Multiview Fusion for Circuit Representation Learning","venue":"cs.LG","work_id":"2b165677-18a6-44f0-b673-1e921457cef2","year":2025},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.829102Z"},"links":{"cited_paper":"/paper/2502.06816","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:87c81f9219e10414d9d7269f4da50bdbad9dcbc396c9b86a05e3fde9d74edb1b","observation_id":"7ee0ab12-6cfe-4a59-a7ff-9ca1ab82448e","resolution":{"observed_at":"2026-08-15T15:49:55.319811Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1710.10903","last_updated":"2018-02-04T19:13:29Z","snapshot_observed_at":"2026-08-13T22:35:40.714745Z","submitted_at":"2017-10-30T12:41:12Z","title":"Graph Attention Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.10903","snapshot_observed_at":"2026-08-15T15:49:54.833333Z","title":"Graph attention networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.833333Z"},"links":{"cited_paper":"/paper/1710.10903","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:1520c1c2546894a2cc6811a9ee8f8bbd49652d731c222095976ad7165f6f7fbe","observation_id":"456e20c1-d88a-4600-83df-da7ba64812a5","resolution":{"observed_at":"2026-08-15T15:49:54.833333Z","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-15T15:49:54.837672Z","title":"Fgnn2: A powerful pre-training framework for learning the logic functionality of circuits","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.837672Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:c27dd9eb4875b9921e723eb5220f67d9aa0bad7887bb1fcbc4fa4e30e6182594","observation_id":"d9238b82-c7c5-43c8-a714-eec09342e08d","resolution":{"observed_at":"2026-08-15T15:49:54.837672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.12732","last_updated":"2025-02-18T10:48:16Z","snapshot_observed_at":"2026-08-16T12:57:23.211700Z","submitted_at":"2025-02-18T10:48:16Z","title":"Circuit Representation Learning with Masked Gate Modeling and Verilog-AIG Alignment","version":1},"cited_work":{"arxiv_id":"2502.12732","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.12732","snapshot_observed_at":"2026-08-15T15:49:55.289935Z","title":"Circuit Representation Learning with Masked Gate Modeling and Verilog-AIG Alignment","venue":"cs.LG","work_id":"1dac89e8-ac9f-4f4b-9c4e-bc156ac06320","year":2025},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.841637Z"},"links":{"cited_paper":"/paper/2502.12732","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:7c2183754421f93a59d22ca58b20f3eabffc8b9bfab60d99f947f7b80693bf68","observation_id":"a39d8c94-26b1-447f-8de1-ce5b79494103","resolution":{"observed_at":"2026-08-15T15:49:55.295884Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:55.510397Z","title":"Gamora: Graph learning based symbolic reasoning for large-scale boolean networks","venue":null,"work_id":"67d38fcd-2efd-4174-83c8-73ecc1dd8e94","year":2023},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.845720Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:76022ebcdad14e7ecedd3425fa060966e4f7c2aa75302ecc762dc9b06542e601","observation_id":"2db7126c-1aa0-4d16-9280-5b904405fcdf","resolution":{"observed_at":"2026-08-15T15:49:55.514790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2301.09474","last_updated":"2023-05-28T09:19:49Z","snapshot_observed_at":"2026-08-16T16:00:44.202084Z","submitted_at":"2023-01-23T15:18:54Z","title":"DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2301.09474","snapshot_observed_at":"2026-08-15T15:49:54.849790Z","title":"Difformer: Scalable (graph) transformers induced by energy constrained diffusion","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.849790Z"},"links":{"cited_paper":"/paper/2301.09474","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:eec8bee5ab91d5d2793897737c1d4b1c3382182a3f8841d00408153691c1397e","observation_id":"8eb50d34-9a4a-4a86-a95a-8898b3dffb53","resolution":{"observed_at":"2026-08-15T15:49:54.849790Z","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-15T15:49:55.499991Z","title":"Sgformer: Simplifying and empowering transformers for large-graph representations","venue":null,"work_id":"66dad63a-b2f9-4727-b4d6-9ec0f1c94809","year":2023},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.853894Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:44a7fc894b4a7d6498f6bd41d10ad7d576771ac95a15a3dac7d625cc4ee2f310","observation_id":"a9e21cd6-d190-4121-9017-7b0e94ae6871","resolution":{"observed_at":"2026-08-15T15:49:55.503804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-15T15:49:54.857936Z","title":"Preplacement net length and timing estimation by customized graph neural network","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.857936Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:57c09af2fe17b020e2598538063df49f28172083abdc7c8bc89231e19d37d29e","observation_id":"c00ae8d4-7eb5-4bc6-b845-8df5b9cf7740","resolution":{"observed_at":"2026-08-15T15:49:54.857936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00826","last_updated":"2019-02-22T19:15:54Z","snapshot_observed_at":"2026-08-13T05:06:48.606308Z","submitted_at":"2018-10-01T17:11:31Z","title":"How Powerful are Graph Neural Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00826","snapshot_observed_at":"2026-08-15T15:49:54.862302Z","title":"How powerful are graph neural networks? arXiv preprint arXiv:1810.00826, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.862302Z"},"links":{"cited_paper":"/paper/1810.00826","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:045e6134cc7e205f2a606d8ddd3fff774a985b088b514f466ff6f1e33c937a2a","observation_id":"67ba8aa7-2bfd-4149-8aaf-64a4ac498b59","resolution":{"observed_at":"2026-08-15T15:49:54.862302Z","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-15T15:49:54.865942Z","title":"Revisiting semi-supervised learning with graph embeddings","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.865942Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:fdd7a033836ab3cac9d810b810970f1680d198edb2fbfe1bbd7409cb5bde0c4c","observation_id":"0c9e32f9-238d-4d6f-8513-9e17a3d57975","resolution":{"observed_at":"2026-08-15T15:49:54.865942Z","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-15T15:49:54.869466Z","title":"Jiang, Luca Amarú, Alan Mishchenko, and Robert Brayton","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.869466Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:53cd240b7a85ea4294a8c95915068f0ea587f0ca5ec9cf16e97a86cf0cf99113","observation_id":"fea3b9b0-99ea-4800-b43a-d9fe2a731e38","resolution":{"observed_at":"2026-08-15T15:49:54.869466Z","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-15T15:49:54.873289Z","title":"Grannite: Graph neural network inference for transferable power estimation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.873289Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:6059b6d3d904cfda9bd9fc95078efe3ce264a89eedbac202abfebeff198e18f8","observation_id":"4e586337-7551-4364-a532-f651d31123ed","resolution":{"observed_at":"2026-08-15T15:49:54.873289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01681","last_updated":"2025-05-20T08:17:48Z","snapshot_observed_at":"2026-08-17T13:03:48.024800Z","submitted_at":"2025-02-02T05:25:34Z","title":"DeepGate4: Efficient and Effective Representation Learning for Circuit Design at Scale","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.01681","snapshot_observed_at":"2026-08-15T15:49:54.877371Z","title":"Deepgate4: Efficient and effective representation learning for circuit design at scale","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.877371Z"},"links":{"cited_paper":"/paper/2502.01681","citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:6c201de17152dfab389f7b85d974b2db09e5da8d391a394c0597946682b98555","observation_id":"e179754a-cd89-4249-bf7d-642859f73bd1","resolution":{"observed_at":"2026-08-15T15:49:54.877371Z","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-15T15:49:54.880867Z","title":"Rl-mul: Multiplier design optimization with deep reinforcement learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.880867Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:670269f4f00fde0d62a9c52794a3e0783f208b2fc9d52f3b13d7a229c1176a22","observation_id":"38b08067-35be-4c10-bd3c-4288857a99bd","resolution":{"observed_at":"2026-08-15T15:49:54.880867Z","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-15T15:49:54.884048Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.884048Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:81a09df3928199607b36ba9fd45e01e7f778b2f9d141beed64f711959a4a4641","observation_id":"c3f7d647-4e88-4bee-b557-5b7ea80b125e","resolution":{"observed_at":"2026-08-15T15:49:54.884048Z","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-15T15:49:54.887861Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.887861Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:4091d0208e6d227ece833c475baf0ee507763bf6340b1e05268f383eaf450906","observation_id":"c73b6a18-7f1e-444d-8174-01428c784b99","resolution":{"observed_at":"2026-08-15T15:49:54.887861Z","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-15T15:49:54.891824Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.891824Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:a8740b419f7b229b19a29cf8b6e370ea3ce8bcc2a4463e0d2055db8a85892f87","observation_id":"8090e765-812c-4150-8559-a789d2cc6c83","resolution":{"observed_at":"2026-08-15T15:49:54.891824Z","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-15T15:49:54.895308Z","title":"Yet, the dominant paradigm is architecturally mismatched for this task","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs","version":3},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T15:49:54.895308Z"},"links":{"citing_paper":"/paper/2509.21886"},"observation_digest":"sha256:f44cae59333ee7bcd7ed80155a5abb1934662d2cca74e985df824e051bd9db8f","observation_id":"477c15ef-795e-46d8-a63d-46d7481fb062","resolution":{"observed_at":"2026-08-15T15:49:54.895308Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.21886","last_updated":"2026-06-16T04:35:24Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T23:39:24.253567Z","submitted_at":"2025-09-26T05:22:32Z","title":"TRACE: Learning to Compute on Circuit Graphs"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":3,"verified_fuzzy":16},"total_outbound_references":44},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2509.21886."}