{"as_of":"2026-08-16T12:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:014a970531b160979510a3b2cec08c5da4e5143ea126ae4ca2dde3a2061d90c2","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:35:47.089168Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.07367/citation-record","integrity":"/paper/1908.07367/integrity","json":"/paper/1908.07367/citation-record.json","paper":"/paper/1908.07367"},"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-14T12:35:47.424692Z","title":"Two-way communication channels,","venue":null,"work_id":"ce5d7e78-28e5-452a-a05d-2c368e7a8506","year":1961},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:46.988615Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:d47e3acb65ce19c4e8ad721c5558a62db8080c2a72195e697229ef3a489f7efa","observation_id":"53effc4c-c2cc-4cb8-a337-ab8c8966c26d","resolution":{"observed_at":"2026-08-14T12:35:47.429664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.409844Z","title":"Coding for interactive communication: a sur vey,","venue":null,"work_id":"24cf5bbd-5216-4323-9a6a-5f9f6f7288b1","year":2015},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:46.994503Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:39d255cf1d41e13b9701dc5f63a4bdceb6b94872e3e45427692cd344a70f3efb","observation_id":"36de75b2-2b42-4f4f-ae41-97e5ff91f6fa","resolution":{"observed_at":"2026-08-14T12:35:47.414770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.394736Z","title":"Communication on noisy channels: A codi ng theorem for computation,","venue":null,"work_id":"e9f7f07e-37f9-4f56-b0e7-3b593f52d251","year":1992},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:46.999672Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:436692b25154e296bbbab43d1cac603a284eb5bdf51d49980c3615cd6ce28502","observation_id":"518dbdbc-0868-48cd-9a7b-a8cd48ae5edd","resolution":{"observed_at":"2026-08-14T12:35:47.399658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.381113Z","title":null,"venue":null,"work_id":"e9dcebea-34ac-4e04-bfe9-bd2e16424fce","year":1963},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.004809Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:adcc477a61b12b615f0b80df847c135cda3a4228fda8f51ffda9d11be031877f","observation_id":"1faab1df-10b1-45d1-a864-00abba011362","resolution":{"observed_at":"2026-08-14T12:35:47.385048Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.367164Z","title":"New Y ork: John Wiley & Sons, 1968","venue":null,"work_id":"4f020161-d52a-43b8-a974-4942ed28beeb","year":1968},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.009857Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:3ffc773802d762f815dc984eaebe179bd506b3c5f19c8c72a610e5a608672e35","observation_id":"0d08aef5-98da-4777-ba59-9926745a85fe","resolution":{"observed_at":"2026-08-14T12:35:47.371839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.015081Z","title":"Richardson and R","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.015081Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:6b7751c82a07a2052d306053fa142aba340d073af3eb6863b8ee1a523a16ea76","observation_id":"2cc4949a-9115-4961-a632-f02c23698235","resolution":{"observed_at":"2026-08-14T12:35:47.015081Z","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-14T12:35:47.340954Z","title":"Channel polarization: A method for construc ting capacity-achieving codes for symmetric binary-input memoryless channels,","venue":null,"work_id":"b5c1a569-7926-46ef-b9f7-6ecf543bb417","year":2009},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.020366Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:b8d0bd13ce218f95db87db665ecd8270557dd69ac67f6d4f27fc057f3b6b5e8b","observation_id":"0319beab-b994-44f0-bc79-d53dd5896ae5","resolution":{"observed_at":"2026-08-14T12:35:47.346846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.326606Z","title":"Extreme s of error exponents,","venue":null,"work_id":"41a810fc-f110-4608-b574-28a7b49fb652","year":2013},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.025258Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:2f06726067bc3703726348489cb914a387c8dc915e8bb40a677d109c162fa0ba","observation_id":"d4c4396c-ece2-4083-b297-916df0dc59c2","resolution":{"observed_at":"2026-08-14T12:35:47.331378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.310229Z","title":"On th e construction of polar codes,","venue":null,"work_id":"6df9d745-b231-4b4c-b071-b1e85b7f9e6a","year":2011},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.029886Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:9d2ad1efa0cbf720d92b739cf3cdea61b88dbf0d15099dd6c3979dca3ce47d03","observation_id":"558dae6d-c4c0-4342-bfc7-a7ad675264f4","resolution":{"observed_at":"2026-08-14T12:35:47.316458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.295106Z","title":"Interactive channel capacity,","venue":null,"work_id":"a9819b89-f754-4958-869b-20a2fc5200bc","year":2013},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.034991Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:2b9d0a22aa4a7f567b5d4aef998f66402557bade49728a88eb36c6cec6899f93","observation_id":"59216c01-7bc0-4de0-96bc-abd63f22b20c","resolution":{"observed_at":"2026-08-14T12:35:47.299860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.280051Z","title":"Kushlevitz and N","venue":null,"work_id":"a5094730-96b7-475d-aff7-09d68e258705","year":1997},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.039927Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:646423b6abd9a0544f83289b2f4d6b94ef88a7a70ca8430a27065a5621add20b","observation_id":"1877186c-2b82-45ef-bb5d-84045ae40fa0","resolution":{"observed_at":"2026-08-14T12:35:47.285717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.266161Z","title":"Kløve and V","venue":null,"work_id":"4f762cf3-bef1-4c18-815b-ea70ab09a2e4","year":2012},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.044909Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:b1497f5f98bda9124a48f0b95cd5dcde19bb38e7baa5e158e5cbf4adbef464f7","observation_id":"98d302f1-a936-4d5a-a89a-13bd2366c354","resolution":{"observed_at":"2026-08-14T12:35:47.270442Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.250877Z","title":"V arious techniques used in connection with random digits,","venue":null,"work_id":"09ee9754-7e2b-4f32-91eb-5cf658a764a4","year":1951},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.049825Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:a2c0aaf4b9df4a04b7ac7c871c642746aa14fe21244311e72f6c5ee8d02dc1a3","observation_id":"835b56a7-2218-46ab-998a-1cc7f2831bf2","resolution":{"observed_at":"2026-08-14T12:35:47.256039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.235940Z","title":"The efficient construction of an unbiased ran dom sequence,","venue":null,"work_id":"33defd52-7742-48bf-bf4e-e53f91e605ba","year":1972},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.055041Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:41094c30929e4eb9b2e553bef253688f8ddf1b712ecb2f54aa4e1524a373f566","observation_id":"0ee366ec-8844-4f76-a593-4ab361509c20","resolution":{"observed_at":"2026-08-14T12:35:47.240996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.220109Z","title":"Coding for interactive communication ,","venue":null,"work_id":"4d779d67-c51a-4021-8f7e-7d70302e4711","year":1996},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.059864Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:395409d2863f0a0589ab176cdb012c471d017c1400eb0f6d3b17a4b54141c64b","observation_id":"756c85dd-cb83-4cc7-bd11-4c392dc0fec4","resolution":{"observed_at":"2026-08-14T12:35:47.224938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.200716Z","title":"Some complexity questions related to dis tributive computing (preliminary report),","venue":null,"work_id":"7b9cd798-65aa-4377-aed7-4b497769d28e","year":1979},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.064900Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:995be80ec03126332c71e2348977f51e83bd3516a238c857680e5238f588e8b6","observation_id":"5b248a8a-53f6-436e-9cd9-e7bdedc7d1ff","resolution":{"observed_at":"2026-08-14T12:35:47.208834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.183856Z","title":"Interactive channel capacity revisited ,","venue":null,"work_id":"5528e6a7-9d04-46e1-9379-2833d0607c6d","year":2014},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.069759Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:9afedbb45697f1bffbec017608099762876d65b740fa36f694dd3952c5a0b1b4","observation_id":"0e421b1a-995e-4168-a041-6a41ab5fafd3","resolution":{"observed_at":"2026-08-14T12:35:47.189170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.169179Z","title":"Explicit capacity approaching coding for interactiv e communication,","venue":null,"work_id":"c863f1f6-2eab-4a8c-bdae-498626bf972c","year":2018},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.074955Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:25a2713233827bb06cd08f2a1ef365c1c2c2c9694c5dc7cac6f45ede0ebdfa8c","observation_id":"bd91cc0e-581b-43cc-acd3-5aef6164a6e9","resolution":{"observed_at":"2026-08-14T12:35:47.173781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.153436Z","title":"The interactive capacity of the binary symmetric channel i s at least 1/40 the shannon capacity,","venue":null,"work_id":"045b37a9-05ec-4ca3-8a23-36ef93d2f460","year":2019},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.079570Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:cda02ee0fc6af4639b904325c0e8a4e328978ae85fc1e745d58a53aab97fde55","observation_id":"cfaf85de-5d99-44e0-9768-373dd235d7c6","resolution":{"observed_at":"2026-08-14T12:35:47.158786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.137085Z","title":"Lautum information,","venue":null,"work_id":"d7f0ab33-dbe1-477b-b467-d1bcaa80e772","year":2008},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.084273Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:d675c627b3bfdc5cd0a32b41cb37dd0aefb8f562a988d5150a8f6117a0f55348","observation_id":"0bc302af-bfc5-431f-8f3c-ef53f8c74124","resolution":{"observed_at":"2026-08-14T12:35:47.142308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:35:47.119337Z","title":"Probability of error, equivoc ation, and the chernoff bound,","venue":null,"work_id":"895d68ea-dfde-471b-9120-79870a4fcb3b","year":1970},"citing_paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:35:47.089168Z"},"links":{"citing_paper":"/paper/1908.07367"},"observation_digest":"sha256:f401b54843645b51aecbaf8dcaecb96e12d7aea448587c60086f9be5708c9ecc","observation_id":"219c9246-f5e4-41f1-aef0-22e61858d852","resolution":{"observed_at":"2026-08-14T12:35:47.126243Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.07367","last_updated":"2021-08-12T13:17:19Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-16T10:27:59.832325Z","submitted_at":"2019-08-20T14:08:17Z","title":"A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":19},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:1908.07367."}