{"as_of":"2026-08-23T08:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7b58ecac2b7f83e9fa33eb6b6385a7e20c73f2321116c7c5b522500c547cee99","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:36:37.488744Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-01T19:56:11.304711Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-08-12T21:30:12.734753Z","title":"Analysis of boolean functions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.08798","last_updated":"2025-03-11T03:45:11Z","snapshot_observed_at":"2026-08-20T05:16:10.256255Z","submitted_at":"2024-11-13T17:25:25Z","title":"Learning Gaussian Multi-Index Models with Gradient Flow: Time Complexity and Directional Convergence","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T21:30:12.734753Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2411.08798"},"observation_digest":"sha256:33d328bf0db2c144f30a546026ac0c0a9aba3b2ab4d04607499dc793778bcdc6","observation_id":"8fe996bd-65d4-470f-b8a3-0400c1aff106","resolution":{"observed_at":"2026-08-12T21:30:12.734753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-08-12T12:09:33.632414Z","title":"Analysis of boolean functions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.17582","last_updated":"2024-11-26T16:49:16Z","snapshot_observed_at":"2026-08-15T19:31:15.489364Z","submitted_at":"2024-11-26T16:49:16Z","title":"From Fairness to Infinity: Outcome-Indistinguishable (Omni)Prediction in Evolving Graphs","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-12T12:09:33.632414Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2411.17582"},"observation_digest":"sha256:0ee8178ff957db15645050d0d1f8d3e126174c95a5cee39d0c5c5016878d11f2","observation_id":"6aa84d79-a1dc-4461-b257-33fc8f896544","resolution":{"observed_at":"2026-08-12T12:09:33.632414Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-08-11T13:13:07.993900Z","title":"Analysis of boolean functions,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.13489","last_updated":"2024-12-18T04:15:11Z","snapshot_observed_at":"2026-08-19T22:50:39.740336Z","submitted_at":"2024-12-18T04:15:11Z","title":"Analysis of Higher-Order Ising Hamiltonians","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T13:13:07.993900Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2412.13489"},"observation_digest":"sha256:25016e7f134536dcb2d60f97334fcd3a3c8f1fdf5d2c47fce1b6e029484bd466","observation_id":"4eecbc8f-c7bc-41b5-9f95-4948480a4c41","resolution":{"observed_at":"2026-08-11T13:13:07.993900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-08-10T22:49:49.768026Z","title":"Analysis of boolean functions, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.00817","last_updated":"2025-01-08T10:42:53Z","snapshot_observed_at":"2026-08-11T22:41:47.894858Z","submitted_at":"2025-01-01T12:04:06Z","title":"Hardness of Learning Fixed Parities with Neural Networks","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T22:49:49.768026Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2501.00817"},"observation_digest":"sha256:37e647947ccf11153203903e1cefd03ace9ee77ff1fff19968274c6b6a5aec49","observation_id":"84b2f23c-784a-40de-ac56-dfa09ebfb8b4","resolution":{"observed_at":"2026-08-10T22:49:49.768026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":"2105.10386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-07-01T19:56:11.304711Z","title":"Analysis of boolean functions","venue":null,"work_id":"ba79b7f4-ba26-49bd-9c7a-4c5aaf091941","year":2014},"citing_paper":{"arxiv_id":"2501.04776","last_updated":"2026-05-07T15:27:16Z","snapshot_observed_at":"2026-08-17T23:13:17.717158Z","submitted_at":"2025-01-08T19:00:02Z","title":"IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-23T05:35:50.375623Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2501.04776"},"observation_digest":"sha256:28ddae051af4f91521bed627d0b406a1bb7622267c92d9573b45c9cd0348aec1","observation_id":"6dfc1ac6-6e5e-4768-921a-6160b0278506","resolution":{"observed_at":"2026-05-23T05:37:36.908772Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-08-05T20:48:50.189397Z","title":"O’Donnell, Analysis of boolean functions (2021), 2105.10386v1","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.09876","last_updated":"2025-08-13T15:18:21Z","snapshot_observed_at":"2026-08-20T03:38:43.869590Z","submitted_at":"2025-08-13T15:18:21Z","title":"A Shank Angle-Based Control System Enables Soft Exoskeleton to Assist Human Non-Steady Locomotion","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T20:48:50.189397Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2508.09876"},"observation_digest":"sha256:8a7b67ed3b88b9d93f2b6cb00708af8b4c93b0d5abc71bb680e7315ae7edd60f","observation_id":"3492fc27-ce11-4de4-a111-f8c273e6d429","resolution":{"observed_at":"2026-08-05T20:48:50.189397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":"2105.10386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-07-01T19:56:11.304711Z","title":"Analysis of boolean functions","venue":null,"work_id":"ba79b7f4-ba26-49bd-9c7a-4c5aaf091941","year":2014},"citing_paper":{"arxiv_id":"2604.05036","last_updated":"2026-04-22T17:19:37Z","snapshot_observed_at":"2026-08-16T04:56:47.708555Z","submitted_at":"2026-04-06T18:00:04Z","title":"Efficient simulation of noisy IQP circuits with amplitude-damping noise","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-10T19:55:12.229815Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2604.05036"},"observation_digest":"sha256:11e9589f579d4bd0ee14e8b9b1cf626c5d735812d92681e59ae4347318f52d6c","observation_id":"2b6d0330-1769-4a47-89ec-e1c6d7610023","resolution":{"observed_at":"2026-05-10T22:25:49.686168Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":"2105.10386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-07-01T19:56:11.304711Z","title":"Analysis of boolean functions","venue":null,"work_id":"ba79b7f4-ba26-49bd-9c7a-4c5aaf091941","year":2014},"citing_paper":{"arxiv_id":"2604.19625","last_updated":"2026-04-21T16:13:57Z","snapshot_observed_at":"2026-08-17T19:58:04.564336Z","submitted_at":"2026-04-21T16:13:57Z","title":"Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-05-10T03:27:13.224597Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2604.19625"},"observation_digest":"sha256:d70e52c06c55f4cf0915051c825d27c45cc009a76c5eb87114543438ceee6792","observation_id":"9c566354-f1b1-4903-a6ea-6b5e33271433","resolution":{"observed_at":"2026-05-10T03:29:21.846325Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":"2105.10386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-07-01T19:56:11.304711Z","title":"Analysis of boolean functions","venue":null,"work_id":"ba79b7f4-ba26-49bd-9c7a-4c5aaf091941","year":2014},"citing_paper":{"arxiv_id":"2605.01367","last_updated":"2026-05-02T10:25:10Z","snapshot_observed_at":"2026-08-13T02:04:39.970123Z","submitted_at":"2026-05-02T10:25:10Z","title":"From Characterization To Construction: Generative Quantum Circuit Synthesis from Gate Set Tomography Data","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-09T14:54:25.961118Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2605.01367"},"observation_digest":"sha256:33e1f75393a52eb61f0da884c7ed8a5ad70cceb4ac0b5781257728e481586375","observation_id":"29162195-9702-40ff-9e3b-c5aa8d633084","resolution":{"observed_at":"2026-05-11T16:51:05.845703Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":"2105.10386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-07-01T19:56:11.304711Z","title":"Analysis of boolean functions","venue":null,"work_id":"ba79b7f4-ba26-49bd-9c7a-4c5aaf091941","year":2014},"citing_paper":{"arxiv_id":"2606.00246","last_updated":"2026-06-09T13:27:38Z","snapshot_observed_at":"2026-08-11T22:41:23.164763Z","submitted_at":"2026-05-29T18:28:01Z","title":"Further evidence towards the Fourier Entropy-Influence conjecture","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-28T21:52:22.536137Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2606.00246"},"observation_digest":"sha256:aee7fd45742e8a7bf5e3686ad519809b25396182b6486f963795a3037897e585","observation_id":"d5f5491f-d0c4-4802-89b0-fadba4dce3f1","resolution":{"observed_at":"2026-07-01T19:56:11.306887Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":"2105.10386","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-07-01T19:56:11.304711Z","title":"Analysis of boolean functions","venue":null,"work_id":"ba79b7f4-ba26-49bd-9c7a-4c5aaf091941","year":2014},"citing_paper":{"arxiv_id":"2606.30433","last_updated":"2026-06-29T15:11:18Z","snapshot_observed_at":"2026-08-08T15:48:59.465826Z","submitted_at":"2026-06-29T15:11:18Z","title":"Testing k-submodularity","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-06-30T03:27:36.126421Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2606.30433"},"observation_digest":"sha256:cbbe158507db00e8aa130a331e3fb23150761124a755a467c499d3378e2c464c","observation_id":"129b3d17-9e1f-4e17-b95a-604608d339e7","resolution":{"observed_at":"2026-06-30T03:34:13.333441Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-08-01T15:18:49.530291Z","title":"kY a=1 x2 nam # + k! D2 X m̸=m′ X ⃗ n 1 Ω(⃗ n)E","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18537","last_updated":"2026-07-20T22:04:54Z","snapshot_observed_at":"2026-08-16T08:34:35.097388Z","submitted_at":"2026-07-20T22:04:54Z","title":"State $k$-designs from Hamiltonian evolution","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T15:18:49.530291Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2607.18537"},"observation_digest":"sha256:adc0c33546c22cdd0e7b0bb2d1077e2b087ce9d10d13f2e19e8d7f2b94ff91cd","observation_id":"38a3591d-616a-4fa9-9839-b099a2ef6387","resolution":{"observed_at":"2026-08-01T15:18:49.530291Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.10386","snapshot_observed_at":"2026-08-15T14:36:37.488744Z","title":"Analysis of boolean functions","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.06872","last_updated":"2026-08-07T06:55:24Z","snapshot_observed_at":"2026-08-20T14:51:12.390962Z","submitted_at":"2026-08-07T06:55:24Z","title":"Pessimal Elections for Approximately Dominating Sets","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T14:36:37.488744Z"},"links":{"cited_paper":"/paper/2105.10386","citing_paper":"/paper/2608.06872"},"observation_digest":"sha256:714d0e84960559ae3be6d0d87094a0b8f3e75b4836ba50d1271036fd2418f910","observation_id":"569dbe49-e840-49ff-9f2e-9da864f532db","resolution":{"observed_at":"2026-08-15T14:36:37.488744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2105.10386/citation-record","integrity":"/paper/2105.10386/integrity","json":"/paper/2105.10386/citation-record.json","paper":"/paper/2105.10386"},"outbound":[],"paper":{"arxiv_id":"2105.10386","last_updated":"2021-05-21T15:00:35Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-20T08:17:19.165415Z","submitted_at":"2021-05-21T15:00:35Z","title":"Analysis of Boolean Functions"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 13 inbound Pith citation observations for arXiv:2105.10386."}