{"as_of":"2026-08-12T09:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e35ed1855f069fd149ffdebd9388571d55d4394bc39e9f175535c8d9babb87b1","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T19:24:43.440406Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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.05944/citation-record","integrity":"/paper/2607.05944/integrity","json":"/paper/2607.05944/citation-record.json","paper":"/paper/2607.05944"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00493-019-4009-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Combinatorica , FJOURNAL =","venue":"COMBINATORICA","work_id":"474ae0d8-08f5-40ae-9ae3-090547f3fffd","year":2020},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:b11f230e360ac051d160eeca7ce84368aa8e96b2a2190dde016489a4545d0436","observation_id":"acaaf5c1-de18-406b-9b78-befc54e9cfdc","resolution":{"observed_at":"2026-07-08T19:25:32.088380Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:21.769197+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:21.769197+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0022-0000(87)90010-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.1016/0022-0000(87)90010-9 A Lower Bound for Read-Once-Only Branching Programs","venue":"Journal of Computer and System Sciences","work_id":"478c17cc-6b43-4c63-a7f6-8d01bde22bac","year":1987},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:1c41e0e94cba5fa35bd141e3238f7e3624d496a1548e3a1a4c0dcfe7f0a1999d","observation_id":"7e20fc72-b766-413a-83b4-f95fa9320e75","resolution":{"observed_at":"2026-07-08T19:25:32.083628Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:22.022913+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:22.022913+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-540-45138-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T19:25:32.054552Z","title":"In: Rovan, B., V ojt´aˇa, P","venue":null,"work_id":"b0df8ffe-01ec-4da0-8bb2-03cec80e8e19","year":2003},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:06d87cdd188d387143bc6e3bcfd2637835741575967ab196bf5b42ebc5f615b6","observation_id":"cf8441fb-7ec0-4f41-93ef-7134a701b420","resolution":{"observed_at":"2026-07-08T19:25:32.056055Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:22.259584+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:22.259584+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01200404","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Razborov, and Roman Smolensky","venue":"Computational Complexity","work_id":"c41155e4-2298-482c-b0c4-4f3952ba85fd","year":1993},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:725b97e49b71ec2f333aec7692bce144fe8dccad467e590a14e548383b2a5cc6","observation_id":"7d75dd89-97ce-42de-9850-8c003926f11b","resolution":{"observed_at":"2026-07-08T19:25:32.060180Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:22.555+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:22.555+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(83)90110-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theoretical Computer Science , VOLUME =","venue":"Theoretical Computer Science","work_id":"46c8a093-d075-42a0-8277-47d16e643360","year":1983},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:574f80790fc8aef0362c4635d66b407ab35aa68c6e47f004a133250755ce46d6","observation_id":"eb15c718-b4a4-49c8-9453-8d4a2beb1f83","resolution":{"observed_at":"2026-07-08T19:25:32.062268Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:22.79891+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:22.79891+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00224-022-10113-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.1007/S00224-022-10113-9 One-Tape Turing Machine and Branching Program Lower Bounds for MCSP","venue":"Theory of Computing Systems","work_id":"98b82c88-95a3-4412-b9fd-6d4f12c0fa82","year":2024},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:0d27ff4178c96fce7b47127393a0e750877e63807049a2cd7d021bc1aaff7749","observation_id":"b3e8e156-cab5-4ff6-b0f0-3959b8e74b1b","resolution":{"observed_at":"2026-07-08T19:25:32.070014Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:23.121395+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:23.121395+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2024.20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.4230/LIPICS.CCC.2024.20 Lower Bounds for Set-Multilinear Branching Programs","venue":"arXiv (Cornell University)","work_id":"c4638ab3-52c4-44d1-a584-935860e42de7","year":2024},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:f5cdbd91881b1ecd3bed9784406711cd77bdbc5f8b9797f3f379d925b9a63aa8","observation_id":"f0b28740-9dcd-43c8-ad47-6acd1dcde01b","resolution":{"observed_at":"2026-07-08T19:25:32.046170Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:23.370746+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:23.370746+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00037-022-00223-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.1007/S00037-022-00223-8 Quadratic Lower Bounds for Algebraic Branching Programs and Formulas","venue":"Computational Complexity","work_id":"52f6c4e8-9fbd-444b-b30f-77892ab98b63","year":2022},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:3a5717639db8339e072a9ea2f5c516d2d06632c28a35aff85d6c6dec68d387a0","observation_id":"301d4f88-83a2-45df-bf3b-daee30157f1e","resolution":{"observed_at":"2026-07-08T19:25:32.078699Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:23.616856+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:23.616856+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2016.33","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Forbes, Mrinal Kumar, and Ramprasad Saptharishi","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"980018aa-ec2c-44db-b58d-b05d0ba96ac0","year":2016},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:1a69fd1ebeaa89dca047b67e4313e021f6d0ce904fdcc0ce325b0aa3fd1572bd","observation_id":"617aa83b-a214-4c9c-8fe3-f7b5fe12ad63","resolution":{"observed_at":"2026-07-08T19:25:32.096353Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:23.851103+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:23.851103+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T19:25:32.658412Z","title":"https://eccc.weizmann.ac.il/report/2026/001 Multilinear Algebraic Branching Programs and the Min-Partition Rank Method","venue":null,"work_id":"45da13e2-d453-4aad-954c-3831152d12f8","year":2026},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:db98b4e17e1a17cdba0305739a3cf12bbca961669e0c3bd1a4a258d532d8388b","observation_id":"a49f1d85-9253-4c85-8bb4-1aae834d6793","resolution":{"observed_at":"2026-07-08T19:25:32.659565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.ccc.2024.31","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T19:25:32.079219Z","title":null,"venue":null,"work_id":"537c5de9-5d83-48d4-a379-ceb2730d1a6e","year":2024},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:47c9a7d71e008429ab653fd384f2716cc882e9aa24b770508dd1b6f7cf8deffb","observation_id":"a6a368d1-25ac-4aee-8916-a9c68febb46a","resolution":{"observed_at":"2026-07-08T19:25:32.080245Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:24.131026+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:24.131026+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2013.34","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Forbes and Amir Shpilka , title =","venue":null,"work_id":"2624fe71-8c9b-4e01-92ca-22023cb64cae","year":2013},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:56c8dac3a194d6c4ecca68b02f8faa3a522d945eb287271a3e58d36cebaae51d","observation_id":"662b6c98-35b4-4e88-8b9b-e323224d846f","resolution":{"observed_at":"2026-07-08T19:25:32.057955Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:24.360656+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:24.360656+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2021.v017a010","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Forbes and Amir Shpilka and Iddo Tzameret and Avi Wigderson , title =","venue":"Theory of Computing","work_id":"7e42a170-3bd0-4181-8e3d-7451e5cc955f","year":2021},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:e8fccb9d9699df5ae3632f14502d285b323f10c50e8aaf67f2f893273df24941","observation_id":"e9eba4b4-7ef4-4917-bdf2-a34180eb134b","resolution":{"observed_at":"2026-07-08T19:25:32.053960Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:24.600011+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:24.600011+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s002009900021","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"title =","venue":"Applicable Algebra in Engineering Communication and Computing","work_id":"a364dbd9-9b8f-4015-8110-935ae6e99a3b","year":2000},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:314722777e7f14c4f192e9eea4adea93322a49cb4126531d27161ebaa08c27c8","observation_id":"07d8eb49-b671-485b-b3e6-383d0d7f94c1","resolution":{"observed_at":"2026-07-08T19:25:32.090326Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:24.857185+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:24.857185+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8260.364961","doi":"10.1145/3618260.3649610","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On Approximability of Satisfiable k-CSPs: IV , year =","venue":null,"work_id":"f11d2141-76b2-47b1-bb93-2b763ec57f47","year":2024},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:ebae46839b370132d9c5bf1629f6cdef8cf73038169489c40310115e26e4fdb6","observation_id":"07fad2b0-2f72-4bb6-a201-467eac54b5b0","resolution":{"observed_at":"2026-07-08T19:25:32.065178Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2006.01.052","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.1016/J.TCS.2006.01.052 Lower bounds for restricted read-once parity branching programs","venue":"Theoretical Computer Science","work_id":"f4046438-1db5-46c8-a652-243732c7cc3c","year":2006},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:bed4efcf924fb2fd6903f821a74e3ccfd373a34ed4a37076fc7c3509c567b291","observation_id":"a8317add-f392-491d-bcb5-f11a8c96fa84","resolution":{"observed_at":"2026-07-08T19:25:32.075361Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:25.347974+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:25.347974+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2326.322341","doi":"10.1145/322326.322341","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.1145/322326.322341 Some Exact Complexity Results for Straight-Line Computations over Semirings","venue":"Journal of the ACM","work_id":"116ba820-00e9-4a59-9fde-c942845abe0d","year":1982},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:4a9eccec5ba70cd13e8319170dccbf77d052db77d31b7b65a450241161a8483b","observation_id":"a757ec04-11be-400f-a828-59cda3a0a2c8","resolution":{"observed_at":"2026-07-08T19:25:32.051555Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:25.689259+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:25.689259+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-642-24508-4","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Boolean Function Complexity - Advances and Frontiers , volume 27 of Algorithms and combinatorics","venue":null,"work_id":"fbe87300-3274-4995-83fe-fef02069072a","year":2012},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:c66f15e6faf5a4a216f1d85ff2be77d55422cb72b70985b0d3af3189b9e72e53","observation_id":"c22c650f-52f7-4e80-a36d-9bbbb485d6c2","resolution":{"observed_at":"2026-07-08T19:25:32.081983Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:25.93344+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:25.93344+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0214050","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"TITLE =","venue":"SIAM Journal on Computing","work_id":"0e4a68ff-3d80-49fc-bfa8-8d49c7dc7f3a","year":1985},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:3106268dd61653e92eab3570603a693a749dd730481bf0fd2c4b0c8d5212a5f8","observation_id":"d57ecb6f-f525-4a48-97d7-e9a05fd013da","resolution":{"observed_at":"2026-07-08T19:25:32.039872Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:26.19162+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:26.19162+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1993.336536","doi":"10.1109/sct.1993.336536","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On Span Programs","venue":null,"work_id":"1e3491c2-dc7a-4abb-a977-970ba1f8395b","year":1993},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:5bae2fce9f1dd94b90d19b85d8772771736ce9954812ce9f32cfc2db41442286","observation_id":"f2b73ea1-c240-4bb9-91a5-762106635614","resolution":{"observed_at":"2026-07-08T19:25:32.027884Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:26.43953+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:26.43953+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T19:25:32.661736Z","title":"https://www.cse.iitb.ac.in/ nutan/papers/abp-complexity.pdf Homogeneous ABP complexity of elementary symmetric polynomial , 2019","venue":null,"work_id":"f9ab0518-261b-457a-a84a-ebdc076c5d8e","year":2019},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:c76cce043fafc08f4c4a8153a91d4ec628ad32250893a5d965f24d59f804a0ef","observation_id":"8f32ee0c-6c61-4659-ae3d-e60630756630","resolution":{"observed_at":"2026-07-08T19:25:32.662972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3734215","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T19:25:32.029137Z","title":"http://dx.doi.org/10.1145/3734215 Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits","venue":null,"work_id":"40ce8744-1e05-4396-8e09-86cbded61a7f","year":2025},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:85f07d1660a5fbd7ade9d24e85493426a74e105c60fac2cfc8eb54eb5ab8e09f","observation_id":"0aa8dea8-2410-4dea-abcd-6782e6de0b75","resolution":{"observed_at":"2026-07-08T19:25:32.033239Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:26.718386+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:26.718386+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T19:25:32.654850Z","title":"https://mathoverflow.net/questions/264226/singular-locus-of-zero-set-of-elementary-symmetric-polynomial Singular locus of zero locus of elementary symmetric polynomials , 2017","venue":null,"work_id":"42d32407-7cfe-4ecb-ab37-3fa0daf59976","year":2017},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:4a0c45947a341bf09441052b4cf886013d04cdbb744e4bef139ba689929c8324","observation_id":"0d58a791-6526-4a19-9131-8f998160c5ee","resolution":{"observed_at":"2026-07-08T19:25:32.656167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T19:25:32.656742Z","title":"http://mi.mathnet.ru/dan32449 On a Boolean function","venue":null,"work_id":"e5192325-63c3-49b4-a90a-d9a01439f51e","year":1966},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:fc53e51783ba5f5081a0f5b34f3547b1a34c0bdf37a570ad8426fbf30fce0a07","observation_id":"210c4935-c50b-4144-857b-c3e17291ec4f","resolution":{"observed_at":"2026-07-08T19:25:32.657876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3418.103462","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T19:25:32.041275Z","title":"http://dx.doi.org/10.1145/103418.103462 Lower Bounds for Non-Commutative Computation (Extended Abstract)","venue":null,"work_id":"ae79395f-667a-45d6-87ef-6dda435453cd","year":1991},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:a8dc4dd8bac9b8bdfa751b70592608b66c09cbcbd75b9b66b6515d989daa14ca","observation_id":"b103eb24-2545-4a43-9e21-d66cc33334af","resolution":{"observed_at":"2026-07-08T19:25:32.043139Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T19:25:32.660095Z","title":"Okolnishnikova","venue":null,"work_id":"74f8b987-f1c4-468a-a77c-08dff435b3f5","year":1991},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:702f31ffabaa938a644120244da584cc927b2743f6f46866170c720d92b4a4a2","observation_id":"e5ba3cf7-fe55-4870-ab0d-e159877a4aa2","resolution":{"observed_at":"2026-07-08T19:25:32.661157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T19:25:32.663576Z","title":"https://eccc.weizmann.ac.il/report/2025/128 Computing the Elementary Symmetric Polynomials in Positive Characteristics","venue":null,"work_id":"7bf4ba01-1582-4a9e-9e34-304a69680d7e","year":2025},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:5455309ffe85bead7b8117a29f0ca061ca2af6e7cd6d6812dedb32779600fe01","observation_id":"36f157f7-5a4a-441d-bcb9-039c7b7f0128","resolution":{"observed_at":"2026-07-08T19:25:32.664716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2006.v002a006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Theory Comput","venue":"Theory of Computing","work_id":"9589c0e8-ceee-409e-95bf-106268897a7a","year":2006},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:4a04aae462a096d29c97ac635ab53db5f55adc9231764167307e0fb5b3bf7a55","observation_id":"345c3a28-2422-4ee5-b147-1d83a6937ce4","resolution":{"observed_at":"2026-07-08T19:25:32.092279Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:27.190733+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:27.190733+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2793.150279","doi":"10.1145/1502793.1502794","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Vazirani","venue":"Journal of the ACM","work_id":"4e61312f-df29-4556-accc-13f9912ce8b8","year":2009},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:ccc8e109af79298c9a399f04194f15b9984c54fbd4580afaa54ae986b421f87c","observation_id":"ed53c52a-0eb2-44d1-b61f-822573037cef","resolution":{"observed_at":"2026-07-08T19:25:32.068220Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-05-20T09:56:37.376071+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-20T09:56:37.376071+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/070707932","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.1137/070707932 A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits","venue":"SIAM Journal on Computing","work_id":"6ee37fdb-aefe-43ac-9eb3-f797c7a7218b","year":2008},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:efe4c48faf46eda8a4d543d08622bf400c602f7a7600122430b4114e96a7078a","observation_id":"de5f274a-6339-4a03-b8a4-60adda4ad800","resolution":{"observed_at":"2026-07-08T19:25:32.048389Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:27.688833+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:27.688833+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00037-008-0254-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"volume = 17, number = 4, pages =","venue":"Computational Complexity","work_id":"14328089-432e-471f-8562-baecac5648b7","year":2008},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:69e19b174bb7fe45352defd8cb7f2c343295fd69a692cedccd10e363d2841505","observation_id":"b78c352e-5991-4559-9436-712541e707e3","resolution":{"observed_at":"2026-07-08T19:25:32.073629Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:27.938258+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:27.938258+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00037-009-0270-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computational Complexity , VOLUME =","venue":"Computational Complexity","work_id":"4c4a4bbd-c743-40a6-a53a-3cd45e1f657b","year":2009},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:3cf247e0a3d043dfdedc9d146dcfd904f1f251507e3c12356846acb45083b964","observation_id":"7360c9a1-d508-4514-bc0f-f866c39210bd","resolution":{"observed_at":"2026-07-08T19:25:32.077073Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:28.197172+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:28.197172+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+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-08T19:25:32.653098Z","title":"https://github.com/dasarpmar/lowerbounds-survey/releases/ A survey of lower bounds in arithmetic circuit complexity","venue":null,"work_id":"192c1eda-dc89-4926-95d3-60e30554c31f","year":2015},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:9d97131240eea1bd890a00adadc2d7a90afcdca229e3506dbae0071340d8c424","observation_id":"d464bc4a-fe6d-42e9-a800-895cd7a3da92","resolution":{"observed_at":"2026-07-08T19:25:32.654303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2005.03.016","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T19:25:32.092875Z","title":"http://dx.doi.org/10.1016/J.TCS.2005.03.016 A hierarchy result for read-once branching programs with restricted parity nondeterminism","venue":null,"work_id":"0415ac23-2059-4466-bac2-ccb5d4acf199","year":2005},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:1370ac43dc96167e410fea3f5b0a52f649a1085de9ffbc30cec6e34be5d4584a","observation_id":"175338af-f760-43a1-8042-f4f6c3448696","resolution":{"observed_at":"2026-07-08T19:25:32.094340Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:28.445618+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:28.445618+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01436566","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Numerische Mathematik , VOLUME =","venue":"Numerische Mathematik","work_id":"7bcaeaf5-0434-4921-bd0a-6245cf27f3e3","year":1973},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:5c7b6baa6253c8956804a6ddeac1da184a8915f12b3aa1234c866550ac8e0e7e","observation_id":"160cd0b6-3ad6-498a-8a85-c8815bca41ed","resolution":{"observed_at":"2026-07-08T19:25:32.071791Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:28.696639+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:28.696639+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1561/0400000039","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.1561/0400000039 Arithmetic Circuits: A survey of recent results and open questions","venue":"Foundations and Trends® in Theoretical Computer Science","work_id":"5371b4c5-41ac-4928-8fa0-462b1fcf9f0f","year":2010},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:9eee0f8b096f7a195fab3de98252183fa58a2fc4d532ddc3fc016529d0b05b3f","observation_id":"8dbe7f75-2154-4efb-99ca-f143e140fc77","resolution":{"observed_at":"2026-07-08T19:25:32.035606Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:29.020623+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:29.020623+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6698.276881","doi":"10.1145/276698.276881","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thathachar","venue":null,"work_id":"a4c3e835-69bd-45d6-b0f8-0f6b1bf95268","year":1998},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:e5f4492edb10f2f4ee22262b5f82297bab8428698fbc6e6dbce183357b897110","observation_id":"57c1fa73-911b-4469-8ac2-6624ed111b41","resolution":{"observed_at":"2026-07-08T19:25:32.086170Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:29.260441+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:29.260441+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2282.46161","doi":"10.1145/42282.46161","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.1145/42282.46161 On the complexity of branching programs and decision trees for clique functions","venue":"Journal of the ACM","work_id":"cfb474c8-a78e-457a-9c85-0fac089e2f2d","year":1988},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:9692e39319f22561c8738dbe95a61e9d85051dc2f484daa92ac97d73fd39733d","observation_id":"8472ed64-c181-4585-b9fd-d7bf107e4902","resolution":{"observed_at":"2026-07-08T19:25:32.099169Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:29.512604+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:29.512604+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0030340","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"http://dx.doi.org/10.1007/BFB0030340 An Exponential Lower Bound for One-Time-Only Branching Programs","venue":"Lecture notes in computer science","work_id":"f776ce9e-e5ae-4332-8ac1-d9c626cb4d92","year":1984},"citing_paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-07-08T19:24:43.440406Z"},"links":{"citing_paper":"/paper/2607.05944"},"observation_digest":"sha256:06162e7c9f84ea5fff9b46aa85bd51f493f880736d278747f8b90b172c4f6e9b","observation_id":"1b7dc0c5-0f98-4934-91fc-1edf1bca5763","resolution":{"observed_at":"2026-07-08T19:25:32.037708Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-07-11T06:20:29.783544+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T06:20:29.783544+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.05944","last_updated":"2026-07-07T07:43:30Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-09T06:20:15.153625Z","submitted_at":"2026-07-07T07:43:30Z","title":"A Lower Bound for Read-Once Parity Branching Programs"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":10,"parse_uncertain":0,"unresolved":0,"verified_exact":22,"verified_fuzzy":7},"total_outbound_references":39},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2607.05944."}