{"as_of":"2026-08-16T14:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ea35a4e9faf0d39ff61003a158394fc78e556544fd63267b5278b88e86188d74","coverage":[{"denominator":26,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":26,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:37:57.900885Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":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.01020/citation-record","integrity":"/paper/1908.01020/integrity","json":"/paper/1908.01020/citation-record.json","paper":"/paper/1908.01020"},"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-14T15:37:58.190589Z","title":"Separations in query complexity using cheat sheets","venue":null,"work_id":"04478369-c02e-4cdf-8c21-c539a263a09f","year":2016},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.800396Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:dc634676855405123a393e504979780294f1610db41587dfaddb8523be7e016d","observation_id":"0bbb5970-7e73-43a9-ba0f-422fa80614be","resolution":{"observed_at":"2026-08-14T15:37:58.194291Z","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-14T15:37:58.180256Z","title":"Separations in query complexity based on pointer functions","venue":null,"work_id":"db94b038-93e9-4792-85f1-a5c0061b8b83","year":2017},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.805616Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:fef8cbe71eb31956ec61500e5274c1dcaa9b3263e24b41df291dbca89a54f648","observation_id":"4d439d0b-de6e-42bd-9412-1bd7156d8a16","resolution":{"observed_at":"2026-08-14T15:37:58.184035Z","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-14T15:37:58.169858Z","title":"Nearly optimal separations between communication (or query) complexity and partitions","venue":null,"work_id":"08cd3bb3-4f7d-4d43-aa1f-77e7563d5807","year":2016},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.809912Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:11e79b4797501f9ba76b8981158ef723e0081f44a2cac770b123fefda2c150f5","observation_id":"09fed0a6-58db-4da8-900e-a8c5e5bb2078","resolution":{"observed_at":"2026-08-14T15:37:58.173645Z","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-14T15:37:58.159391Z","title":"Separations in communication complexity using cheat sheets and information complexity","venue":null,"work_id":"283622da-d6ca-4bca-95aa-dd2a6524f64b","year":2016},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.814221Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:fe382ee1af60c996c04027af12e32cf1cad536999356ab02507bcb24d5fd1c7f","observation_id":"494cca82-cde7-45be-9d4b-752be7b2a007","resolution":{"observed_at":"2026-08-14T15:37:58.163074Z","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-14T15:37:58.148493Z","title":"An information statistics approach to data stream and communication complexity","venue":null,"work_id":"848f5add-2f03-4aab-b1c3-18d3d8bb23f0","year":2004},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.818437Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:0e6c1718ce0346a14adc92698aaecb3c7e4b439469ed25015a7af5181ba06be6","observation_id":"ef143b98-ae0d-40ba-a7cb-91e26e1c2a32","resolution":{"observed_at":"2026-08-14T15:37:58.152628Z","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-14T15:37:58.138366Z","title":"How to compress interactive commu- nication","venue":null,"work_id":"edb335d9-79fb-4ab8-8c29-8b0193151f21","year":2013},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.822770Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:ba03dd82d6adfe8615dad3f4a97de5b290c1183f5f946a2073c0c61f399b5148","observation_id":"39cb7cee-97bb-4bef-8608-49df455ffae7","resolution":{"observed_at":"2026-08-14T15:37:58.141865Z","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-14T15:37:58.128548Z","title":"Decision trees with AND, OR queries","venue":null,"work_id":"79a2626a-25eb-4679-bd65-85d3d05873d0","year":1995},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.827159Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:8d6531bc28e69f86cd81decdb7b355a9789722726dca08f253b206a0c8363f3b","observation_id":"9d69cc0a-b684-44c5-9cc0-3194f2921f88","resolution":{"observed_at":"2026-08-14T15:37:58.132158Z","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-14T15:37:58.117852Z","title":"Randomized query complexity of sabotaged and com- posed functions","venue":null,"work_id":"18787fde-92d7-435e-893e-d93a4b40235f","year":2018},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.831052Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:30e4858971dd4d440b9d0c9fe0c3e3d6e3c506ffb5332ef42a89c9d4aa645472","observation_id":"591b3cd7-6420-489c-98b7-529e9ab8e21b","resolution":{"observed_at":"2026-08-14T15:37:58.121504Z","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-14T15:37:58.108076Z","title":"Information equals amortized communication","venue":null,"work_id":"b319bcdd-ecfa-4cbd-a8b7-eecf02936eb0","year":2014},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.834697Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:170e50d1712b3edad0fea54241c89788f80bceb3b15cc530e1d8acbdc45e3069","observation_id":"dfcab335-9e9a-4e48-9a63-def7c6c3da63","resolution":{"observed_at":"2026-08-14T15:37:58.111688Z","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-14T15:37:58.098286Z","title":"Robust polynomials and quantum algorithms","venue":null,"work_id":"e672370d-7766-4fe6-a7f9-a10cc21cb0c8","year":2007},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.841712Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:b885a99e837b2c0f109df72b66522db1bcdd4979a82009748fb1d13386bc5947","observation_id":"1d74924d-1da4-49b2-b8f9-e6aa7f2ce080","resolution":{"observed_at":"2026-08-14T15:37:58.101888Z","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-14T15:37:58.087214Z","title":"Informational complexity and the direct sum problem for simultaneous message complexity","venue":null,"work_id":"6b6c810f-9287-4fc1-90c3-4dbbdd219994","year":2001},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.845390Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:63259f16a9c2f28bd4d95f02a1b7fe7a10223349dbe50e5cbb69fcfb83c02423","observation_id":"f46e0bdf-aec6-4d99-be76-902596577c5a","resolution":{"observed_at":"2026-08-14T15:37:58.090916Z","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-14T15:37:58.077035Z","title":"The bit extraction problem or t-resilient functions","venue":null,"work_id":"d2192ed8-98e9-4893-b41f-81587b3fcc90","year":1985},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.849298Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:b422048405e736a783ff24df5f29f1f411db57a1d805a060bd9a531276660f63","observation_id":"b80aa1b0-0f78-4602-b2d1-907cd482e407","resolution":{"observed_at":"2026-08-14T15:37:58.080978Z","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-14T15:37:58.067454Z","title":"Improved direct product theorems for randomized query complexity","venue":null,"work_id":"afc83295-3456-493c-977c-c2e6c1df5fb4","year":2012},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.852729Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:eb273e48e521956c5d487ddf7b6f0e94ea2acc31fd3cc24b3e23634a070ca929","observation_id":"9d20cff3-758e-431d-8afa-8301131c6387","resolution":{"observed_at":"2026-08-14T15:37:58.071215Z","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-14T15:37:58.058269Z","title":"Amortized communication com- plexity","venue":null,"work_id":"9ce29410-5cd1-4b9f-9cc7-90a137ed23e8","year":1995},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.856339Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:38387eaa0405851deb12d7d511e91a5d9098d3a575ada4692bdc86cb45d0492d","observation_id":"4523fd5b-7dca-42d6-aadf-e0ab057642b8","resolution":{"observed_at":"2026-08-14T15:37:58.061584Z","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-14T15:37:58.048403Z","title":"Exponential separation of information and communica- tion","venue":null,"work_id":"5b48940c-9d1c-4ee7-9c30-ed473ef8d2a7","year":2014},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.859777Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:964b7f523b4884b5707bd99404d4ef9b7e9a81a74790e8dc3d9abb770c4590c8","observation_id":"d23c8a9e-35bc-49e5-ad78-3ae882e9c098","resolution":{"observed_at":"2026-08-14T15:37:58.052185Z","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-14T15:37:58.038414Z","title":"Deterministic communication vs","venue":null,"work_id":"1d96625c-bd14-4865-b39a-0e786e59f71e","year":2015},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.863858Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:bb19ecb5a9deaa8513c6232a5b371ba4c93b025e2a1019bea4c1d23274d1fa7d","observation_id":"c68cd633-22d0-40c5-aa6b-3184c0aaee2c","resolution":{"observed_at":"2026-08-14T15:37:58.041886Z","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-14T15:37:58.027845Z","title":"Query-to-communication lifting for BPP","venue":null,"work_id":"193d748e-e310-4c89-92e5-1f9ab202ad28","year":2017},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.867292Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:dd07997985e48ab2ff549e6925a78aa4595d92742180ab77f836478a7ea1aba3","observation_id":"910a2d1b-3e99-4144-a395-50171138c2f7","resolution":{"observed_at":"2026-08-14T15:37:58.031650Z","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-14T15:37:58.018147Z","title":"A direct product theorem","venue":null,"work_id":"bfc00c1a-ea86-4cc3-a493-236ddb507a9d","year":1994},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.870687Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:2ae07c0de4ef8b28f8d9b857678f2dc44bf8ddf66b49776754d12d618e86b164","observation_id":"eaa7ddfd-57b7-4967-939c-569a00f62daa","resolution":{"observed_at":"2026-08-14T15:37:58.021584Z","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-14T15:37:58.007544Z","title":"Optimal direct sum results for deterministic and randomized decision tree complexity","venue":null,"work_id":"985d7fcb-2c38-4ef7-8bfb-1991b3a58142","year":2010},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.874286Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:c79a7dcf79f146e2b6ea510e866143938a9336d752aa9250a3e0453158cea100","observation_id":"1fe872a6-b3f6-42b4-9b02-0b8457625dd1","resolution":{"observed_at":"2026-08-14T15:37:58.011244Z","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-14T15:37:57.995870Z","title":"Super-logarithmic depth lower bounds via the direct sum in communication complexity","venue":null,"work_id":"202c4108-6961-45cb-90d9-daa689fa8236","year":1995},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.878499Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:37b52e67516030ac0259fde25032933f5d06455b21191ef68ad7c17e3aa9dc76","observation_id":"ec9dc415-4300-4e76-885b-ad87af15171a","resolution":{"observed_at":"2026-08-14T15:37:57.999886Z","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-14T15:37:57.985157Z","title":"Woodruff, and Grigory Yaroslavtsev","venue":null,"work_id":"acc8b48b-7850-42d9-b9a9-a1e0ea0734b5","year":2013},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.882308Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:62f497ce32f0b981d7938531a59e8413132d12a9eec7ae34ee24c0d829c3e416","observation_id":"6c0b7026-7dec-4bac-9d39-5c8871f8f738","resolution":{"observed_at":"2026-08-14T15:37:57.989243Z","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-14T15:37:57.974051Z","title":"Amplification of one-way infor- mation complexity via codes and noise sensitivity","venue":null,"work_id":"2275cac8-3bed-4ce1-be12-697a1663b170","year":2015},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.886252Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:af44dcf48ad54519089c04909e5ad52640e0467c3b40b1b0116af3073723b863","observation_id":"61c2c1cf-6fd4-4eb0-904b-43bc467d789d","resolution":{"observed_at":"2026-08-14T15:37:57.977725Z","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-14T15:37:57.963396Z","title":"Towards better separation between determinis- tic and randomized query complexity","venue":null,"work_id":"030c057f-d8cf-4a85-9a71-563155c59e3d","year":2015},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.890001Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:7df815ec78f5370560c6124290f2a64f41857d5a324bad7f2a97a73bc088eaf7","observation_id":"73ac845f-303d-4b84-bef4-3420b7b75aeb","resolution":{"observed_at":"2026-08-14T15:37:57.967503Z","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-14T15:37:57.952818Z","title":null,"venue":null,"work_id":"683a24cb-aaf8-451c-8da2-8c603805d6f2","year":1999},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.893619Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:7622b3fda606397a3cd904080d330f23e9e0af65f6e3e0d793606a82ecb34a1f","observation_id":"0154d521-a544-42a2-a7f8-0ab219ae90f4","resolution":{"observed_at":"2026-08-14T15:37:57.956334Z","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-14T15:37:57.942008Z","title":"Towards proving strong direct product theorems","venue":null,"work_id":"068f3baf-77a9-4635-87a4-cf985fa38ade","year":2003},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.897497Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:d149bbf9f7141750a4ba447bfcb909b5e963a167a80cf2b205d118397fd72143","observation_id":"47add94e-1080-4aa3-b48c-3a9812deca81","resolution":{"observed_at":"2026-08-14T15:37:57.945725Z","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-14T15:37:57.928208Z","title":"The power of asymmetry in constant-depth circuits","venue":null,"work_id":"e9b209ce-4c12-45bc-a14f-ac429e7d3744","year":2018},"citing_paper":{"arxiv_id":"1908.01020","last_updated":"2019-08-02T19:16:22Z","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:37:57.900885Z"},"links":{"citing_paper":"/paper/1908.01020"},"observation_digest":"sha256:dac706918c81e86bf47d9efe747d93e9cd1601c968d2d4c301c45ca4bf3a076f","observation_id":"cebce3fc-4c6b-43ba-a20f-1fe6f6d2840c","resolution":{"observed_at":"2026-08-14T15:37:57.934569Z","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.01020","last_updated":"2019-08-02T19:16:22Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T03:36:46.133608Z","submitted_at":"2019-08-02T19:16:22Z","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity"},"reference_resolution":{"displayed":26,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":25},"total_outbound_references":26},"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 26 of 26 outbound references and 0 inbound Pith citation observations for arXiv:1908.01020."}