{"as_of":"2026-08-10T06:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f4ddead914b24222022c854fb63009d4e651632571f8f1ce10f9887b168a084d","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T14:55:00.846210Z","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-10T06:31:04.303077+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-26T06:52:06.932905Z","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-07-04T12:29:51.493257Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"cited_work":{"arxiv_id":"2507.17427","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.17427","snapshot_observed_at":"2026-07-04T12:29:51.493257Z","title":"Learning to write on dirty paper,","venue":null,"work_id":"6c52bef2-11df-4194-96ad-d0461a666ba9","year":2025},"citing_paper":{"arxiv_id":"2606.23252","last_updated":"2026-06-22T12:34:00Z","snapshot_observed_at":"2026-08-06T11:10:52.234841Z","submitted_at":"2026-06-22T12:34:00Z","title":"Learning to Compute on Dirty Paper","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T06:52:06.932905Z"},"links":{"cited_paper":"/paper/2507.17427","citing_paper":"/paper/2606.23252"},"observation_digest":"sha256:bfdd803c340a8a7153450e682dcf27c2060084d27bfda0723a8716ed6318302f","observation_id":"78d8b66f-b629-4a81-938d-10bae9357dd9","resolution":{"observed_at":"2026-07-04T12:29:51.494667Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2507.17427/citation-record","integrity":"/paper/2507.17427/integrity","json":"/paper/2507.17427/citation-record.json","paper":"/paper/2507.17427"},"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-06T14:55:01.497850Z","title":"Coding for channel with random parameters,","venue":null,"work_id":"0861f4cc-c17c-43b8-a602-6cde22e1297a","year":1980},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.602010Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:081c8690a08518067d05bf7a15a7af43dd39acc24d98776eaa30d39eb4ac951e","observation_id":"09b88c07-466b-40c9-b9b1-31650759fdb9","resolution":{"observed_at":"2026-08-06T14:55:01.502414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.484834Z","title":"Writing on dirty paper (corresp.),","venue":null,"work_id":"8188316c-95df-417e-8c0d-1aa5e792bf1e","year":1983},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.606880Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:511a468b8e8bb6de18be68eda699dbc34a5e266a790cba1530161374c6ddccd9","observation_id":"7615d5da-0989-463b-a124-969615a079e5","resolution":{"observed_at":"2026-08-06T14:55:01.488850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.470169Z","title":"On the achievable throughput of a multiantenna Gaussian broadcast channel,","venue":null,"work_id":"aaa04e84-af03-40bb-9fc0-e25634a24c76","year":2003},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.612339Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:1c23612881c3e8e762aebdd08b5770ab37ae7396bb5bc55fca948dc5bf9217fd","observation_id":"13a06d71-33ab-4939-91d9-48a05b996d7d","resolution":{"observed_at":"2026-08-06T14:55:01.474906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.455157Z","title":"Sum capacity of Gaussian vector broadcast channels,","venue":null,"work_id":"f43da8fa-1abe-427e-ae15-a14364f5ed01","year":2004},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.617293Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:82d4d226efb38aab714f5aef5c71801051dcf9c629dd3370750db0809e633aa1","observation_id":"3973c8a1-23a4-474e-a2d3-a73c73b0594b","resolution":{"observed_at":"2026-08-06T14:55:01.459614Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.440312Z","title":"Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels,","venue":null,"work_id":"0b7a5033-4ed0-42ef-bf38-5abbd84305f8","year":2003},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.621976Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:6092770935bda42f07a8a7e47abe191763a9929cf10ea22cac6fa39c93f22b52","observation_id":"39ce1a4d-50c4-4f5f-b362-234a9bc04efa","resolution":{"observed_at":"2026-08-06T14:55:01.445348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.426492Z","title":"Sum capacity of the vector Gaussian broadcast channel and uplink–downlink duality,","venue":null,"work_id":"37e974b8-e40a-4fa1-9b8e-a08d27e64d9d","year":1912},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.626675Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:65894c8674e94dce8f9ccfa992d1418ffba221cc81128eb798daa0d06283ef86","observation_id":"c93eeb49-f47f-4079-8f68-746d26d4028a","resolution":{"observed_at":"2026-08-06T14:55:01.430672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.412594Z","title":"A comparison of time-sharing, DPC, and beamforming for MIMO broadcast channels with many users,","venue":null,"work_id":"5b0abc22-79aa-45e1-b6ea-08bc7d776427","year":2007},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.632334Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:5579bf0df0a38ffc2e56e63cc06a301754b1cdb0f58fb5810a0b5fcce57c24fb","observation_id":"6e67ca78-a40c-4dca-9364-8793652b3e03","resolution":{"observed_at":"2026-08-06T14:55:01.417024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.398015Z","title":"DPC rates and multiplexing gains for MIMO broadcast systems with multi-dimensional space-time modulation,","venue":null,"work_id":"8329347f-54fe-4d09-be03-729fb96d521d","year":2011},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.637382Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:4281e479c4015871e1845ed83b0d6886bbc8908da6a0a8f3c47006ca79be5612","observation_id":"b48be7e7-9a1e-43d1-a586-58dd2b5cc44b","resolution":{"observed_at":"2026-08-06T14:55:01.403083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.383959Z","title":"Uniform channel decomposition for MIMO communications,","venue":null,"work_id":"47c3589c-721f-46fa-be7e-0cde1a0ca747","year":2005},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.641782Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:c96c38e927376a52ebaa41c8c90fdf9862c16b610665c76c3a6012b23e6d971e","observation_id":"a76f158b-b9a9-44bb-b91c-6cd237098251","resolution":{"observed_at":"2026-08-06T14:55:01.388456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.368423Z","title":"Tunable channel decomposition for MIMO communications using channel state information,","venue":null,"work_id":"2fafbee5-6133-417f-9210-2c4beb655a15","year":2006},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.646021Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:275cabaeb0a3583aeb467943e6f0ff8afb78828788582aa1dc0866cb0c0558c1","observation_id":"af2cfdd7-327a-4563-b69a-a6eb59451b3d","resolution":{"observed_at":"2026-08-06T14:55:01.373631Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.353267Z","title":"Block-diagonal geometric mean decomposition (BD-GMD) for multiuser MIMO broadcast channels,","venue":null,"work_id":"eeec383d-f650-4c9c-bdf0-fec21ac6fd07","year":2006},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.650883Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:6815db5e00722d1eb162621ba63fe5956ec557cd6f09be3b455cb199e0264b70","observation_id":"b1eea192-8b8a-497f-a9cc-c503dbaf9b11","resolution":{"observed_at":"2026-08-06T14:55:01.357616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.339516Z","title":"MIMO transceiver design via majorization theory,","venue":null,"work_id":"e07a6cf3-01e6-4794-884e-bc77d6cd1982","year":2007},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.655166Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:232a729bc5b7dec0279b1db75f562b762d7d546d1f3d9bbf553a258741477772","observation_id":"ada25994-5325-422c-8883-0f809ebcb219","resolution":{"observed_at":"2026-08-06T14:55:01.343371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.325513Z","title":"Revisiting dirty paper coding to hybrid precoding for massive MIMO downlink broadcast channel,","venue":null,"work_id":"6c13ed8b-8328-4598-8fd6-c2679d5713ca","year":2023},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.659604Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:c56a8f22c4a2e5ef273c5bb26be30689d4c5b6f5d6a085672b5a2881a0b92024","observation_id":"f3125845-9b4d-46e3-b21f-5d200c2615d8","resolution":{"observed_at":"2026-08-06T14:55:01.329747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.311083Z","title":"New automatic equaliser employing modulo arithmetic,","venue":null,"work_id":"2db3a87e-9ef2-46e8-84b0-ba5a077619f9","year":1971},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.664901Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:f48be086d65994a066fc255422b20895cf07d5aeba7dbb74af337973f946512a","observation_id":"f8edc54b-2b44-450f-925b-55e5bc5ffa9d","resolution":{"observed_at":"2026-08-06T14:55:01.315615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.295869Z","title":"Matched-transmission technique for channels with intersymbol interference,","venue":null,"work_id":"f0d83a65-2a6a-4d19-88b7-258edede1391","year":1972},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.669314Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:aca108aabc70af20545a95f8c71b335275d1647f11210c2885b31c19038983bd","observation_id":"5200489c-2495-400c-a517-9bab3f7575de","resolution":{"observed_at":"2026-08-06T14:55:01.300865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.674505Z","title":"Achievable rates for Tomlinson-Harashima precoding,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.674505Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:ccf5ce0c8f9c42607cebb515232988ae3f7725b8f171249b3193346b0cdd2e1b","observation_id":"8cd331ce-12e6-4585-8693-6154d2758c2f","resolution":{"observed_at":"2026-08-06T14:55:00.674505Z","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-06T14:55:01.270990Z","title":"Tomlinson- Harashima precoding in space-time transmission for low-rate backward channel,","venue":null,"work_id":"43645590-6977-4e4a-bc41-8778a6721a86","year":2002},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.680044Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:aed6229c662b0cc95e322a36ef1dd07a9e10604512a8b08f31ff6ec289997cb6","observation_id":"d066a05c-6eec-4e96-96a0-192ea91f2934","resolution":{"observed_at":"2026-08-06T14:55:01.275491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.256736Z","title":"Multi-branch Tomlinson- Harashima precoding design for MU-MIMO systems: Theory and al- gorithms,","venue":null,"work_id":"357bf87d-2e51-42b8-b67c-cbfa80877cf2","year":2014},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.685262Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:b1826530cdb91b9fa82df925b682b82c56da35adf539ee6e6ef2b2b44c966733","observation_id":"1599c52b-f3a6-42a1-959f-74e5a25c5bd8","resolution":{"observed_at":"2026-08-06T14:55:01.261055Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.243023Z","title":"Tomlinson-Harashima precoding for broadcast channels with uncertainty,","venue":null,"work_id":"7eca4aaa-397d-45d5-8216-3cd5dd080ae7","year":2007},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.689840Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:5f59532a94933c13d43a5091beaafacf0e0a2082444501c4fc392550db76a1ec","observation_id":"de7f4ba7-e5b3-4c11-8989-a6102a8d22ea","resolution":{"observed_at":"2026-08-06T14:55:01.247405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.229097Z","title":"A multi-user precoding scheme achieving crosstalk cancellation with application to DSL systems,","venue":null,"work_id":"ccf98d68-21b9-4c64-ac8e-f122dda1f830","year":2000},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.694902Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:3a48ebaade1017301a5946cea06147e958cd6a866b31742e57c8f768648148b9","observation_id":"b9b217cc-e59f-4aa0-845e-6899e28be249","resolution":{"observed_at":"2026-08-06T14:55:01.233387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.215005Z","title":"Multiuser diversity for a dirty paper approach,","venue":null,"work_id":"cb8b73b2-45d8-4855-a345-b5873e356b13","year":2003},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.699526Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:e295d8373e887c30ec0cc00fcf450baaaf9ecea908ebeb8502a2a7f8400cb054","observation_id":"5287a463-31ed-4139-8a0c-a301f7a8dc98","resolution":{"observed_at":"2026-08-06T14:55:01.219274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.201366Z","title":"The intersymbol interference channel: lower bounds on capacity and channel precoding loss,","venue":null,"work_id":"f768d5fd-c949-424e-b81e-ea4b244c1a74","year":1996},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.705419Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:071550be1d99352f33a3dfe72c09d13fcab789aeca84b53d01cce5cb10895a9a","observation_id":"ed408c12-829e-4029-9405-043d0e03ff90","resolution":{"observed_at":"2026-08-06T14:55:01.205730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.188132Z","title":"A close-to-capacity dirty paper coding scheme,","venue":null,"work_id":"accce7ca-f4f0-45e5-9c4a-c73b0b4a6407","year":2005},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.716109Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:48b2db2e7044e5842f869ad867f0d3c57d89d6bac8c256427505d160688f4314","observation_id":"c1ad35cf-98d3-4435-86c2-a46bca15d8fc","resolution":{"observed_at":"2026-08-06T14:55:01.192035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.174593Z","title":"Neural distributed source coding,","venue":null,"work_id":"82217fb9-35d2-4d32-9604-a85571f3ea00","year":2024},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.727235Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:4c96dea02d9cbb48180401824460391a471fa2d54c9d9e9261970e6f4f4a61cb","observation_id":"08ef428f-79f0-499b-a77d-75e4610a3a48","resolution":{"observed_at":"2026-08-06T14:55:01.178652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.160051Z","title":"Neural distributed compressor discovers binning,","venue":null,"work_id":"7332c326-0893-4234-af27-bac7fb680c01","year":2024},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.737726Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:ee099369a2f9372fade76f7b4ab85de58456b644db245f4c6628869cabaafc22","observation_id":"4a841e23-89b8-4c8c-a264-d821dc525391","resolution":{"observed_at":"2026-08-06T14:55:01.164799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.145667Z","title":"Distributed compression in the era of machine learning: A review of recent advances,","venue":null,"work_id":"c1f4229e-71b0-4c0e-9863-a7fd50e693a0","year":2024},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.745668Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:91588787ecd3c499afa3e4775ca94e8def06f75a13729cac0d51e8378d402f21","observation_id":"2951f48e-1a00-45d3-b0c5-2ca6aa7678a6","resolution":{"observed_at":"2026-08-06T14:55:01.150188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.130018Z","title":"Learned Wyner–Ziv compressors recover binning,","venue":null,"work_id":"97ed6462-c45f-476d-a7a1-aa4f1a5a27b0","year":2023},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.754797Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:8c2be8a24ce304338bd14b9fa335a21795eb497d650d552cda2268e7d7add0df","observation_id":"8b2a6dac-bc1c-4e95-bac6-c21eec3995da","resolution":{"observed_at":"2026-08-06T14:55:01.134796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.115653Z","title":"The rate–distortion function for source coding with side information at the decoder,","venue":null,"work_id":"bbf4c724-4d39-4f2c-97a4-c9a4305e0a90","year":1976},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.763271Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:a5d06867f76e3899569020f3cd112e43d27a46d19ac245e18b50e7566f0202ed","observation_id":"c20f03d9-ab1a-420b-b48f-4273dde3c00d","resolution":{"observed_at":"2026-08-06T14:55:01.119759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.102016Z","title":"Duality between source coding and channel coding and its extension to the side information case,","venue":null,"work_id":"841f2aee-298f-4725-9177-12251b8b2e8c","year":2003},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.767316Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:035972d5b2bae4807bf37754863317439cc6fa649a5bf127314a3b6eddd31a31","observation_id":"5351133a-af0d-46cc-9f4c-eb328ce121c3","resolution":{"observed_at":"2026-08-06T14:55:01.106452Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.087734Z","title":"Fixed binning schemes: an operational dual- ity between channel and source coding problems with side information,","venue":null,"work_id":"14f3400c-82cb-4525-9a91-4d9a3bf7dfe9","year":2004},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.772067Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:4e68aca96bebfbccdd210a34c4e43927c84f778c0d36c738290cb5b17589ac78","observation_id":"75309b21-8e1f-43e8-9198-37567f0f0412","resolution":{"observed_at":"2026-08-06T14:55:01.092652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.072912Z","title":"Joint Wyner–Ziv/dirty-paper coding by modulo-lattice modulation,","venue":null,"work_id":"4fb06adb-773e-4349-95cf-58c359fcc639","year":2009},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.776761Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:97f265c62a86a56b8892376bf1c7400fcc9aa407bfefb3abdf0c76545626e43a","observation_id":"01cfca1b-b733-4613-800a-dd9b3ea9184f","resolution":{"observed_at":"2026-08-06T14:55:01.077748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.058704Z","title":"Channel coding in the presence of side information,","venue":null,"work_id":"523962b8-645e-44df-8596-0e2697aeb01f","year":2008},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.783571Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:7dc8ac253173dc084128e2f95092ee9bc9bd5ca6245c3d34642df454b19ac6e0","observation_id":"306c6ad9-7f9e-41fd-ae3a-c7915f11d3f1","resolution":{"observed_at":"2026-08-06T14:55:01.063052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.044793Z","title":"On the spectral bias of neural networks,","venue":null,"work_id":"7697499b-af63-4298-82f4-1bbfa7c4e25e","year":2019},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.787592Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:6bfb831e4240f585d567f354b65f219cc25185fbb428a7ac5e2c8035e54ead4b","observation_id":"c2b3dff3-a0df-47dd-98cb-65fba1609a18","resolution":{"observed_at":"2026-08-06T14:55:01.048937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.030639Z","title":"Frequency bias in neural networks for input of non-uniform density,","venue":null,"work_id":"78dfa382-0513-4966-9fae-8da3295a3e0a","year":2020},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.792154Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:aa9119b1b6c8bb14715cfca86ea9c8a14ae0b7c227a86f277b67aa5e4d6fabed","observation_id":"ac27d043-5825-4c11-8dff-d798424562df","resolution":{"observed_at":"2026-08-06T14:55:01.035019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:01.014791Z","title":"Neural networks fail to learn periodic functions and how to fix it,","venue":null,"work_id":"f987bdff-d460-4206-ad5d-b7f513564987","year":2020},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.796607Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:c6c5196152b550a1c3444f452527ff3696a51e241ea63dd5d791c62e50216c9e","observation_id":"4716405a-bdf2-4a93-b149-0dd46c2f4aa8","resolution":{"observed_at":"2026-08-06T14:55:01.019681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.999499Z","title":"The Gaussian watermarking game,","venue":null,"work_id":"239a5d99-4379-489f-9031-b567995b9676","year":2002},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.802650Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:b12dcb2515607368e89c12a67fc5fb1a33df8943414bc0ccc92b0512bc2baae9","observation_id":"6186d7b2-5b03-4a13-80cd-1d4160e25083","resolution":{"observed_at":"2026-08-06T14:55:01.003426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.985642Z","title":"Precoding in multiantenna and multiuser communications,","venue":null,"work_id":"97798f33-ca4c-47e3-98b3-7be8352efbda","year":2004},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.807270Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:79de113900b0a2aaaa040ada40a26d9c5c4f4ada1501a031e92646642c5ff088","observation_id":"840c638f-648f-4745-a95a-f6ad5fa4255f","resolution":{"observed_at":"2026-08-06T14:55:00.989943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.971784Z","title":"Nested linear/lattice codes for structured multiterminal binning,","venue":null,"work_id":"334bde85-00e9-4be0-bbe9-44f3e21b0b98","year":2002},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.812393Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:c9af274d9d6d9137dc2aff61f2ba06c651e5fd63f28ba86215fbcc353b9037c5","observation_id":"fb05967b-f1f1-435f-bc0a-04643c0ec834","resolution":{"observed_at":"2026-08-06T14:55:00.975952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.958211Z","title":"Zamir, B","venue":null,"work_id":"adf68c66-a2d0-4f87-80ea-5898ef9a3dc3","year":2014},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.817388Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:550286cbbe30e479bbad893083b5af41f984440283017d4c324b198e6de88a47","observation_id":"5dd43bf7-5fc4-4267-924f-da20001723ea","resolution":{"observed_at":"2026-08-06T14:55:00.962111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.943896Z","title":"JAX: Composable transformations of Python+NumPy programs,","venue":null,"work_id":"111ea6c3-d6d2-4c63-8a54-975db4043f3e","year":2018},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.821870Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:7d34fdb289932c5ee0e2e469651b934bea924891632bcde159258a4a8c3c553e","observation_id":"d268b0ee-c47f-4172-b38e-0c6029c42328","resolution":{"observed_at":"2026-08-06T14:55:00.948036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.827162Z","title":"Adam: A method for stochastic optimization,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.827162Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:788566cea23b59a4242b7ce4ddd8a376cb62202c02ff3d798d9cb80ddf0f9371","observation_id":"df57e774-5acb-463a-aa0a-616e75da0c62","resolution":{"observed_at":"2026-08-06T14:55:00.827162Z","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-06T14:55:00.920383Z","title":null,"venue":null,"work_id":"e98767c4-9a11-4ceb-8210-86a66fb2b80f","year":1988},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.831447Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:7c7d47c0607d7ec91dfd327d9655a3c9583371f80836813f80fc6cb6e0ef0d1b","observation_id":"c837d799-dc44-4578-825e-2b70cb906422","resolution":{"observed_at":"2026-08-06T14:55:00.924209Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.907053Z","title":"Structured dirty paper coding with known interference structure at receiver,","venue":null,"work_id":"e3a21ba3-b6a4-4281-9d7b-86706343b6fb","year":2005},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.836546Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:1d4ce71e9335effe66fc9b1673c310be595dfc8d98a050151356ef4d4a4ab437","observation_id":"343b7aab-8f28-4db7-8f7c-4ec6d6fab757","resolution":{"observed_at":"2026-08-06T14:55:00.910967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.892534Z","title":"The sphere packing problem in dimension 24,","venue":null,"work_id":"61708bb6-8580-40fe-a46d-d7ca66a57383","year":2017},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.841435Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:be170e06a3571d9b5826a3518eded3ddd3f37aa086d363e3e0582b65f56f5485","observation_id":"4a7c901e-8043-4505-9374-8482b9245073","resolution":{"observed_at":"2026-08-06T14:55:00.897470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T14:55:00.877813Z","title":null,"venue":null,"work_id":"6738013d-8d35-4b35-80f3-dbdc98f7c3f3","year":2012},"citing_paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-06T14:55:00.846210Z"},"links":{"citing_paper":"/paper/2507.17427"},"observation_digest":"sha256:fe934dabd5957934fd16473366d84a61286fdf0b03530ad861b950e2c722d33d","observation_id":"6c72af89-76cc-4c3a-a7d8-741c561b0def","resolution":{"observed_at":"2026-08-06T14:55:00.883020Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.17427","last_updated":"2025-07-23T11:36:43Z","latest_version":1,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-06T14:45:41.550918Z","submitted_at":"2025-07-23T11:36:43Z","title":"Learning to Write on Dirty Paper"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":41},"total_outbound_references":45},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 1 inbound Pith citation observation for arXiv:2507.17427."}