{"as_of":"2026-08-17T20:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6b45ebe61bcaf18a0cb1215a472f352045d898a1944b04c560ad28575237481","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-07T21:56:30.835828Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T15:24:40.807434Z","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-16T14:41:02.263421Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"cited_work":{"arxiv_id":"2502.09344","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.09344","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Revisiting topological interference management: A learning-to-code on graphs perspective","venue":null,"work_id":"2a8dd5c7-a910-4b1e-9ada-7d5ba77356bc","year":2025},"citing_paper":{"arxiv_id":"2601.10175","last_updated":"2026-05-07T14:13:19Z","snapshot_observed_at":"2026-08-16T04:48:02.168135Z","submitted_at":"2026-01-15T08:28:21Z","title":"A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-16T14:40:39.112184Z"},"links":{"cited_paper":"/paper/2502.09344","citing_paper":"/paper/2601.10175"},"observation_digest":"sha256:6eaa9411ca4e1d9a8fc0f5ed61786226bac81714b735a722596072ba16c860b0","observation_id":"d7b881be-a08a-4f3e-b8e3-189065dcfcf9","resolution":{"observed_at":"2026-05-16T14:41:02.265854Z","resolver_source":"arxiv_id","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":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.09344","snapshot_observed_at":"2026-08-01T15:24:40.807434Z","title":"Revisiting topological interference management: A learning-to-code on graphs perspective,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18480","last_updated":"2026-07-20T19:57:38Z","snapshot_observed_at":"2026-08-15T12:12:25.011557Z","submitted_at":"2026-07-20T19:57:38Z","title":"Long-Horizon Wireless Link Scheduling with State-Augmented Graph Neural Networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T15:24:40.807434Z"},"links":{"cited_paper":"/paper/2502.09344","citing_paper":"/paper/2607.18480"},"observation_digest":"sha256:fd0cdaf5ae344e25a257ec4a20df0349737f056eb2703790943ffd9baf6e4d36","observation_id":"e7d1f2ab-6c22-4ebf-90c7-07afa1760310","resolution":{"observed_at":"2026-08-01T15:24:40.807434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.09344/citation-record","integrity":"/paper/2502.09344/integrity","json":"/paper/2502.09344/citation-record.json","paper":"/paper/2502.09344"},"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-07T21:56:31.543320Z","title":"Learning to code on graphs for topological interference management,","venue":null,"work_id":"d9212096-eb4f-4f7f-98bd-ecc8d8acc647","year":2023},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.627908Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:656dc6203b206107b0fc5bfebedf91affe2b81d1c4ff3ef438c2c9079324657e","observation_id":"a58b0648-ec40-4cbd-96a9-ec6fad4d7086","resolution":{"observed_at":"2026-08-07T21:56:31.548400Z","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-07T21:56:31.527794Z","title":"Topological interference management through index cod- ing,","venue":null,"work_id":"42777fa7-5e41-4289-a5a5-c33e6493ccdb","year":2013},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.633462Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:3d31b8f3a82d07c2c3b7e7679cc3aaaa088e04a300c85e7971313a01a7f871d1","observation_id":"b4e0c690-2916-43d7-a736-f8b57ae655ab","resolution":{"observed_at":"2026-08-07T21:56:31.532726Z","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-07T21:56:31.512745Z","title":"Topological interference management with alternating connectivity,","venue":null,"work_id":"b3464a52-6d9d-4792-afc4-540b6f2e2b0d","year":2013},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.638385Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:49abb981aed156fa21ad9a8cff4e6a7a6551df86e3c37b9b6f276324ffe47a5d","observation_id":"5ba00017-41e5-4d34-999c-b6a280465b3f","resolution":{"observed_at":"2026-08-07T21:56:31.517737Z","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":"1310.2385","last_updated":"2013-10-09T08:05:17Z","snapshot_observed_at":"2026-08-15T16:57:55.740337Z","submitted_at":"2013-10-09T08:05:17Z","title":"Topological Interference Management with Alternating Connectivity: The Wyner-Type Three User Interference Channel","version":1},"cited_work":{"arxiv_id":"1310.2385","doi":null,"metadata_source":"pith","pith_arxiv_id":"1310.2385","snapshot_observed_at":"2026-08-07T21:56:30.894621Z","title":"Topological Interference Management with Alternating Connectivity: The Wyner-Type Three User Interference Channel","venue":"cs.IT","work_id":"e9845c0d-f0d5-492b-8cb8-c61c7d01b5a6","year":2013},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.643373Z"},"links":{"cited_paper":"/paper/1310.2385","citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:457a66e3456fe6d8d381d1eacc94bdb021a32b9c08e1eea1535dfcb63d979282","observation_id":"dfba1d6a-7c5d-4dae-b68c-70379c6578bb","resolution":{"observed_at":"2026-08-07T21:56:30.901989Z","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-07T21:56:31.497639Z","title":"Multilevel topological interference management: A TIM-TIN perspective,","venue":null,"work_id":"763580e9-f2db-4974-a0d7-ae76fb8399d5","year":2021},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.648974Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:9388f5b825a466f2c8e0087692a605a8150f247f5a9221abafcafbf85bb2879e","observation_id":"f56017f7-0ec4-4974-9890-1afd0bf1a0a3","resolution":{"observed_at":"2026-08-07T21:56:31.502529Z","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-07T21:56:31.482277Z","title":"Topological interference management with multiple antennas,","venue":null,"work_id":"2380b370-ad99-4503-821a-971fb9584ec0","year":2014},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.653972Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:3161c56681ba6e7c541d56d012dd4609f584eb7e287f46ad46a7a9f9630b7166","observation_id":"166423ac-c22b-4a48-b3cf-7de47507bd3c","resolution":{"observed_at":"2026-08-07T21:56:31.487172Z","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-07T21:56:31.466417Z","title":"Topological interference management with transmitter cooperation,","venue":null,"work_id":"99fb3f06-ee14-4059-92d1-7b94cc8cadac","year":2015},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.659339Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:cb1e8a72401e9f5f07e52b904d076a55621f28cfa10475ec3eac33fff8ca0e26","observation_id":"c8109d22-4c6f-45c5-a1a7-abf6243dc69a","resolution":{"observed_at":"2026-08-07T21:56:31.471432Z","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-07T21:56:31.451243Z","title":"Topological interference management with decoded message passing,","venue":null,"work_id":"d7628d4a-6f9d-4e0f-8b86-fa0609bac7a9","year":2018},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.664004Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:f210f870e24c8e7fef3620e9fcf247fd78b13508c4a4004401061e0a9a8becaf","observation_id":"0ec30454-e7ec-4e60-872a-746fd8597c97","resolution":{"observed_at":"2026-08-07T21:56:31.456248Z","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-07T21:56:31.435539Z","title":"Opportunistic topological interference management,","venue":null,"work_id":"4aa9675b-3f70-41be-bc03-2e2f4e596584","year":2019},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.668712Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:7ee87e0c65d1c931e993c04b28b100d66ff0a44bbefd38cb06c6de3928262cee","observation_id":"b4720697-42be-4213-89bc-b593d8496965","resolution":{"observed_at":"2026-08-07T21:56:31.440756Z","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-07T21:56:31.420463Z","title":"Topological interference manage- ment with adversarial topology perturbation: An algorithmic perspec- tive,","venue":null,"work_id":"34d4adf7-612f-4ee0-a849-bb916cf14068","year":2022},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.673796Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:d1a46713c14fd9e51159e8ea65797f54348f26b2e9c1f1c0223d9839c6b9809f","observation_id":"f44a51d9-a1ad-4a07-92c0-d8349312be3a","resolution":{"observed_at":"2026-08-07T21:56:31.425544Z","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-07T21:56:31.404671Z","title":"Optimality of orthogonal access for one- dimensional convex cellular networks,","venue":null,"work_id":"562e17a5-8d96-407b-a6c8-7115b22cc279","year":2013},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.678667Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:63514dad507a76f48dceec6c2bd6029c6a0d3472f31b8d9f19c1e8c82e53a399","observation_id":"15efb3e4-99b8-4d3c-8bcc-acfec3679912","resolution":{"observed_at":"2026-08-07T21:56:31.409803Z","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-07T21:56:31.389178Z","title":"TDMA is optimal for all- unicast DoF region of TIM if and only if topology is chordal bipartite,","venue":null,"work_id":"23361891-9dde-4553-a529-25e6cd41ad44","year":2018},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.683497Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:e78924f05dfe59ccde99875991758f06498644ad36790ecd024c801580a8b4e9","observation_id":"38305886-892e-495a-8791-eda36c76820b","resolution":{"observed_at":"2026-08-07T21:56:31.394175Z","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-07T21:56:31.373735Z","title":"A framework of topological interference management and clustering for D2D networks,","venue":null,"work_id":"18cea03c-5568-46e5-960f-e379d676cbf4","year":2019},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.688632Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:c0d4e94808925a96c11c401139025d9ac703f340df532e7f7736e8b96dbebd63","observation_id":"b263c1a9-a8e0-4351-938d-bab8f5a14463","resolution":{"observed_at":"2026-08-07T21:56:31.378786Z","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-07T21:56:31.358421Z","title":"Network coherence time mat- ters—aligned image sets and the degrees of freedom of interference networks with finite precision CSIT and perfect CSIR,","venue":null,"work_id":"77ff30cd-71ee-42f4-b815-3f59c752ad45","year":2018},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.693305Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:81d732adc6dddd3b650d31c26ad86186ec37931a4644bd109a52b1d617aec8d0","observation_id":"ed1fdb5f-3314-4deb-bc82-225e910ebb9e","resolution":{"observed_at":"2026-08-07T21:56:31.363609Z","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-07T21:56:31.343185Z","title":"Topological interference management with reconfigurable antennas,","venue":null,"work_id":"ed7af30d-ca49-4642-8f5d-4b9f427902d7","year":2017},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.697975Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:7ff4eab063cea05091c3b2342d67e096edcdf9cdc2715cfd81387b58fd1e9d88","observation_id":"34f5235a-d6a6-4907-9eb2-dd98df6925c3","resolution":{"observed_at":"2026-08-07T21:56:31.348128Z","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-07T21:56:31.327598Z","title":"On the degrees of freedom of interference broadcast channels with topological interference management,","venue":null,"work_id":"69f5eebe-a312-4cf7-89f3-867f788c29ec","year":2016},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.702629Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:86d86db222b7d5f635f2a3203cb8cf1778e384afd357ade663030a37fc209a32","observation_id":"f643948e-d425-4370-8c49-5086a5c0651c","resolution":{"observed_at":"2026-08-07T21:56:31.332767Z","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-07T21:56:31.311901Z","title":"Low-rank matrix completion for topological interference management by Riemannian pursuit,","venue":null,"work_id":"60fdcc86-ca6d-4848-8a37-2c85d4472895","year":2016},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.707338Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:2929c78dd5a7d68e16495dcaef326f0bb1ca30994acab02b4a13b83f1692404c","observation_id":"21f37b78-d97d-4646-a1b5-f78faa4e257c","resolution":{"observed_at":"2026-08-07T21:56:31.317361Z","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-07T21:56:31.296284Z","title":"Topological interference management for hexagonal cellular networks,","venue":null,"work_id":"8cbb7760-6c63-4d4b-95ac-576056ae320f","year":2014},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.711888Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:54d71e5216d70bee3460c7fa62b0e45990044762c4fab8e87de8cc97ad5da4a1","observation_id":"888393eb-224b-49f9-8a4b-ae1377a70705","resolution":{"observed_at":"2026-08-07T21:56:31.301566Z","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-07T21:56:31.280801Z","title":"Interference networks with no CSIT: Impact of topology,","venue":null,"work_id":"ed334da3-e4bc-4181-b994-198bce8be364","year":2014},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.716622Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:9a7850ef62c43c89cd8de8c798fcec7f3a35b7c5a564326050656d1f2c5c183e","observation_id":"a8e1566f-49d4-4b1e-ba6a-9ecc3bbd7a5c","resolution":{"observed_at":"2026-08-07T21:56:31.285838Z","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-07T21:56:31.265625Z","title":"Topological interference man- agement with confidential messages,","venue":null,"work_id":"a431cae7-192f-4d05-962f-7fcf224a385c","year":2022},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.721308Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:868823a2e9eb7806c90bca7063527af4111c9035e6fcfb7adf97c6b79ca9748b","observation_id":"e85c43d9-a293-4c16-979c-4638832846f8","resolution":{"observed_at":"2026-08-07T21:56:31.270317Z","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-07T21:56:31.250355Z","title":"Interference alignment—a new look at signal dimensions in a communication network,","venue":null,"work_id":"fd6798f4-3cec-4a92-907f-5c5c836e3aa1","year":2011},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.726190Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:5dbcddce547352c22149829f1dc4d707e558f51e57e68b7d6c9a74e4bdb3c6cd","observation_id":"af5dff50-e500-4357-82e3-e2d1d2131146","resolution":{"observed_at":"2026-08-07T21:56:31.255248Z","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-07T21:56:31.234965Z","title":"Deepcode: Feedback codes via deep learning,","venue":null,"work_id":"6d097783-2060-44ba-9450-5700811b83e4","year":2020},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.730978Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:7827864a287b1d2665ea83c87069fc888c470e8fc0613e41f0833c87b419c39e","observation_id":"651bcbbc-7d67-4b1c-8b20-f2cf8732b72f","resolution":{"observed_at":"2026-08-07T21:56:31.239939Z","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-07T21:56:31.218958Z","title":"DeepIC: Coding for interference chan- nels via deep learning,","venue":null,"work_id":"99d634c0-122a-47b4-a46d-2c939fe8b65e","year":2021},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.735684Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:1e44d79fe7024e9b2a72583a3ca286be92745f7fbd7accb84292ddb87b6719db","observation_id":"563874f6-d00b-438f-9cb8-9aa889ea6c2b","resolution":{"observed_at":"2026-08-07T21:56:31.223873Z","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-07T21:56:31.203107Z","title":"Distributed interference alignment for K-user interference channels via deep learning,","venue":null,"work_id":"d43d23a4-bb7b-456b-af84-ebdec75a1213","year":2021},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.740459Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:c14ec3700b90a002808b710b542f139fad068ddca0dd9372ec19ff4bd28df429","observation_id":"b9f37c8a-e1e3-446c-90a7-38dab26a7666","resolution":{"observed_at":"2026-08-07T21:56:31.208133Z","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-07T21:56:31.187189Z","title":"Index coding with side information,","venue":null,"work_id":"302fc68f-d552-4119-b5a9-5a208088e824","year":2011},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.745376Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:5935d8e49c2fabbd3d5b879f0db31364f28222d7c32b970bce949c3b41487a0c","observation_id":"8dd92c46-fc78-4e12-9679-90847775178d","resolution":{"observed_at":"2026-08-07T21:56:31.192465Z","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-07T21:56:31.171793Z","title":"Local graph coloring and index coding,","venue":null,"work_id":"718c64e1-5d88-40e1-91c6-ec9dced259ed","year":2013},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.749994Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:c830f54d41c6cf4540019b2ad6d393f73757013cfe677a034f7f2cee5e9a07c3","observation_id":"5d2cda73-cb53-42c7-98a0-8f142ac4b2bb","resolution":{"observed_at":"2026-08-07T21:56:31.176696Z","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-07T21:56:31.154990Z","title":"Local chromatic number and Sperner capacity,","venue":null,"work_id":"f142f245-f325-4807-ace7-014c68f45387","year":2005},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.754491Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:72d16ab10794a4e9a473c1b9510ead89f7a92caf6f57d5ffe0f2780799c8ad81","observation_id":"9c465ca6-6e05-4e53-b4ce-bb8505c43097","resolution":{"observed_at":"2026-08-07T21:56:31.160691Z","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-07T21:56:31.135902Z","title":"Index coding—an inter- ference alignment perspective,","venue":null,"work_id":"1bef5641-2e96-474a-be4e-c5f75ac72723","year":2014},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.759104Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:c4b7dd3a7df0e45e20ebedb48ec921f18273d79e7d0a7ef0aa70a0aae8e355ab","observation_id":"fc5ba274-75aa-4591-8a34-f991495696cd","resolution":{"observed_at":"2026-08-07T21:56:31.141243Z","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-07T21:56:31.119215Z","title":"Introduction to coding theory,","venue":null,"work_id":"cccd80ff-3ed5-458e-a1ed-ac2c94b35b6d","year":2006},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.764014Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:390852103df21652a188c98ee6f7366dbc8f43b50f42c98d21193e77da077d31","observation_id":"ced25fa9-d427-4dbb-9901-d2f708d8a6f4","resolution":{"observed_at":"2026-08-07T21:56:31.124572Z","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-07T21:56:31.102742Z","title":null,"venue":null,"work_id":"6295f22f-1095-49c8-942d-14ff8828c102","year":2011},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.768907Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:987bb3460e694b25e7bcda7133f401100990aee02d0e9ea0230701da317a8045","observation_id":"64529ecc-ce3e-46e9-9fa3-b32baeeb2acb","resolution":{"observed_at":"2026-08-07T21:56:31.108077Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T21:56:31.086575Z","title":"Learning what to defer for maximum independent sets,","venue":null,"work_id":"19dd200f-935a-45d9-9829-4c623ceb741b","year":2020},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.773948Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:986e39bf216d9d97b8e446b57fd2022e01d2b80351c97af59e48837b9b403091","observation_id":"73340f83-6406-4b0d-bdbc-d5beca455108","resolution":{"observed_at":"2026-08-07T21:56:31.091745Z","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-07T21:56:31.070734Z","title":"Interference alignment for cellular networks,","venue":null,"work_id":"388ce685-1a5d-4f07-b1d8-dddb759cf468","year":2008},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.778463Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:69fb652f017f626f6c8c6dc6c878c092b523b30e92c93b8a8dd9272c050c0357","observation_id":"ba7bc315-5c34-4ba9-bd1b-245ca134e17b","resolution":{"observed_at":"2026-08-07T21:56:31.075935Z","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":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-08-15T20:26:32.102285Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-07T21:56:30.783174Z","title":"Proximal policy optimization algorithms,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.783174Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:501b1806e4b3bd227218e776331560df26ccce9b6b8350ed53e11e256840a989","observation_id":"4516b756-e0c4-45fe-9981-fd2b09aba847","resolution":{"observed_at":"2026-08-07T21:56:30.783174Z","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-07T21:56:30.788359Z","title":"Inductive representation learning on large graphs,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.788359Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:4ed4cfd264e01f5647ed6791990512be85d3dc2bd28acf0b652b6051d6c1bb9a","observation_id":"57bfaf0a-616a-4e51-b845-1837872c4096","resolution":{"observed_at":"2026-08-07T21:56:30.788359Z","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-07T21:56:30.793052Z","title":"Semi-supervised classification with graph convolutional networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.793052Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:7f9aa99da3c386560d785fb7ce1c21c53f0601bd293686f3de5b2029652097e7","observation_id":"0b386c7b-1bfe-4857-a6d3-8b07db0a77ec","resolution":{"observed_at":"2026-08-07T21:56:30.793052Z","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-07T21:56:31.034668Z","title":"How powerful are graph neural networks?","venue":null,"work_id":"bd76f554-01b1-4c5b-80bc-df6c45e8c00f","year":2019},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.797771Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:833fda118fb434dd109d0fd546cb033d0a7d2b9c95ae807c2127e919f3d2f1cc","observation_id":"fa6680b1-c26a-431c-8941-e38595c09040","resolution":{"observed_at":"2026-08-07T21:56:31.039876Z","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-07T21:56:31.018603Z","title":"Efficient generation of large random networks,","venue":null,"work_id":"ba86cadc-b991-4d53-8b32-f5c640581362","year":2005},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.802841Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:efd8f7afed835584b5c1bfd4e01896c826b0db7e851bf2b6b07fdf95321eb985","observation_id":"d4a1bc2f-dcb8-45dc-89a2-733c5c9bf19a","resolution":{"observed_at":"2026-08-07T21:56:31.023609Z","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-07T21:56:31.002426Z","title":"ITLinQ+: An improved spectrum sharing mech- anism for device-to-device communications,","venue":null,"work_id":"da69fe35-3341-49a5-bd79-4a4b959ceaef","year":2015},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.807653Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:d2ed4e22e4842eb7779dab6453ce1f4656d4ce226194cf901f37afaa7ce74605","observation_id":"5ec30706-dbd4-43b4-8b65-720024e68529","resolution":{"observed_at":"2026-08-07T21:56:31.007671Z","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-07T21:56:30.985180Z","title":"Recommendation ITU-R P.1411-8,","venue":null,"work_id":"97e9820f-4b5e-4a6d-a436-65bcd050e7d5","year":2015},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.812470Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:7f09261cd9fb5a42927c7bc7acd5e9f16c405fcbcf970914309ee5aae56c5f0a","observation_id":"34dff631-5c59-4b29-9e16-f0565d65b0ce","resolution":{"observed_at":"2026-08-07T21:56:30.991039Z","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-07T21:56:30.817142Z","title":"Gurobi Optimizer Reference Manual,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.817142Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:1bad7f0102434b022598b11687152f0d9c78b11158e3acace569e0cb598e1b5a","observation_id":"e2bb0652-9047-4a1b-90d9-8d768675a6dd","resolution":{"observed_at":"2026-08-07T21:56:30.817142Z","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-07T21:56:30.946388Z","title":"Smallest-last ordering and clustering and graph coloring algorithms,","venue":null,"work_id":"e24ce061-affa-4893-bea2-21e9ae482217","year":1983},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.826743Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:4be8d6b48309f9756faf183720a7320f9ada201bdf9248ef32af39027195cb64","observation_id":"8bb74530-c738-42d3-9274-c83e778059a6","resolution":{"observed_at":"2026-08-07T21:56:30.951449Z","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-07T21:56:30.930026Z","title":null,"venue":null,"work_id":"97004547-d1b4-41b8-beb8-a3a0e1bafc1e","year":2006},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.831368Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:824bc60084577dcf2a6d51922d7a2bd83da20220cf1538798e112b931acb8444","observation_id":"5907be1a-9ee1-4aaa-95fa-a82a607ebf36","resolution":{"observed_at":"2026-08-07T21:56:30.935126Z","resolver_source":"raw_fallback","status":"unresolved"},"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-07T21:56:30.913977Z","title":"Using tabu search techniques for graph coloring,","venue":null,"work_id":"76d482c3-9fa3-4f1c-8252-daf7577dd527","year":1987},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.835828Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:66276bea7e776ecbf196d35f0f70d6158ed64c8f91040f040c510a09da3aebaa","observation_id":"157783a2-4eec-4f34-9d5d-d9ce095fc2ee","resolution":{"observed_at":"2026-08-07T21:56:30.919071Z","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-07T21:56:30.822005Z","title":"Available: https://www.gurobi.com","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T21:56:30.822005Z"},"links":{"citing_paper":"/paper/2502.09344"},"observation_digest":"sha256:20ded25553bcc353c677ec8cf5f2c013f7692652503b55beb3dab18b13194939","observation_id":"51fca53d-77e8-414e-a598-7eaa171ad905","resolution":{"observed_at":"2026-08-07T21:56:30.822005Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.09344","last_updated":"2025-02-13T14:07:51Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-10T21:33:30.601097Z","submitted_at":"2025-02-13T14:07:51Z","title":"Revisiting Topological Interference Management: A Learning-to-Code on Graphs Perspective"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":36},"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 2 inbound Pith citation observations for arXiv:2502.09344."}