{"as_of":"2026-08-20T12:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ef076a38631563a393944fa49755b2ed0ddefa899cb0420bb55944a9393eb66","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T11:50:26.030339Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2607.07396/citation-record","integrity":"/paper/2607.07396/integrity","json":"/paper/2607.07396/citation-record.json","paper":"/paper/2607.07396"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7823.371825","doi":"10.1145/3717823.3718252","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs , booktitle =","venue":null,"work_id":"0a0abe38-31c1-4ad9-b45e-296223f7bdf2","year":2025},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:eef5d678262a72b801d49dd0ab1ef9b3f8c73744d21fd4812e4c7fa96b6fbaa6","observation_id":"09affb9f-374c-47e2-b09d-e2779cd7d390","resolution":{"observed_at":"2026-07-09T12:36:13.821925Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-20T19:52:23.390407+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T19:52:23.390407+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4457.2022","doi":"10.1109/focs54457.2022.00024","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","work_id":"e949fd32-ca78-47cb-bbd7-e5543bc6613f","year":2022},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:0b2e5e96cd37707b4677e31b6b60591855ab4190c355f58716286f520673c56f","observation_id":"c10c7efc-a648-4a79-a021-4e4d5417acb0","resolution":{"observed_at":"2026-07-09T12:36:13.745149Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6700.2020","doi":"10.1109/focs46700.2020.00013","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =","venue":null,"work_id":"c016149e-231e-40ae-a771-6cdae0f78587","year":2020},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:eea5b86d030777b1f28f1dc2a6c254a45763a0fb2eb0049c0a5fda3c9697c1ea","observation_id":"eee83577-9a25-43a3-ad2d-45fc4dd6f79a","resolution":{"observed_at":"2026-07-09T12:36:13.838440Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/130938517","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2015 , url =","venue":"SIAM Journal on Computing","work_id":"6027b13b-21b1-418c-904d-200d8feb0aa2","year":2015},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:2dcce5829b0dedf208139632d75508c5bc90546a3ba72fa524f22eb663f85f0e","observation_id":"ed91da32-2fe7-4c24-aafd-b2cf3fce43f6","resolution":{"observed_at":"2026-07-09T12:36:13.785551Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jcss.2003.11.006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An information statistics approach to data stream and communication complexity , journal =","venue":"Journal of Computer and System Sciences","work_id":"099fde46-db7d-432e-a83f-78fa6b5b85c1","year":2004},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:2ce9094595b54358db79b5156d2923d600e83a70ba2a90377b6f1cdc2a0ba781","observation_id":"fcc9bd43-0f13-442a-8b4d-0be82599c83c","resolution":{"observed_at":"2026-07-09T12:36:13.777713Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6689.180670","doi":"10.1145/1806689.1806701","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms","venue":null,"work_id":"8ddf0909-65d7-4c92-91a2-b7ecbf19e0ac","year":2010},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:b0fd742512189b80afad738ae0477b86ce99eb467c1df3b16e3ea721100277b3","observation_id":"ef948923-7571-4983-96af-46afc1b71109","resolution":{"observed_at":"2026-07-09T12:36:13.807439Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1266.2024","doi":"10.1109/focs61266.2024.00007","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Minor containment and disjoint paths in almost-linear time","venue":null,"work_id":"4d4ecf63-4e54-473f-89a4-027172eeb7e8","year":2024},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:b777b0b2f950dd1eb821b199d347995481828a1a1b02eabd8f09c685a95aae1a","observation_id":"7351c9c6-d6f0-4266-a529-db4e1c6bf44f","resolution":{"observed_at":"2026-07-09T12:36:13.828716Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:44.276639+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:44.276639+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8260.364972","doi":"10.1145/3618260.3649720","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"InProceedings of the 56th Annual ACM Symposium on Theory of Computing (Vancouver, BC, Canada)(STOC 2024)","venue":null,"work_id":"31855759-308f-4188-a96a-9e33f62f7c2b","year":2024},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:f556a733abc7173d1b342c931faf369f5e22f50afe62d51bc9f06414a4f86fe9","observation_id":"0cc6ac69-8b1f-4d39-854c-49edb8157896","resolution":{"observed_at":"2026-07-09T12:36:13.859450Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2013.85","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"54th Annual","venue":null,"work_id":"0ce296a5-2ba3-4701-a68e-942c5d030e91","year":2013},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:f3235ff74535b32abd2b728323b3752b3f8c7a7ce40d872bb2aeb3a902d3f7bd","observation_id":"10dba0dc-46e0-4787-999c-14d44c46fae3","resolution":{"observed_at":"2026-07-09T12:36:13.821376Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2012.42","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity , booktitle =","venue":null,"work_id":"f26e04e0-9998-44b4-81ee-2f2f4a70d0c8","year":2012},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:57a47b208ee06cbd4d58774647da782a7b70adcf4dac69cd2956dd1d161ef137","observation_id":"ec1b7d27-b9ce-4de1-9112-da9ce8929c58","resolution":{"observed_at":"2026-07-09T12:36:13.784089Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2011.86","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2011 , url =","venue":null,"work_id":"0d27ba74-2704-4d0f-abf0-ee35dd8af8a6","year":2011},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:85d597bac379e65aeafa9ade93518ff1b1c5c5d73d1ff23353179b93619da09d","observation_id":"d6f9297a-84c4-44d3-b5a6-67dc91ebb5c5","resolution":{"observed_at":"2026-07-09T12:36:13.852165Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sfcs.1982.45","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theory and application of trapdoor func tions","venue":null,"work_id":"b4cd6ad7-a4ed-4b84-b7b7-cbe6b8500894","year":1982},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:6b9ae2713fa7ae798a48f42c7c16290cfa17eb60c0ad4640281b8c7bbe8d1a56","observation_id":"bc230f2f-19ae-488c-9285-ad80e6914d96","resolution":{"observed_at":"2026-07-09T12:36:13.783609Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02579323","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Levin , title =","venue":"COMBINATORICA","work_id":"a0dd860a-4177-464d-b438-6aff40eae47a","year":1987},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:2f7e1923508b758b5422b9a539d68d6ddf069de101db2727d77e350c1381022b","observation_id":"a0a9c23f-bfd8-48be-bcc7-1ee20ecc7b98","resolution":{"observed_at":"2026-07-09T12:36:13.815396Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8533.258590","doi":"10.1145/258533.258590","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"87b7484f-bbe5-4c07-812d-877d4239822e","year":1997},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:335ac63c196fe057bf831c7d30690348f906e90e84e712b0d83d706b43b6e317","observation_id":"29daf59f-9057-448b-84e5-ef3d2c547ee1","resolution":{"observed_at":"2026-07-09T12:36:13.837661Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1995.492584","doi":"10.1109/sfcs.1995.492584","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"36th Annual Symposium on Foundations of Computer Science , pages =","venue":null,"work_id":"6182effc-5f16-4aa8-b618-ff6c7f9974bb","year":1995},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:0331e34accd07fa1b2729bb7b42769652b19525c4734c570c61c5d240df06a41","observation_id":"fc78021d-678a-4236-9507-8f64e90ea3c7","resolution":{"observed_at":"2026-07-09T12:36:13.851440Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00037-012-0043-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Computational Complexity","work_id":"ea1144cb-3c5f-447f-8929-c8fe9e36707c","year":2012},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:2d88774452895258b0ab8b8a0e711884f659e81266b6c9640434dff71b257f92","observation_id":"73753bdf-70ff-4265-8897-b753ead10c98","resolution":{"observed_at":"2026-07-09T12:36:13.823818Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.05580","last_updated":"2020-07-17T20:07:49Z","snapshot_observed_at":"2026-07-06T09:37:18.025891Z","submitted_at":"2020-07-10T19:29:52Z","title":"A Strong XOR Lemma for Randomized Query Complexity","version":2},"cited_work":{"arxiv_id":"2007.05580","doi":null,"metadata_source":"pith","pith_arxiv_id":"2007.05580","snapshot_observed_at":"2026-07-09T12:36:14.001427Z","title":"A Strong XOR Lemma for Randomized Query Complexity","venue":"cs.CC","work_id":"ce082e13-8670-4025-82c3-71cbd4297c42","year":2020},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"cited_paper":"/paper/2007.05580","citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:90d5e43bb6fb0ed5aedd12e160c5069d494e343fe6e9d1873ac750cd1721ac87","observation_id":"7ec30386-d5c1-4a78-8e02-c3add9569b88","resolution":{"observed_at":"2026-07-09T12:36:14.002826Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2025.16","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Direct Sums for Parity Decision Trees , booktitle =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"b4566738-0319-42e3-b70e-adbc7fa3571f","year":2025},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:6173eb326dd7fc887e40960cd969582a300543528e720a00b4ce7bbf96b86450","observation_id":"cbebab2f-6c96-4f7d-b10e-a6e30f32fbea","resolution":{"observed_at":"2026-07-09T12:36:13.817368Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2018.v014a005","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Randomized Query Complexity of Sabotaged and Composed Functions , journal =","venue":"Theory of Computing","work_id":"e6294ef4-93af-46c4-8658-b8c4b34a574d","year":2018},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:9c1c5381d1a5ae213c3fdd963c6cf7c5515d0aa0807685749725156b9c593da7","observation_id":"315f8bec-11f3-45df-9466-e56aa4d42eb0","resolution":{"observed_at":"2026-07-09T12:36:13.850397Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2019.29","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"34th Computational Complexity Conference , series =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"2cc3875f-4d0d-45a5-8b1b-63956b9ae8fd","year":2019},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:60dd154a90cdab2678f8722dd2a7e605c60503cc835756d002fdd0a6232cf7ad","observation_id":"ede620bf-d904-45e6-af7f-c073844689ba","resolution":{"observed_at":"2026-07-09T12:36:13.756135Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ipl.2010.07.020","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Information Processing Letters","work_id":"4d87043d-c818-49d4-816c-5d732a8c98a1","year":2010},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:c86a274092c65941ef0b232230620862f010a4baca310f717423d2a1e85dec37","observation_id":"d526ae72-ec46-4843-ae3e-e0198b25188f","resolution":{"observed_at":"2026-07-09T12:36:13.830775Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-09T12:36:14.236374Z","title":"On determinism versus unambiquous nondeterminism for decision trees , journal =","venue":null,"work_id":"ce943588-499d-41a6-82f5-b7a21d3c4de0","year":2002},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:a8760f3b4f52fc05646394f6c267da84f78e661ada9a0c139f15174e26edd358","observation_id":"e5d218a5-fc52-4033-9943-eb617c735aa1","resolution":{"observed_at":"2026-07-09T12:36:14.237856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2011.75","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reichardt and Robert","venue":null,"work_id":"cf162ead-47eb-45e0-bfce-46b7c7d50712","year":2011},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:73fc32ac1dc81dc3bd4db5283e7ee3d99a49462bb0e9a4520e60b332321c27c3","observation_id":"c7713edd-f993-4555-97c9-58dff8c4a8d8","resolution":{"observed_at":"2026-07-09T12:36:13.810026Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-17T00:20:51.23957+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-17T00:20:51.23957+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611973082.44","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"22nd Annual","venue":null,"work_id":"dbd5ccab-3b06-46c7-aa05-2fa288e35bf5","year":2011},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:ac0e4d09f8a25fc8613ecc94da1bc01dce75f4c0f8975e937a6ca3a79c95fb47","observation_id":"e6939ca9-c8f5-4f8b-b90e-4c1e954f62c4","resolution":{"observed_at":"2026-07-09T12:36:13.775541Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2020.28","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"When Is Amplification Necessary for Composition in Randomized Query Complexity? , booktitle =","venue":"arXiv (Cornell University)","work_id":"3c8bfdcb-1465-42b0-883b-65475c767191","year":2020},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:04977eef92dea3d75d6618a5b124ee4d3435cf1163ad025605e12c8c2a57360e","observation_id":"3a4e767d-92c4-4f0f-99f7-42567f3737ee","resolution":{"observed_at":"2026-07-09T12:36:13.775381Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539791195877","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1994 , url =","venue":"SIAM Journal on Computing","work_id":"fb7f7d5b-2436-4671-ad0d-a855beb9caf6","year":1994},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:953c77308bed576238a02fe7dcb54c45ccd276972094042396abf4a92ab31a76","observation_id":"641e0183-2615-4ec5-8d0f-642053d5e8fd","resolution":{"observed_at":"2026-07-09T12:36:13.768245Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2021.18","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Majority Lemma for Randomised Query Complexity , booktitle =","venue":"arXiv (Cornell University)","work_id":"d0c193d6-f724-4c51-a30a-efcbac0476a0","year":2021},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:604d67b498df87f259fed5fa4890ce20419dab21e225ea81a43758cb448a7e25","observation_id":"afc0a365-c273-4d75-9ce4-607ac1cd7ac1","resolution":{"observed_at":"2026-07-09T12:36:13.822960Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7823.371814","doi":"10.1145/3717823.3718141","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"57th Annual","venue":null,"work_id":"36cf06ab-99e4-4541-b748-dd59b731294d","year":2025},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:ee2f9c11b4c2705a4a7e3fc0e6adb123b52777d05458d01ac8188c13bcd87e62","observation_id":"4190947c-16a2-48fe-bf72-7c6769135fed","resolution":{"observed_at":"2026-07-09T12:36:13.814537Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/120861072","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2012 , url =","venue":"SIAM Journal on Computing","work_id":"832819d6-a67f-4e7c-8b0d-1a2507b3918b","year":2012},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:e93ebc83bdfbe792461fc7d9a15919752989ccd51ab69f9dfafd18b69c2995e9","observation_id":"370ac1bf-4d4f-47ce-9772-3d65885c2775","resolution":{"observed_at":"2026-07-09T12:36:13.800165Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2012.v008a008","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sherstov , title =","venue":"Theory of Computing","work_id":"3d087fe3-9571-43d0-9b81-82cd388d1032","year":2012},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:678e86014f712370d141a8ca1323c2efa30d164782edc2c460f96c8580581ade","observation_id":"04868b33-ab5a-407d-92b0-2fc1d588cbff","resolution":{"observed_at":"2026-07-09T12:36:13.825386Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-09T12:36:14.234397Z","title":null,"venue":null,"work_id":"5fc90749-46ed-4264-ac66-587ed484e442","year":2012},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:c11f93404bd37d2ac52ed398241d2ae1abc1ec9e48ec19c4c176208c8e90fead","observation_id":"a5e61c1c-5076-4a5e-a267-7c87672d96bd","resolution":{"observed_at":"2026-07-09T12:36:14.235719Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-32512-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Maximum matching in semi-streaming with few passes","venue":null,"work_id":"ef6959da-ca66-4081-b9eb-58c14c13fb85","year":2012},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:1dcff111350b25621f25bf82034b8985b1ed8b343b79bff99176747b29696529","observation_id":"f33088f4-1012-4638-9c39-003d2e7caef1","resolution":{"observed_at":"2026-07-09T12:36:13.844117Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-09T11:20:49.211503+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T11:20:49.211503+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0590.106062","doi":"10.1145/1060590.1060621","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":"0c8b286d-d9ea-4371-9cc6-5bf1b44139bb","year":2005},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:6e62fa70661028eecf50fe75fe8ed1dc5a2ffeef41f9f74fd0cb7d48d6aaef93","observation_id":"0866e570-1a43-4ea5-bccc-4c11f7314896","resolution":{"observed_at":"2026-07-09T12:36:13.792277Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:21:09.152447+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:21:09.152447+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/11533719","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Subquadratic Algorithm for Dynamic Shortest Distances , booktitle =","venue":null,"work_id":"ea4530bb-54f0-4d57-a9b9-12f5c7ab3090","year":2005},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:ee0dc330c78d5a0a7c6cca952279f55159ce2b91bc673cf1e9d0c1e29b2beecc","observation_id":"81f2340f-110f-4e9e-b104-2ab078322944","resolution":{"observed_at":"2026-07-09T12:36:13.781190Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-09T12:36:14.238465Z","title":"Reductions in streaming algorithms, with an application to counting triangles in graphs , booktitle =","venue":null,"work_id":"4e85aeeb-3be6-49eb-9864-5ce077178431","year":2002},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:f59bdcc0e9581fe78cc4a054a007ba94a79482b4025720ff1484833fd8a48db4","observation_id":"c23002f6-f31a-4517-aa75-94b09441c45d","resolution":{"observed_at":"2026-07-09T12:36:14.239791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2351.114238","doi":"10.1145/1142351.1142388","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Buriol and Gereon Frahling and Stefano Leonardi and Alberto Marchetti","venue":null,"work_id":"f3174c22-90d7-41a4-8b4a-938780a6eb2a","year":2006},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:fca2275c5a2ab6c0a5fbecbe2d3e6a6265c22826cbf6ad34fdb178f8800fd3ed","observation_id":"d721a804-0b0a-44f7-bfcd-158a2987ab6e","resolution":{"observed_at":"2026-07-09T12:36:13.826895Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-39206-1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Space-time tradeoffs for subset sum: An improved worst case algorithm","venue":"Lecture notes in computer science","work_id":"3699bb1c-4c6e-4695-931f-aaf6050b7e92","year":2013},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:b21411674fe9802a812aee06271ef29ce83ba87d4c9bdf9fa3372bc012760135","observation_id":"1837084d-d750-4688-9267-cabb237d3018","resolution":{"observed_at":"2026-07-09T12:36:13.758762Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611974782.116","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"28th Annual","venue":null,"work_id":"8c81afad-3977-4a6e-a291-07ff054faeed","year":2017},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:7844077dc635b8242e80db265745dce005f647c0bf030a9999d99370d388072b","observation_id":"4e556f94-837c-4117-9458-ddd5b0f41be7","resolution":{"observed_at":"2026-07-09T12:36:13.811854Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2021.11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Approximation, Randomization, and Combinatorial Optimization , series =","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"dc5218e3-8b4b-4f67-b829-3c63168fd1be","year":2021},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:3c8425e27fa36fbdb45b15a63c5bd990cfec9daf997e351a21a4b04bb659c3aa","observation_id":"b756884a-ee7d-4a4d-87ea-b56bf8a75b87","resolution":{"observed_at":"2026-07-09T12:36:13.835145Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7692.262769","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T12:36:13.730962Z","title":"2014 , url =","venue":null,"work_id":"093e6a19-5b3e-48e8-92b8-5dc3d3158dc7","year":2014},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:c7dfde904a6ac0fe62db07afcdb93e70a0729b8fa8eefd926648455e5d6f4f0d","observation_id":"ebc5904a-d87c-4321-9ade-f526a701f245","resolution":{"observed_at":"2026-07-09T12:36:13.732679Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3699.248370","doi":"10.1145/2483699.2483701","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bin Packing via Discrepancy of Permutations , journal =","venue":"ACM Transactions on Algorithms","work_id":"779a9939-4db5-461b-a045-1bc0307e2093","year":2013},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:4281f0aa7e190dc9fd671d9705660eee537a7cc522a3cd5a35162861443c983a","observation_id":"159114a7-3097-47e8-8d2c-08f4d0915ffc","resolution":{"observed_at":"2026-07-09T12:36:13.855242Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-09T12:36:14.232429Z","title":"Woodruff , title =","venue":null,"work_id":"e3bb9ec0-f5d6-4dae-a584-8deb90f6b3ba","year":2004},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:dae6c78af7f5fa6a564f3d81763d236820f66d1488f8d51e79896f225f47bed4","observation_id":"7a9f5f0f-924a-4bb0-98dc-768df573d522","resolution":{"observed_at":"2026-07-09T12:36:14.233752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1997.1545","doi":"10.1006/jcss.1997.1545","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Journal of Computer and System Sciences , author =","venue":"Journal of Computer and System Sciences","work_id":"ec3a905e-c41f-4484-8bdd-c4d37147874c","year":1999},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:673dfc4c77c9ec188c60e64c1508f04b270d1fd92987b40d449cc3d17ce9e9b7","observation_id":"1a220d92-0cec-42de-9872-6eab988f1f7d","resolution":{"observed_at":"2026-07-09T12:36:13.848522Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:21:06.218224+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:21:06.218224+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00224-015-9655-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theory Comput","venue":"Theory of Computing Systems","work_id":"4c804608-94df-4429-afc7-9cc23bf01d69","year":2016},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:5cbc04ff372bbe9b97836f3114205bad98b34273f3345e7d2a4c688618151f54","observation_id":"6f4a458a-325a-4cdd-ac00-a06ca2b96894","resolution":{"observed_at":"2026-07-09T12:36:13.811600Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/130928273","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications , journal =","venue":"SIAM Journal on Computing","work_id":"50af4c2f-1589-4508-8e1a-978bffd1c613","year":2015},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:58b59c8b97b52b642bedc1a0762b933b31891ab178467a8ae6fc0d2375b8e2df","observation_id":"ea7bab23-fa37-4acc-81d5-fb6100255545","resolution":{"observed_at":"2026-07-09T12:36:13.819693Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-09T12:36:14.230223Z","title":"Communication Complexity: and Applications , publisher=","venue":null,"work_id":"2af2f076-d12e-4c64-9449-ece20df8cb7a","year":null},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:b7d6a3f1abdfd9266062cb97f8ccb804f6be47b3744cdd827c4905c9d25dd6a0","observation_id":"41b91bb2-1321-40b6-89f2-dd29a0e94d07","resolution":{"observed_at":"2026-07-09T12:36:14.231748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"0728.284075","doi":"10.1145/2840728.2840753","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Energy-Efficient Algorithms","venue":null,"work_id":"f60a3f9c-a4f0-47cd-af3c-5eff831518c0","year":2016},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:228094cd1aa1d9b34236349873b590de2619d648c2a73e3767a497d7596e11b2","observation_id":"d48f9fc4-4c6b-4e45-b9a2-156500cf7776","resolution":{"observed_at":"2026-07-09T12:36:13.841180Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(92)90260-m","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Razborov","venue":"Theoretical Computer Science","work_id":"5d913a95-ee38-4af7-96e1-45acd5e96c00","year":1992},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:4ac49bf28fc328a24e3e54214fe07fe9abff527a3b9c912e089e8e340b0c714f","observation_id":"06be78c1-36dd-442f-a831-96f27d9a60c2","resolution":{"observed_at":"2026-07-09T12:36:13.809756Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-18T00:21:10.340348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-18T00:21:10.340348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0405044","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"1992 , url =","venue":"SIAM Journal on Discrete Mathematics","work_id":"2cbafd23-d410-4e50-af2a-4762d255ce49","year":1992},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:d701730683c1167a86b5f3ec71c403821698a2f11868b36ecc884436f0690776","observation_id":"40a06bbe-d811-4279-adc0-de266e33d5ec","resolution":{"observed_at":"2026-07-09T12:36:13.743578Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12382","last_updated":"2020-03-25T18:46:23Z","snapshot_observed_at":"2026-07-06T09:07:49.229343Z","submitted_at":"2020-03-25T18:46:23Z","title":"PyMatting: A Python Library for Alpha Matting","version":1},"cited_work":{"arxiv_id":"2003.12382","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.12382","snapshot_observed_at":"2026-07-09T12:36:13.846603Z","title":"PyMatting: A Python Library for Alpha Matting","venue":"cs.CV","work_id":"e108711e-08a7-48f4-b6fc-983036abb333","year":2020},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2003.12382","citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:173ccce44ac679b83bd3b7f5a04a39dbd703f73789d475ae98f4c605bee9854f","observation_id":"8452a130-2198-4658-a41a-0972829a66d7","resolution":{"observed_at":"2026-07-09T12:36:13.848458Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00037-012-0040-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Computational Complexity","work_id":"5921ac48-c19d-4332-a31a-5a59d79d0015","year":2012},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:96b7e90e9f827978d4df4f0d9e566aff6c461a49e44ab7ae7c334513b1bfd2a8","observation_id":"5075c574-971e-43e2-bf08-5b195bda9e8c","resolution":{"observed_at":"2026-07-09T12:36:13.816359Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/130945508","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Testing Probability Distributions using Conditional Samples , journal =","venue":"SIAM Journal on Computing","work_id":"a8a95a04-6dcb-48c6-b7d7-eb8ae8d98bb9","year":2015},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:49434b932da76dff144b40eeaffc456cb00b3314adc4a48650175030bcd4056c","observation_id":"9a3e0ba2-5a40-4194-b31c-37e7b9a08aa8","resolution":{"observed_at":"2026-07-09T12:36:13.785838Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-15T02:38:08.775437+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-15T02:38:08.775437+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539792235864","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Amortized Communication Complexity , journal =","venue":"SIAM Journal on Computing","work_id":"3982ae59-a51e-4c03-8a12-f1e62ee6f5a3","year":1995},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:c1a4cda9d5a22dc8814a5759960cee784b71bfd311f7cebc10abe311ddcc0032","observation_id":"87bd8dac-f984-4f0a-819c-022c34c745fb","resolution":{"observed_at":"2026-07-09T12:36:13.787695Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fsttcs.2017.10","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"047259fa-7d24-4727-962f-b52a814ff4f3","year":2017},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:bc63c99371c69da7f0e0c40005bcf03d72a4bc17164980f47779de1f2fac2cbb","observation_id":"60091f1d-c650-4f16-a600-78e0591a8759","resolution":{"observed_at":"2026-07-09T12:36:13.813402Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2436.242248","doi":"10.1145/2422436.2422485","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2013 , isbn =","venue":null,"work_id":"c929cb44-e534-4a8f-8d50-91450a608aac","year":2013},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:c2f15899be12b6e5ae963c9cb16340cf68e3490fabc2f56666a2b40d291fa8ff","observation_id":"193aa567-15ff-450c-b3ae-f0d0c88c4cee","resolution":{"observed_at":"2026-07-09T12:36:13.829844Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-05-25T11:24:28.875597+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T11:24:28.875597+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+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-07-09T12:36:14.227946Z","title":null,"venue":null,"work_id":"78d059bf-8cf6-4ef6-a08a-27f42b937cc4","year":2014},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:8a4c22dd14982e7968bc1e8e66ef48e4f1309ff9bb0fe275fb2badc1797cb4f8","observation_id":"af7a09f5-9476-4389-8421-76d05bf72180","resolution":{"observed_at":"2026-07-09T12:36:14.229287Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3196.2025","doi":"10.1109/focs63196.2025","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tight pair query lower bounds for matching and earth mover’s distance","venue":null,"work_id":"5fd4b01f-47c3-4faa-a1ac-715b003b010a","year":2025},"citing_paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-07-09T12:30:55.705594Z"},"links":{"citing_paper":"/paper/2607.07396"},"observation_digest":"sha256:73bc7f5c4fb3d5788f5c2daf3f51ab91a1c5320f5a434789959fcc0174ba9e68","observation_id":"e5432ced-47f7-4d11-aa0e-743f7c6833d7","resolution":{"observed_at":"2026-07-09T12:36:13.819166Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.07396","last_updated":"2026-07-08T13:32:29Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-04T23:21:14.210340Z","submitted_at":"2026-07-08T13:32:29Z","title":"Gap-Majority Lemmas in Communication Complexity"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":13,"parse_uncertain":0,"unresolved":2,"verified_exact":38,"verified_fuzzy":4},"total_outbound_references":57},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2607.07396."}