{"as_of":"2026-08-21T08:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:da8d8b5fb15e7403293ba51d7e6c517528c4d061f3314a8a2c574d3a2b5be9fe","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T17:11:31.666266Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2507.12124/citation-record","integrity":"/paper/2507.12124/integrity","json":"/paper/2507.12124/citation-record.json","paper":"/paper/2507.12124"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539701389944","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Razborov, and Avi Wigderson","venue":"SIAM Journal on Computing","work_id":"722af45e-3b16-4a86-b856-4ba05d5f460f","year":2004},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:29.729837Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:931a3327ff470dc88d1526cc09114a31f03f608f085e3e7abcce07897ad26e9d","observation_id":"c3c47b1f-51e0-4873-bdd4-0e0330b2fdef","resolution":{"observed_at":"2026-08-06T17:11:32.535525Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:29.826982Z","title":"Lower bounds for k-dnf resolution on random 3-cnfs","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:29.826982Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:e7114fc52861a92488c7a8795e8d9f3fbeaee4e02493f87b1ea0a6163ccca16d","observation_id":"6a810765-b337-4026-8f9d-faee1d08f9ff","resolution":{"observed_at":"2026-08-06T17:11:29.826982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:34.275251Z","title":"Razborov","venue":null,"work_id":"a0424439-73f0-4bb6-91b5-61e3a3ee259c","year":2003},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:30.001594Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:cb4ce3df3705b4d370895cdb54a4d5b256e429e6bfb0e9d12126f9b3a4443436","observation_id":"9b47d596-ed65-4308-bf35-f12be56630c9","resolution":{"observed_at":"2026-08-06T17:11:34.289003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539700369156","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Karp, Toniann Pitassi, and Michael E","venue":"SIAM Journal on Computing","work_id":"3b9992c0-f8b2-4146-bd3b-24a1c102488f","year":2002},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:30.188361Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:444f7fcc39f76f741aa08a60030c92c37e9875e375b6c2e7250d3d3ea8ae7d93","observation_id":"dd6b9b6e-856c-4feb-b465-b6cdcefee6cc","resolution":{"observed_at":"2026-08-06T17:11:32.465580Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:30.312847Z","title":"Lower bounds for lov[a-acute]sz--schrijver systems and beyond follow from multiparty communication complexity","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:30.312847Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:74ff33a0c747a4394456c0d3264d7d5632326c6330c57a2eb77b4216266bac95","observation_id":"3a0a6e8c-c597-439a-bdce-84f6f3d179fb","resolution":{"observed_at":"2026-08-06T17:11:30.312847Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:30.503371Z","title":"Multiparty Communication Complexity of Collision-Finding and Cutting Planes Proofs of Concise Pigeonhole Principles","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:30.503371Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:50324e6112cfc84170c047e7726da18cf1bb431a240b866e2d34f91a58861035","observation_id":"0f3c6634-c7e0-4961-8ac3-e41daeb0c524","resolution":{"observed_at":"2026-08-06T17:11:30.503371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8014.48016","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:34.077305Z","title":"Many hard examples for resolution","venue":null,"work_id":"26652f5b-2a79-44e3-9529-e2ebd8982215","year":1988},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:30.619440Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:bcdbc37b10d72497a28a4227ac9f6e594b7dc116865f86a663e418d626b4ea1c","observation_id":"bae64d65-685f-4ef3-a6e1-04b88c90e5b0","resolution":{"observed_at":"2026-08-06T17:11:34.091940Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2016.40","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"de Rezende, Jakob Nordstr \\\" o m, and Marc Vinyals","venue":null,"work_id":"0c48b538-900a-407c-87b0-61aa41c407cc","year":2016},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:30.937032Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:f0361abd4192ab08c8755d3b7cdea11c6c080551f3c09e03439704f361ecb1ec","observation_id":"dfeedae5-f26f-4085-aa1a-ecb47093b7e3","resolution":{"observed_at":"2026-08-06T17:11:32.391958Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T17:11:34.204716Z","title":"Complexity theoretic limitations on learning dnf's","venue":null,"work_id":"b9e70d8f-ed3b-4e8c-b8d7-17fa0a31d200","year":2016},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.147238Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:2efe1f773a97639f99371e78a4864cbdb2707d1ce28ed07422f3a5aa97842176","observation_id":"6925eadd-74d4-4e81-ac63-2cfe49c8a34e","resolution":{"observed_at":"2026-08-06T17:11:34.213650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10006","last_updated":"2020-11-02T12:22:00Z","snapshot_observed_at":"2026-08-02T22:24:29.769993Z","submitted_at":"2020-02-23T22:51:52Z","title":"On the Modularity of Hypernetworks","version":2},"cited_work":{"arxiv_id":"2002.10006","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.10006","snapshot_observed_at":"2026-08-06T17:11:33.775628Z","title":"On the Modularity of Hypernetworks","venue":"cs.LG","work_id":"9ff0dfb5-6ed2-427c-aaba-5b4fe6104dfb","year":2020},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.175888Z"},"links":{"cited_paper":"/paper/2002.10006","citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:370085d9cb3e1e7478225de71c68bbcab32083892dc12f97f933330d845419b4","observation_id":"7c09e041-226b-4816-879c-52bb6ca0e833","resolution":{"observed_at":"2026-08-06T17:11:33.789074Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3486680","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Random ( n) -CNFs are Hard for Cutting Planes","venue":"Journal of the ACM","work_id":"67886058-91ca-4bbc-8ca5-b81d758870e6","year":2022},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.235868Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:4cab93ea65599832ff454c47365ed965544769371e9581cb150adf87a182bc22","observation_id":"5b3cf6d3-73ad-454e-bd9c-ca8d0cc47a40","resolution":{"observed_at":"2026-08-06T17:11:32.337601Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.289790Z","title":"Quantum communication advantage in tfnp","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.289790Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:d544998d9245c9551270358f2066958b109184105d863e43466910fcafa72740","observation_id":"146d72ac-f481-4f90-b4cf-ce760bbdb3be","resolution":{"observed_at":"2026-08-06T17:11:31.289790Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.322928Z","title":"Monotone circuit lower bounds from resolution","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.322928Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:b1bdb080990ca5b6432ac355d17d2044150fa687fa998ba75c49d074b8d1c49f","observation_id":"232ac06b-a8a3-422f-bf2c-6197a7fcfa12","resolution":{"observed_at":"2026-08-06T17:11:31.322928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.375785Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.375785Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:fcbb2431558c65c7fbcb94b164aae8cffdbf8cec14d748085b94c0b0812a7a28","observation_id":"9d6b19ea-961e-4e71-b6e5-fbce1b452560","resolution":{"observed_at":"2026-08-06T17:11:31.375785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.382211Z","title":"Extension complexity of independent set polytopes","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.382211Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:82ee8ca5f7e249ac85f4b21990bd6600d1caab16338c4fa1754b9296397b0644","observation_id":"b097e1bd-cb68-4aec-b657-88616e88504c","resolution":{"observed_at":"2026-08-06T17:11:31.382211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.388468Z","title":"Adventures in monotone complexity and TFNP","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.388468Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:d38bdf687aa7cdd6660a2b8bb2182a2cfe2833214b740bf9a76ed24712ba90ab","observation_id":"782ba537-bfdd-4da6-afd1-e25e4de28079","resolution":{"observed_at":"2026-08-06T17:11:31.388468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/15m103145x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Rectangles are nonnegative juntas","venue":"SIAM Journal on Computing","work_id":"9f8ea9dd-3ac6-47ed-a4d0-c071445c37e1","year":2016},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.394659Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:8d242056fd64b743548c0f767d4dfdc5dcd7eaa31d43dad198351ea6db27faa8","observation_id":"c0817972-525d-428b-8456-be60689a76d6","resolution":{"observed_at":"2026-08-06T17:11:32.196433Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.403781Z","title":"Supercritical tradeoffs for monotone circuits","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.403781Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:02bf7202414fd55417c3d413f3e7791b1e6b25fbc0bbeb4c838774f5da78fcc8","observation_id":"d2084f1b-e217-45c4-914e-9aab5a11d15d","resolution":{"observed_at":"2026-08-06T17:11:31.403781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.414868Z","title":"Hardness condensation by restriction","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.414868Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:ade61a1399d388c62806c203edb8f5b6bfacee8982bb8ecc31e4e20703baf42e","observation_id":"fffc3b1b-c223-45c1-9763-598709961f31","resolution":{"observed_at":"2026-08-06T17:11:31.414868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.431588Z","title":"Communication lower bounds via critical block sensitivity","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.431588Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:77cd66205ea37abe08ee455b3fd42de5cabb510b9f8f3636fe936959d0374340","observation_id":"2577db6d-ed04-483d-9dab-b5e3f01f807d","resolution":{"observed_at":"2026-08-06T17:11:31.431588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.440259Z","title":"Query-to-communication lifting for BPP","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.440259Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:670670f88db4994afea83a263b0abfa89f97bb6289ce478d05c281060216bc8f","observation_id":"5374d4d4-3c6b-4aad-ad18-1c58b3491e40","resolution":{"observed_at":"2026-08-06T17:11:31.440259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0304-3975(00)00157-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Linear lower bound on degrees of positivstellensatz calculus proofs for the parity","venue":"Theoretical Computer Science","work_id":"c7de9487-b34d-456f-a7e1-915cf005f71e","year":2001},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.446835Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:14e3def4761d049d2fbaccc3acd989a371c6000bf76a6a065969e8af7df8162e","observation_id":"4044ffab-7dc0-45d1-8687-caf387fc50a8","resolution":{"observed_at":"2026-08-06T17:11:32.117846Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.454527Z","title":"On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.454527Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:4d0ffc75eb3d2468cc876be1259ac00753bf660c184063292edb7279ba2483c7","observation_id":"0f9d2e90-bd3c-4a68-bea4-b2559b2977d9","resolution":{"observed_at":"2026-08-06T17:11:31.454527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2017.20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Random formulas, monotone circuits, and interpolation","venue":null,"work_id":"2677863a-ca18-4d64-b718-c5481fb82a4c","year":2017},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.463410Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:e59c387a142f842eca0543e06c7ddbc5a77f85f2113343cb845b792e53e33fa0","observation_id":"fc3305f7-93b2-4aed-97b8-bfee0a931679","resolution":{"observed_at":"2026-08-06T17:11:32.079689Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1994.31606","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:33.187155Z","title":"Upper and lower bounds for tree-like cutting planes proofs","venue":null,"work_id":"68b60384-db44-4ec8-8c0c-8c6cd659040e","year":1994},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.474957Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:847d7d9c020b3dca790952e95c291bfa322496135eede3ca7957afb420394df2","observation_id":"bcd4a6d3-cb3e-4dd4-a78a-b287db46b6a1","resolution":{"observed_at":"2026-08-06T17:11:33.203595Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.482693Z","title":"Proof complexity of natural formulas via communication arguments","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.482693Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:0b5ccac72944a9812b9131ff431a58b9954ad2e729915ff64be2aee89983acbe","observation_id":"466807ca-5e2c-48de-93da-17e17c5c9dc0","resolution":{"observed_at":"2026-08-06T17:11:31.482693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.10272","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:33.062342Z","title":"Resolution over linear equations modulo two","venue":null,"work_id":"01b06af0-df0b-4c82-8d66-42fdf4437b5a","year":2020},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.491101Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:964921441c2441ebedda3fa22d9eb50d552745e6182629d8ec2d9aeccfabfbd4","observation_id":"d0fae763-00e3-430f-8d50-78090f56f4da","resolution":{"observed_at":"2026-08-06T17:11:33.084999Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.501473Z","title":"Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.501473Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:f390e63eff6c2eaf1a1fa5eeb81095ed71101124eeaa4fa6911eae4c28bc4501","observation_id":"94502fc9-eac6-4374-bb5d-13321579a221","resolution":{"observed_at":"2026-08-06T17:11:31.501473Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0403021","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Monotone circuits for connectivity require super-logarithmic depth","venue":"SIAM Journal on Discrete Mathematics","work_id":"7b1b6e84-40e0-4325-b0f7-9cb84fac90ab","year":1990},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.518186Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:285ab68681d926e6b99d2a7229725712ada61d0c48fccb62284ebb5b39d8e3d8","observation_id":"08ad0ab5-907d-44fa-99c3-ebdcb5f6c842","resolution":{"observed_at":"2026-08-06T17:11:31.980730Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.534363Z","title":"Lifting with sunflowers","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.534363Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:5459aa90d574c68e4285a3fa8e0803d7a87414ff125a33785ea69bb757731fd8","observation_id":"02463312-d4db-4df6-b93b-e9ed0920bc60","resolution":{"observed_at":"2026-08-06T17:11:31.534363Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.544958Z","title":"Search problems in the decision tree model","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.544958Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:b35efad609e4c69edc827f749754a8c50b5dd041376bae2f9728e4799f2e6355","observation_id":"801785b7-1b19-4345-9550-599e4bf154a0","resolution":{"observed_at":"2026-08-06T17:11:31.544958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.554851Z","title":"Analytic and algorithmic solution of random satisfiability problems","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.554851Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:bd7a73aaca6d64d7b71b9e5f24cfef5170a9c37dfb89bbd35bd8198968542735","observation_id":"5bfd6985-ee8d-4606-9287-01f3fb13f706","resolution":{"observed_at":"2026-08-06T17:11:31.554851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.565333Z","title":"Lifting nullstellensatz to monotone span programs over any field","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.565333Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:3921bd45e1b2c756c9f3daa58a2b1a45c63df48ffc30ae76b0aceb990bf4853e","observation_id":"8bc1bda9-1e40-4384-bcb4-7d1775936321","resolution":{"observed_at":"2026-08-06T17:11:31.565333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.577038Z","title":"Lower bounds for resolution and cutting plane proofs and monotone computations","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.577038Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:c891c5310b20aa02e566f7308e4f2b72b0cd2906180ad9ecd9ab3059b20942b3","observation_id":"e94e204c-e33b-4bad-8460-198f74fd37c1","resolution":{"observed_at":"2026-08-06T17:11:31.577038Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02122698","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Razborov","venue":"COMBINATORICA","work_id":"71c24c5b-0f35-4636-8521-b89ef7857486","year":1990},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.587320Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:de9326099f6612002432817e536b5e76bc4ac78af0a0ea34b3c280fab3ff5cd8","observation_id":"7b050e51-c532-4441-85fa-4deacff54374","resolution":{"observed_at":"2026-08-06T17:11:31.830085Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.604827Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.604827Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:2ef404bf695ca7b05f4ccef6534734040a8126d3dbe901760461251dfaae7a6b","observation_id":"765dd5d1-6f43-4e66-ac49-84aa35026f53","resolution":{"observed_at":"2026-08-06T17:11:31.604827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.617696Z","title":"(semi)algebraic proofs over \\( \\) 1 variables","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.617696Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:d8699066a026fc994b3061935a2c08f79a252a928640a372d63aface3b88e680","observation_id":"feefe13f-93e8-4222-9805-a5c92289e9f4","resolution":{"observed_at":"2026-08-06T17:11:31.617696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:34.162764Z","title":"A lower bound for k-dnf resolution on random CNF formulas via expansion","venue":null,"work_id":"963cd4bb-9e73-4d73-bb8f-9fb76a2938b8","year":2022},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.636397Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:a9c0d547bd6504da6175ad8ad0309e7f8916419e8524296500472225649f7eb4","observation_id":"7531ca09-2fb2-49b7-b5d2-c2c2847dc419","resolution":{"observed_at":"2026-08-06T17:11:34.178725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06T17:11:34.115229Z","title":"Communication Complexity of Set-Intersection Problems and Its Applications","venue":null,"work_id":"d068c765-0421-42e2-9709-3e0688ebcc29","year":2023},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.654958Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:322df10d47369927de94ec778aadc5493dc2f9a138d2dbb8f57a585ce2eb4a23","observation_id":"0db557fd-8a14-4f07-ba72-e6b87a4daed6","resolution":{"observed_at":"2026-08-06T17:11:34.124147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T17:11:31.666266Z","title":"Communication lower bounds for collision problems via density increment arguments","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T17:11:31.666266Z"},"links":{"citing_paper":"/paper/2507.12124"},"observation_digest":"sha256:742af2a901765ea2ea4a98e07d3ddff9456b0e022d78bb742d4e40449d6dbd6c","observation_id":"a84f4752-d96b-4f2b-ae42-7a1f435007ae","resolution":{"observed_at":"2026-08-06T17:11:31.666266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.12124","last_updated":"2025-07-16T10:48:39Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-21T05:22:36.680504Z","submitted_at":"2025-07-16T10:48:39Z","title":"Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":23,"verified_exact":10,"verified_fuzzy":4},"total_outbound_references":40},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2507.12124."}