{"as_of":"2026-08-17T01:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dfdc1524d9285f20863bbecebc9318de671ee7f13019e3397c2b07452f366f67","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T21:41:07.252699Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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-06-27T14:01:20.999336Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-03T04:17:37.550302Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"cited_work":{"arxiv_id":"2602.19330","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.19330","snapshot_observed_at":"2026-07-03T04:17:37.550302Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","venue":"cs.LG","work_id":"ade47df0-daed-4dae-8296-24e2523fa134","year":2026},"citing_paper":{"arxiv_id":"2606.11348","last_updated":"2026-06-09T18:25:38Z","snapshot_observed_at":"2026-08-11T17:58:33.793690Z","submitted_at":"2026-06-09T18:25:38Z","title":"SwiftCTS: Fast Cross-Design Prediction and Pareto Optimization of Clock Tree Metrics via Few-Shot Calibration","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T14:01:20.999336Z"},"links":{"cited_paper":"/paper/2602.19330","citing_paper":"/paper/2606.11348"},"observation_digest":"sha256:7599fe6d8835cf6b521cb1fc38563f52519a600e7a8bd5138acb2972b911582f","observation_id":"c7053ae0-57d0-418d-be14-66e66ca9f119","resolution":{"observed_at":"2026-07-03T04:17:37.551583Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.19330/citation-record","integrity":"/paper/2602.19330/integrity","json":"/paper/2602.19330/citation-record.json","paper":"/paper/2602.19330"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:41:04.555281Z","title":"Cheng, Vidya A","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:04.555281Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:76fa673ed311aad2180bea72562d111289ae43a2b84b1218d734ac559b1d7bc1","observation_id":"3fd05959-f741-434f-b2b9-b83bed2c2fb7","resolution":{"observed_at":"2026-08-02T21:41:04.555281Z","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-02T21:41:04.623493Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:04.623493Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:cf08721eae278013ca9577108f13eeca2e49277d2d0de508c8361816fa999554","observation_id":"c8548ace-4eed-48ae-8a62-4aa2a8bae2df","resolution":{"observed_at":"2026-08-02T21:41:04.623493Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.14491","last_updated":"2022-01-31T07:20:20Z","snapshot_observed_at":"2026-07-06T11:14:04.454155Z","submitted_at":"2021-05-30T10:17:58Z","title":"How Attentive are Graph Attention Networks?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.14491","snapshot_observed_at":"2026-08-02T21:41:04.760888Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:04.760888Z"},"links":{"cited_paper":"/paper/2105.14491","citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:9433eafca0d12793976cdbeecd43364446fb218d27e624dd4f0a38c32f5ef901","observation_id":"01ff1c2b-0e93-4e72-bd7f-625b01e14987","resolution":{"observed_at":"2026-08-02T21:41:04.760888Z","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-02T21:41:04.883105Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:04.883105Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:040bedff0a522538403bf8f3eae885362c7e29c99ef2a9a1269f29b2276c7d3c","observation_id":"af2b98e0-bf2b-436d-9705-e47a467b4421","resolution":{"observed_at":"2026-08-02T21:41:04.883105Z","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-02T21:41:04.999455Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:04.999455Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:69f01e94c2f1d9b89bf871ec8fc03f44912af2dd11f9f718924a468d90aecfff","observation_id":"2e959771-5aa5-4cfa-849b-ec5e04b10e7c","resolution":{"observed_at":"2026-08-02T21:41:04.999455Z","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-02T21:41:05.087442Z","title":"Joshi, Anh Tuan Luu, Thomas Laurent, Yoshua Bengio, and Xavier Bresson","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:05.087442Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:f5ad6532e91498268c9304db203dde13668addc420bc0b1c5543c0431d1449d5","observation_id":"6730f5c9-ac24-42bc-a0e4-af4cf5787033","resolution":{"observed_at":"2026-08-02T21:41:05.087442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.08164","last_updated":"2023-11-28T06:17:30Z","snapshot_observed_at":"2026-08-16T19:01:23.375930Z","submitted_at":"2022-06-16T13:33:22Z","title":"Long Range Graph Benchmark","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.08164","snapshot_observed_at":"2026-08-02T21:41:05.209502Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:05.209502Z"},"links":{"cited_paper":"/paper/2206.08164","citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:b89d3443ceddfe439bb4518341c9669b8f634c5fa4ae33a4ca327827c3ebc773","observation_id":"d765a52c-bfc8-477b-8842-8ee4ecdb15bd","resolution":{"observed_at":"2026-08-02T21:41:05.209502Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.02216","last_updated":"2018-09-10T14:26:58Z","snapshot_observed_at":"2026-08-16T10:46:47.387624Z","submitted_at":"2017-06-07T14:51:05Z","title":"Inductive Representation Learning on Large Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.02216","snapshot_observed_at":"2026-08-02T21:41:05.369614Z","title":"Hamilton, Rex Ying, and Jure Leskovec","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:05.369614Z"},"links":{"cited_paper":"/paper/1706.02216","citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:cee36dd0f407689a5c4c869cf7ce8e413b54de1cd26aa1485c53efa7a59edd61","observation_id":"6195c263-d788-4651-9bd9-4b0cc11bcc7f","resolution":{"observed_at":"2026-08-02T21:41:05.369614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00687","last_updated":"2021-02-25T02:06:27Z","snapshot_observed_at":"2026-08-16T13:28:09.232356Z","submitted_at":"2020-05-02T03:09:50Z","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00687","snapshot_observed_at":"2026-08-02T21:41:05.520058Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:05.520058Z"},"links":{"cited_paper":"/paper/2005.00687","citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:80159e7adfd18b35ca1ca3fc790f507483bc9ab51356cfda0eea70318f4f2fdd","observation_id":"e34aa49d-df5f-4a42-99e7-256370da68de","resolution":{"observed_at":"2026-08-02T21:41:05.520058Z","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-02T21:41:05.678275Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:05.678275Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:700946077bb23bbaa80782cea54cb86fdc467ca5bfdfe081dbdbe2dba302cebb","observation_id":"877f9388-c854-4f3e-80b3-63a2a0fe8ac6","resolution":{"observed_at":"2026-08-02T21:41:05.678275Z","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-02T21:41:05.846705Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:05.846705Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:becd17ef6451fab0052c4e0226a36069ad272cb97e495fae9d8815d71f210d7b","observation_id":"b1c0f8e1-23b7-4c5a-88c2-b0362660ad5a","resolution":{"observed_at":"2026-08-02T21:41:05.846705Z","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-02T21:41:05.990559Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:05.990559Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:7b4e72adc9498810dcdb85084209b23e835359e30f1efc6716d7def503ad3259","observation_id":"f0027b7f-56df-48f9-9edd-72be3409c395","resolution":{"observed_at":"2026-08-02T21:41:05.990559Z","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-02T21:41:06.182961Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.182961Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:bb3f90a35a4a60424bdd6079e2206e0bee97d392a18d6953517a0ae05fb82569","observation_id":"6cc3be11-0220-4285-89fd-453444f8446f","resolution":{"observed_at":"2026-08-02T21:41:06.182961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-13T11:38:10.906031Z","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-02T21:41:06.334757Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.334757Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:888a963e862c22a599fa7f08c6382ae22996a41fea936f00755009a852eb1852","observation_id":"5d33d9d4-9cc9-4978-8b07-5d810a7bfae0","resolution":{"observed_at":"2026-08-02T21:41:06.334757Z","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-02T21:41:06.470236Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.470236Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:aa59a7d48c9d6e4d14acd0d8a02543d5ce646a6d9982cd3ce384776ba4383e6c","observation_id":"01cb67ca-c96c-4b4a-a6d3-5c34def2e233","resolution":{"observed_at":"2026-08-02T21:41:06.470236Z","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-02T21:41:06.533314Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.533314Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:704961d81ae344bb32dcd53718dfdef264295998b3549bc01b54c1d855302398","observation_id":"370fa947-8908-43b0-8609-cfaec91fa93f","resolution":{"observed_at":"2026-08-02T21:41:06.533314Z","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-02T21:41:06.688423Z","title":"Alpert, Paul Villarrubia, Bruce Winter, and Mehmet Yildiz","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.688423Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:1ca2bb95275084905ad108a0bfb39cb6a8b48a21f1c0a45d6041947ddc79a900","observation_id":"574e5299-fbcb-4e5e-8b75-c2257d5e9a54","resolution":{"observed_at":"2026-08-02T21:41:06.688423Z","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-02T21:41:06.773379Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.773379Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:d3273b1f688384c34ba7e1e796f438b559242a6ca28a7de27bde82c04ccf650b","observation_id":"2a40eeeb-9320-4123-8944-3ef80c942001","resolution":{"observed_at":"2026-08-02T21:41:06.773379Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:41:06.826099Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.826099Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:51d0035ba637672e59e605365791dcc312425690c7749e4d15bc5cca3d83d384","observation_id":"9297ce39-62a5-490f-912f-3c21fa56ae13","resolution":{"observed_at":"2026-08-02T21:41:06.826099Z","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-02T21:41:06.919262Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.919262Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:15c2cd8a04a03121a61a51b232c6177499da5d87d125e81baf0e28cf1b11324d","observation_id":"e94615a6-2b0b-44dd-8edb-8ea394bd438c","resolution":{"observed_at":"2026-08-02T21:41:06.919262Z","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-02T21:41:07.065135Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:07.065135Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:1eda431de2e1929cae0686f3f9a5c73560803ad4d14e8595b31d30dc95fa00ad","observation_id":"08260199-21da-435d-9690-6daf867df742","resolution":{"observed_at":"2026-08-02T21:41:07.065135Z","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-02T21:41:07.140444Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:07.140444Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:7ea1ec631f6b220d9c8770ac8897d13d54ad685822f78404330d19745eaa775a","observation_id":"420a6bbc-e803-4c7d-947c-d983a40a713d","resolution":{"observed_at":"2026-08-02T21:41:07.140444Z","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-02T21:41:07.252699Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:07.252699Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:483147f871802518c8e9e35a12302d7711bd0008dfe894cff96106f6607ad3f3","observation_id":"ec8128c4-d138-451a-ae6f-27227eaa4bf1","resolution":{"observed_at":"2026-08-02T21:41:07.252699Z","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-02T21:41:06.620307Z","title":"doi:10.1038/s41586-021-03544-w","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.620307Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:74740b9956f8ad474a082a282ac52e626e04565978704c25e2aaaf4d0c36046c","observation_id":"c76111f3-29bd-40d9-a1c8-16e4197f7c31","resolution":{"observed_at":"2026-08-02T21:41:06.620307Z","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-02T21:41:06.063637Z","title":"InThe Twelfth International Conference on Learning Representations","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T21:41:06.063637Z"},"links":{"citing_paper":"/paper/2602.19330"},"observation_digest":"sha256:29fa114e5a06efa9a9ed73ba6967a8c6b225af6d8f7d69cfaf3e6e049deb2409","observation_id":"3de9845a-e161-4663-b334-1364507209cb","resolution":{"observed_at":"2026-08-02T21:41:06.063637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.19330","last_updated":"2026-06-07T16:19:55Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T10:48:14.415815Z","submitted_at":"2026-02-22T20:29:30Z","title":"CTS-Bench: Benchmarking Graph Coarsening Trade-offs for GNNs in Clock Tree Synthesis"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2602.19330."}