{"as_of":"2026-08-20T23:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed1600481661c36a88c220a6a419e4cfbee052ba909a01afb224b5bb01aa8456","coverage":[{"denominator":57,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":57,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T19:42:17.236516Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.06552/citation-record","integrity":"/paper/2412.06552/integrity","json":"/paper/2412.06552/citation-record.json","paper":"/paper/2412.06552"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.098961Z","title":"Lifting Dichotomies","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.098961Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:cf754adf55df76d7a13e3d807343d46435cb080597e07f3b1c7e4838386a08fd","observation_id":"320d42ce-e69b-46f0-ae95-c5c4fe8a0135","resolution":{"observed_at":"2026-08-11T19:42:17.098961Z","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-11T19:42:18.348360Z","title":"Lifting to bounded-depth and regular resolutions over parities via games","venue":null,"work_id":"a095e7c5-e378-4b0f-aea0-b2a56d57a533","year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.101898Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:a13fd6011453a907cc79757e90633e7ef32d93daf139cc91042f909d81e48ce5","observation_id":"5bd20e8f-2d7f-4f4c-97cb-793c563c83e1","resolution":{"observed_at":"2026-08-11T19:42:18.351168Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.104422Z","title":"Optimal separation and strong direct sum for randomized query complexity","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.104422Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:02db7a7a76a73b4d451a97159d12464d5561d2671626131e640ef2bb9ea9cb10","observation_id":"d31240e7-8967-42bc-8037-88f33851f4d8","resolution":{"observed_at":"2026-08-11T19:42:17.104422Z","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-11T19:42:17.107052Z","title":"A tight composition theorem for the randomized query complexity of partial functions: Extended abstract","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.107052Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:aa773d76e5b65243eb2f955001ccf98d32558aa40b3a4e2eebef215a225474c6","observation_id":"56a03121-48cd-4e40-9e18-66d55754be48","resolution":{"observed_at":"2026-08-11T19:42:17.107052Z","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.1145/3626514","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.472329Z","title":"A new minimax theorem for randomized algorithms","venue":null,"work_id":"633bf28e-c87e-442a-aeb0-589099543969","year":2023},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.109243Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:57d5f35eb450fcb4d1d79f6db145363063475f0d5c02175a1f09bb7a7c959e4e","observation_id":"c5a4c44c-4f55-405c-a5ae-09d581b60f42","resolution":{"observed_at":"2026-08-11T19:42:17.475388Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/100811969","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.464854Z","title":"How to compress interactive communication","venue":null,"work_id":"e19fe606-17a1-4693-b66f-b7bb60575161","year":2013},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.111762Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:32513523c04e7c695ec94811b61e83b36e18cd6a0b739c8ab5082facc4f9d0c1","observation_id":"9903dc78-53c4-4e46-9ead-03d816414bd9","resolution":{"observed_at":"2026-08-11T19:42:17.467639Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.114328Z","title":"Randomised Composition and Small-Bias Minimax","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.114328Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:9df3ba6bc3a196c311d3804553ba303ff7abb814e157df8c3b218ffd9ac03c4f","observation_id":"c2ceb8ff-4392-42d2-ab78-9a57e0272f2a","resolution":{"observed_at":"2026-08-11T19:42:17.114328Z","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.4230/lipics.ccc.2024.23","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.457236Z","title":"Exponential Separation Between Powers of Regular and General Resolution over Parities","venue":null,"work_id":"b6211110-c176-44ca-a110-8fe1f2fc0191","year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.116813Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:e64848e82f1c463c402377bfb27e219766390c2a27af763bc6d6bfbd9b9ff8b7","observation_id":"88c782e9-cb41-4047-895c-4b38f93275fc","resolution":{"observed_at":"2026-08-11T19:42:17.460042Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/sfcs.1986.15","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.449393Z","title":"Complexity classes in communication complexity theory","venue":null,"work_id":"bff5458f-f9c8-4513-b5b2-23a68b200529","year":1986},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.119246Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:7b4d2dcd964db23a0d979805f1a7a60254b8b307df3e49b8db660e73a0e3dd29","observation_id":"2e839084-6bbf-40c8-b15c-c070aa1164d4","resolution":{"observed_at":"2026-08-11T19:42:17.452230Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.121759Z","title":"When Is Amplification Necessary for Composition in Randomized Query Complexity? In Approximation, Randomization, and Combinatorial Optimization","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.121759Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:d8af82001ed2f92ebdeefa65e16058f8ceb254f3a2b9e0b3ed9048841cf0e273","observation_id":"f12a4f14-d56d-4145-aa41-6156953ea9f8","resolution":{"observed_at":"2026-08-11T19:42:17.121759Z","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-11T19:42:17.124199Z","title":"Information lower bounds via self-reducibility","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.124199Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:1a28a5b74d4b45bf8cf50a84564fe0572cd9374d42f21faf2c9ffde2da7b4cc9","observation_id":"0f93e58c-f2eb-4c5f-81a0-dfbe1fec6b89","resolution":{"observed_at":"2026-08-11T19:42:17.124199Z","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-11T19:42:18.339344Z","title":"Lifting to randomized parity decision trees","venue":null,"work_id":"f70d1b31-a421-4e61-a8fb-817a01f58535","year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.128050Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:d66a69902ea9250f73cd9a16e74fa071465f4ef9f9fd0718b2a7f1a164551017","observation_id":"f6d59860-d9c1-4a3e-b024-0cd0a7cf5b41","resolution":{"observed_at":"2026-08-11T19:42:18.342196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.130443Z","title":"Randomized query complexity of sabotaged and composed functions","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.130443Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:305fc78715c97e1ac4a6bfe64680c380ec5f75747ffe5228631301bb691ca2be","observation_id":"2a6c414c-04e5-42e4-aaab-b091574c8080","resolution":{"observed_at":"2026-08-11T19:42:17.130443Z","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.4230/lipics.itcs.2023.14","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.429756Z","title":"On Disperser/Lifting Properties of the Index and Inner-Product Functions","venue":null,"work_id":"74b01f6c-11f7-4212-afbc-64745a75cdeb","year":2023},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.132889Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:ae5ccf146fe397bdf079bff6f83145bea36d480f3010f3716b9ace68ed895260","observation_id":"14f459d4-e812-4747-a758-8f087412ce9c","resolution":{"observed_at":"2026-08-11T19:42:17.432470Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2023.v019a011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.423160Z","title":"A strong XOR lemma for randomized query complexity","venue":null,"work_id":"72b0d999-cbcd-4c12-9298-548832d722c4","year":2023},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.135356Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:b578e1568b8f0d54983d0854b96098568cfef6e2675fb0ec0b32650cb5b5da83","observation_id":"0694ac2d-0cd6-41b1-811e-53fbdaefea50","resolution":{"observed_at":"2026-08-11T19:42:17.425404Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.137754Z","title":"A Strong Direct Sum Theorem for Distributional Query Complexity","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.137754Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:a71c8c3724ede0feceabc27faecdf97b641a11c258efa4545b8d04f72f0726c5","observation_id":"5f6b2a82-c846-4126-b71c-868cfb6d0fd2","resolution":{"observed_at":"2026-08-11T19:42:17.137754Z","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-11T19:42:17.140353Z","title":"Information equals amortized communication","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.140353Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:3ff39a75cf125f767d88f1b1fe0014864c7f405d76cfb11510653d31763d69a4","observation_id":"4018af53-1d88-49e5-8de6-df52099443ac","resolution":{"observed_at":"2026-08-11T19:42:17.140353Z","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-11T19:42:18.331203Z","title":"Super-critical trade-offs in resolution over parities via lifting","venue":null,"work_id":"c9c89aac-8b9e-4854-8123-277daaf04982","year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.142736Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:431244ee6939983f12cfa053059d3786bac1a01c61fd9cd0e9d9602fd0d9228f","observation_id":"a8b77061-6d76-4591-b840-dd5abddef750","resolution":{"observed_at":"2026-08-11T19:42:18.333861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.145191Z","title":"Boolean functions with small approximate spectral norm","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.145191Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:ca838efef6ee3d2b143b01768477f9fe8a03ea629a88fcc29f41ccaaf5306f9a","observation_id":"3f7126c0-30a1-4637-bae8-cc7da9d0f78c","resolution":{"observed_at":"2026-08-11T19:42:17.145191Z","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.4230/lipics.itcs.2023.33","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.409149Z","title":"Lifting to Parity Decision Trees via Stifling","venue":null,"work_id":"2f08af31-926b-41a3-a9bc-e935142a5672","year":2023},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.148080Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:401598c3cb22237b88caff9df95f269efd7dda1e21ca47f4e3e00956837e92cb","observation_id":"bca5d453-6c82-4dba-9c18-b07bfc39bbda","resolution":{"observed_at":"2026-08-11T19:42:17.411472Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.150590Z","title":"Improved direct product theorems for randomized query complexity","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.150590Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:579bffee78f5031a6ba783b9921329f326b7a8084ada062f9274a6236b067262","observation_id":"f9f3752e-3b8e-42d0-bd09-758e87b14000","resolution":{"observed_at":"2026-08-11T19:42:17.150590Z","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-11T19:42:17.153092Z","title":"Lower bounds for regular resolution over parities","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.153092Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:f8a9755f981cde51f41e07d74fc1a287e1d08c3065ba9fe04ffcbce4e6e31e54","observation_id":"3d7acdb0-9999-4bb5-981f-614a80cbffc4","resolution":{"observed_at":"2026-08-11T19:42:17.153092Z","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.4230/lipics.itcs.2024.48","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.398582Z","title":"Proving Unsatisfiability with Hitting Formulas","venue":null,"work_id":"bbef7656-446f-4be3-9abe-90affd763d7c","year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.155509Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:e138bc97ee985099a771f3a9abfca3e5badd702315168f42a482c5f6367c171b","observation_id":"ddec8462-9456-4c61-87fb-b603c64bb4fd","resolution":{"observed_at":"2026-08-11T19:42:17.401127Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.158064Z","title":"Amortized communication complexity","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.158064Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:bf90cdee670726604bf50b08aceeea98b1f4ca552a2a0fd5e88809282d490119","observation_id":"b80ef179-d100-4afd-9a35-c460c8330e3c","resolution":{"observed_at":"2026-08-11T19:42:17.158064Z","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":"0216.10023","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.940804Z","title":"Feige, D","venue":null,"work_id":"6d11bd9a-e8ad-4b77-9e01-50706398e1b9","year":1990},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.160558Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:64404362298957acbbd315931d49d3cc8c5b5df20cd036e6bd3793bd5fc4edf2","observation_id":"61a472d1-cedf-4e60-acd0-aa7d3908e763","resolution":{"observed_at":"2026-08-11T19:42:17.945646Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2907939","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.388025Z","title":"Exponential separation of information and communication for boolean functions","venue":null,"work_id":"4a0c131b-8f46-41ae-b9dd-87ebc701fb01","year":2016},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.162526Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:c28bedec4f47d2ff907c06a77c382c5e16d285444572bb9e5344c5192b59db50","observation_id":"bf23d46d-381d-4792-8e9f-daceded0fa00","resolution":{"observed_at":"2026-08-11T19:42:17.390378Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.164642Z","title":"A majority lemma for randomised query complexity","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.164642Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:85cdd90e26f3de26a2edba5d47dc2016e91977e466e6fb11ce80d32acd288d94","observation_id":"d9425d37-35b1-445a-8a66-f599f6639e61","resolution":{"observed_at":"2026-08-11T19:42:17.164642Z","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-11T19:42:17.166995Z","title":"Fourier growth of communication protocols for XOR functions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.166995Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:04873663afdd5c37241f52abc10d5c567d2e59036680cb79bfee45b9378b2626","observation_id":"58d1de17-b87f-4c8b-8ef8-62be82ad1515","resolution":{"observed_at":"2026-08-11T19:42:17.166995Z","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.4230/lipics.ccc.2021.39","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.377333Z","title":"Fourier growth of parity decision trees","venue":null,"work_id":"bde3f6a0-06ee-4b99-a659-ec78254fb040","year":2021},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.169368Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:387cd166ff3bd3f7b8bf2bb30791ea63d564f2c660e881cf7b0cb35d9efebb7c","observation_id":"3cf27816-c6e5-457e-aaf2-bfb4a7b7f4e5","resolution":{"observed_at":"2026-08-11T19:42:17.379799Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/17m1136869","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.370817Z","title":"Structure of protocols for XOR functions","venue":null,"work_id":"c77ca741-d50b-4600-b26c-b41fcdb7e3ad","year":2018},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.171554Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:a1e8b228ca36b0ce624322d23179d3de62604e61fc47be0a771cf38a422c3815","observation_id":"1acdb09b-47b7-4555-af3f-da5d481b272b","resolution":{"observed_at":"2026-08-11T19:42:17.373136Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.173898Z","title":"Refuting Approaches to the Log-Rank Conjecture for XOR Functions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.173898Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:94a521efbc4a1dc41f7183509a117ba520016fa24d12457b2ff562aa8aeb1174","observation_id":"ac28cd7c-cdc5-4d14-9fd8-9af68734008e","resolution":{"observed_at":"2026-08-11T19:42:17.173898Z","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-11T19:42:17.175972Z","title":"Better Boosting of Communication Oracles, or Not","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.175972Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:863d7b6ba7282f60f3f8ad3c42498cdb20996497ef28b00b4b659e6f90cfdcf7","observation_id":"2eea80f6-3d88-41f7-b14b-3fd5eb02181c","resolution":{"observed_at":"2026-08-11T19:42:17.175972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01802","last_updated":"2024-07-01T20:58:34Z","snapshot_observed_at":"2026-08-16T13:37:56.889828Z","submitted_at":"2024-07-01T20:58:34Z","title":"An XOR Lemma for Deterministic Communication Complexity","version":1},"cited_work":{"arxiv_id":"2407.01802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.01802","snapshot_observed_at":"2026-08-11T19:42:17.777037Z","title":"An XOR Lemma for Deterministic Communication Complexity","venue":"cs.CC","work_id":"9ac36d95-8828-41c2-b003-5984fd4b9924","year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.178027Z"},"links":{"cited_paper":"/paper/2407.01802","citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:7ffad72757db2fe4c9286c1ca2b665eff237e377f98fcd0242b28f5b26be4827","observation_id":"f60409b6-3fb3-443e-8aa6-85bfc641fb8b","resolution":{"observed_at":"2026-08-11T19:42:17.780450Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.180350Z","title":"XOR lemmas for communication via marginal information","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.180350Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:47a53aa4e374c69c472bd51aac12095fef76b0cc6df1187a23583af78e350a92","observation_id":"2e69834a-250e-4f21-a345-42a7d30b7cee","resolution":{"observed_at":"2026-08-11T19:42:17.180350Z","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-11T19:42:17.182295Z","title":"Resolution over linear equations modulo two","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.182295Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:2f47efb6eb2c0aa31cff71dcffca1244b5c5e55fdaca56b0497190dcffdeceaf","observation_id":"de4ef6d4-c235-4057-bbac-f5a48d7f06ef","resolution":{"observed_at":"2026-08-11T19:42:17.182295Z","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-11T19:42:17.184357Z","title":"Optimal direct sum results for deterministic and randomized decision tree complexity","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.184357Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:2a3141c743f8a748b86320922e4b498a836c61f54c7c422c61db2ce5b78e7d1b","observation_id":"eafc94a3-6f32-47af-b1c5-abf9062693f0","resolution":{"observed_at":"2026-08-11T19:42:17.184357Z","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/3-540-45061-0_26","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"A direct sum theorem in communication complexity via message compression","venue":"Lecture notes in computer science","work_id":"3f54bb0d-5e1d-46e3-8027-c6410bbe70d5","year":2003},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.186381Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:f3c5d1ac5200096ee3a0604451a8ea8d78255ec1c964b9ab7b60b0b1236c5883","observation_id":"e3b48e77-49cc-4039-a0be-d37b5d44b62b","resolution":{"observed_at":"2026-08-11T19:42:17.354993Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1469.34714","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.571255Z","title":null,"venue":null,"work_id":"42b27823-5717-4901-ad26-03710f0a5645","year":2021},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.188852Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:0739d1fefc951a5c024e38124e62fa6af65e206d041eaee5ac103d84af7e24ce","observation_id":"4cc16ff9-f459-4d59-814a-49d8f713469c","resolution":{"observed_at":"2026-08-11T19:42:17.575020Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.191330Z","title":"Learning decision trees using the fourier spectrum","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.191330Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:76449c90b7de3c58dfeda653da0f604ce8aa12c19998cad61e3b7ec407bb029c","observation_id":"26ea9ac4-cc36-4d7e-8322-e391d37ffb51","resolution":{"observed_at":"2026-08-11T19:42:17.191330Z","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/05063235x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.340889Z","title":"Quantum and classical strong direct product theorems and optimal time‐space tradeoffs","venue":null,"work_id":"49f441f5-268c-4aa0-9acb-0be068360bf5","year":2007},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.193918Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:ded472a75b3984f595e9ba4dff129584bd1284f2e0700c92d48ea603bb16efde","observation_id":"502d2731-7d7c-4fbf-9911-23f564086c4b","resolution":{"observed_at":"2026-08-11T19:42:17.343656Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.196458Z","title":"Learning complexity vs","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.196458Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:61158ca6b159462eeba471090d1155a02397474bcb7956898664f6e14c327993","observation_id":"e47950ff-131d-4f69-8baf-177619823812","resolution":{"observed_at":"2026-08-11T19:42:17.196458Z","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/ccc.2008.25","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.329860Z","title":"A direct product theorem for discrepancy","venue":null,"work_id":"44ac8241-4372-41c7-b94f-2f3361bd5610","year":2008},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.198946Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:980e7c619894a49f0f7123e0d97a10238c0bd30c800c2c4c9e751b808f68f16e","observation_id":"59765191-2672-48e5-b8dd-041c3b8c6ead","resolution":{"observed_at":"2026-08-11T19:42:17.332416Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3647629","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.321523Z","title":"On parity decision trees for fourier-sparse boolean functions","venue":null,"work_id":"f018e89c-0c14-4cf1-b50d-812fbcc8c92b","year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.201394Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:026d79fc3e86cd8038be6b713a3149baac92c75af8d1580e6693e723ea8792c7","observation_id":"4390cf34-cd54-4ada-b993-d270f163ddc5","resolution":{"observed_at":"2026-08-11T19:42:17.324728Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:18.323013Z","title":"The communication complexity of threshold gates","venue":null,"work_id":"564a7446-6231-465a-801f-976b49b355c4","year":1993},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.204033Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:71644d308d0a22c8a3b1e385fd65f7c420cdbdcdd29ec051dfecfe55cddb0d0a","observation_id":"972a41db-18c1-4743-95ed-12b3c5008932","resolution":{"observed_at":"2026-08-11T19:42:18.325712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.206538Z","title":"Analysis of Boolean Functions","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.206538Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:dc164898943b649ccd29d055dcc02131224cf262190136dacef2d7a2db22a4c4","observation_id":"3358f3b5-1571-4ede-849d-c473b3d9c667","resolution":{"observed_at":"2026-08-11T19:42:17.206538Z","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/ccc.2014.22","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.309187Z","title":"A Composition Theorem for Parity Kill Number","venue":null,"work_id":"134550bf-f678-46b0-8f0d-6e0afd7ba281","year":2014},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.209607Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:a60cbd56861ce0470d41ff403b8e551b09be79941b4609c89778287656282b26","observation_id":"63589535-ff0d-4ded-9401-60ee9b9436f4","resolution":{"observed_at":"2026-08-11T19:42:17.312660Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2018.v014a020","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.301623Z","title":"Simplified separation of information and communication","venue":null,"work_id":"70bdd8c4-ce46-4dda-9398-b21dfb26a688","year":2018},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.212281Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:76cf488c563106e4ee41d52e33b977dab5238d8ac1f59ebb5b0bb0d8bb782e75","observation_id":"5288ef28-c185-47f1-80ea-5950a2c2c6bc","resolution":{"observed_at":"2026-08-11T19:42:17.304319Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2019.v015a011","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.294125Z","title":"Fourier sparsity and dimension","venue":null,"work_id":"cd1100b9-379c-4208-b3f2-da7f6c5f3f5d","year":2019},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.214802Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:9ca3de756829b0d6ac615ec52fe3000cce8eef2fad916181ed97cd7c5320ae83","observation_id":"635036fe-bb8c-4163-9b45-868b218c25db","resolution":{"observed_at":"2026-08-11T19:42:17.296916Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.stacs.2024.56","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.286317Z","title":"Randomized query composition and product distributions","venue":null,"work_id":"4121e608-8f4a-45d7-985d-b3729da45023","year":2024},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.217229Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:10c6cfd3d5527f68e8e54ecad368e9ff2ba56c889e2c1224f24e6a4b97f502c2","observation_id":"fee40975-e57f-4793-8da1-ee17630b3245","resolution":{"observed_at":"2026-08-11T19:42:17.289325Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:18.314256Z","title":"On determinism versus unambiquous nondeterminism for decision trees","venue":null,"work_id":"76c69e9d-712a-4791-99f4-9a43d979781c","year":2002},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.219944Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:6c657ec73bd96cc9929bf217de145f3d54357d07db93bb218f13b127a8628b41","observation_id":"735156b1-c32b-4a29-9f73-8f5ba282480c","resolution":{"observed_at":"2026-08-11T19:42:18.317270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.222422Z","title":"Towards proving strong direct product theorems","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.222422Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:45be508886594f44bf5868cecf5cc6ba7fa11cf516a0a48de85c8c2a3d705ce3","observation_id":"60b4cb7c-3da2-4195-85fd-865ffce85243","resolution":{"observed_at":"2026-08-11T19:42:17.222422Z","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-11T19:42:18.304126Z","title":"Randomized lifting to semi-structured communication complexity via linear diversity","venue":null,"work_id":"7a79287b-2596-425a-ad95-0a28938d4e6c","year":2025},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.225053Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:ed415ffc69a852574d19d1cf6482a7d635fea73cec80ffa4d436849f7d7d64b6","observation_id":"139f5db5-cd2c-4bfe-b375-0de58e81d324","resolution":{"observed_at":"2026-08-11T19:42:18.307779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00037-015-0110-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-18T11:03:46.223893Z","title":"On the structure of boolean functions with small spectral norm","venue":"Computational Complexity","work_id":"f913ecc4-9de9-40e7-92a2-d6e5ea578112","year":2017},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.227524Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:ad5140cf7345ac1caec7ce31f57a3079e4d1913a1c04485a78f82e7bf5287684","observation_id":"ba9bc693-dffb-4ea6-bca8-74816b4eec0c","resolution":{"observed_at":"2026-08-11T19:42:17.278449Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.230008Z","title":"Fourier sparsity, spectral norm, and the log-rank conjecture","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.230008Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:a01b2207232bbeaf09009de3267b103a6db2d23f33efb03910e24c4bbf870f34","observation_id":"65871924-d3d1-4dfa-92de-08cd14f254d3","resolution":{"observed_at":"2026-08-11T19:42:17.230008Z","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-11T19:42:17.232453Z","title":"Probabilistic computations: Toward a unified measure of complexity","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.232453Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:d6b60f7edff4aec1d092a349d73227f20f60dbfc22968b3ad86c957365f06fa2","observation_id":"cbbc2224-9c6d-4460-92d0-15d40dfee07b","resolution":{"observed_at":"2026-08-11T19:42:17.232453Z","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-11T19:42:17.234496Z","title":"Lower bounds by probabilistic arguments","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.234496Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:c34a6d4a2098061ffbe6f1c0c95ed513123474df7498e22c299d53a1ee6b7466","observation_id":"84553a73-5657-42a3-a617-6be80072b348","resolution":{"observed_at":"2026-08-11T19:42:17.234496Z","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/j.tcs.2010.03.027","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T19:42:17.254278Z","title":"On the parity complexity measures of boolean functions","venue":null,"work_id":"5a2f7b03-b4ce-44d9-b3b8-b6be137f587a","year":2010},"citing_paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-11T19:42:17.236516Z"},"links":{"citing_paper":"/paper/2412.06552"},"observation_digest":"sha256:f892f05fbaa1165dea226b98eb50fee9c7df88dd47179ea7a7481bbcb61cdb38","observation_id":"b659c430-e008-478e-b760-8853cb57fb5a","resolution":{"observed_at":"2026-08-11T19:42:17.258757Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.06552","last_updated":"2025-05-30T19:52:09Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T09:29:52.303159Z","submitted_at":"2024-12-09T15:01:46Z","title":"Direct Sums for Parity Decision Trees"},"reference_resolution":{"displayed":57,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":27,"verified_exact":22,"verified_fuzzy":6},"total_outbound_references":57},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 57 of 57 outbound references and 0 inbound Pith citation observations for arXiv:2412.06552."}