{"as_of":"2026-08-19T20:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd2d4c17b3e67ab08d4bae7ff98cb61481cbbfba667876f99ee11285ad3a50dc","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:27:24.070049Z","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-04T01:39:23.511921Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.06433","last_updated":"2025-04-08T21:05:39Z","snapshot_observed_at":"2026-08-16T12:42:53.029012Z","submitted_at":"2025-04-08T21:05:39Z","title":"Tight bounds on depth-2 QAC-circuits computing parity","version":1},"cited_work":{"arxiv_id":"2504.06433","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.06433","snapshot_observed_at":"2026-07-04T01:39:23.511921Z","title":"Tight bounds on depth- 2 QAC-circuits computing parity.arXiv preprint arXiv:2504.06433","venue":null,"work_id":"6cb4988c-76bc-4d4c-beb5-9cb40a376176","year":2021},"citing_paper":{"arxiv_id":"2604.07178","last_updated":"2026-04-08T15:07:09Z","snapshot_observed_at":"2026-07-06T22:55:28.855291Z","submitted_at":"2026-04-08T15:07:09Z","title":"On the Computational Complexity of Geometrically Local QAC0 circuits","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:52.590198Z"},"links":{"cited_paper":"/paper/2504.06433","citing_paper":"/paper/2604.07178"},"observation_digest":"sha256:089eec1d4b30cb168e171509bb48e09f2aacdfd4fdaca0193cc06ac90cfb46c6","observation_id":"5da8f862-ef7f-4901-8f2a-8e9f29d60a47","resolution":{"observed_at":"2026-05-11T06:10:59.374172Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06433","last_updated":"2025-04-08T21:05:39Z","snapshot_observed_at":"2026-08-16T12:42:53.029012Z","submitted_at":"2025-04-08T21:05:39Z","title":"Tight bounds on depth-2 QAC-circuits computing parity","version":1},"cited_work":{"arxiv_id":"2504.06433","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.06433","snapshot_observed_at":"2026-07-04T01:39:23.511921Z","title":"Tight bounds on depth- 2 QAC-circuits computing parity.arXiv preprint arXiv:2504.06433","venue":null,"work_id":"6cb4988c-76bc-4d4c-beb5-9cb40a376176","year":2021},"citing_paper":{"arxiv_id":"2604.26179","last_updated":"2026-07-23T20:13:21Z","snapshot_observed_at":"2026-08-02T15:31:28.626774Z","submitted_at":"2026-04-28T23:55:24Z","title":"Hard-to-Sample Distributions from Robust Extractors","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-11T00:48:12.816705Z"},"links":{"cited_paper":"/paper/2504.06433","citing_paper":"/paper/2604.26179"},"observation_digest":"sha256:8478f59a48b5e3a10a52c5a00d309e44d66ad7edec43c383d2a4d79809ed1367","observation_id":"28308ce8-249c-4014-8d7c-99b079eda7b9","resolution":{"observed_at":"2026-05-11T00:50:50.032831Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06433","last_updated":"2025-04-08T21:05:39Z","snapshot_observed_at":"2026-08-16T12:42:53.029012Z","submitted_at":"2025-04-08T21:05:39Z","title":"Tight bounds on depth-2 QAC-circuits computing parity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.06433","snapshot_observed_at":"2026-08-02T15:31:47.909795Z","title":"2, 3, 6, 7, 11, 21, 22, 25 [DH25] Dean Doron and William M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2604.26179","last_updated":"2026-07-23T20:13:21Z","snapshot_observed_at":"2026-08-02T15:31:28.626774Z","submitted_at":"2026-04-28T23:55:24Z","title":"Hard-to-Sample Distributions from Robust Extractors","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T15:31:47.909795Z"},"links":{"cited_paper":"/paper/2504.06433","citing_paper":"/paper/2604.26179"},"observation_digest":"sha256:ab29fe7f5aa800b4b693257a1f58c82a184c9edda84999a7ba6df01d2f4daa64","observation_id":"95551fc6-b94c-4443-aa46-88c4a4dd4dfd","resolution":{"observed_at":"2026-08-02T15:31:47.909795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06433","last_updated":"2025-04-08T21:05:39Z","snapshot_observed_at":"2026-08-16T12:42:53.029012Z","submitted_at":"2025-04-08T21:05:39Z","title":"Tight bounds on depth-2 QAC-circuits computing parity","version":1},"cited_work":{"arxiv_id":"2504.06433","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.06433","snapshot_observed_at":"2026-07-04T01:39:23.511921Z","title":"Tight bounds on depth- 2 QAC-circuits computing parity.arXiv preprint arXiv:2504.06433","venue":null,"work_id":"6cb4988c-76bc-4d4c-beb5-9cb40a376176","year":2021},"citing_paper":{"arxiv_id":"2604.26180","last_updated":"2026-07-02T00:29:27Z","snapshot_observed_at":"2026-08-12T00:18:44.249901Z","submitted_at":"2026-04-28T23:55:26Z","title":"Evergreen: Efficient Claim Verification for Semantic Aggregates","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-04T01:37:42.753691Z"},"links":{"cited_paper":"/paper/2504.06433","citing_paper":"/paper/2604.26180"},"observation_digest":"sha256:eed2181b7f1e7a514fc34857d8aa4626ae2689d599efe8001dad4f61d619cc3c","observation_id":"ec46f1a3-e0be-466f-bb91-068a7b5f4bda","resolution":{"observed_at":"2026-07-04T01:39:23.514346Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06433","last_updated":"2025-04-08T21:05:39Z","snapshot_observed_at":"2026-08-16T12:42:53.029012Z","submitted_at":"2025-04-08T21:05:39Z","title":"Tight bounds on depth-2 QAC-circuits computing parity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.06433","snapshot_observed_at":"2026-08-10T22:24:16.304360Z","title":"Fenner and Daniel Grier and Daniel Pad","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06703","last_updated":"2026-08-10T17:30:15Z","snapshot_observed_at":"2026-08-19T13:02:23.598484Z","submitted_at":"2026-08-07T02:00:19Z","title":"Shor's algorithm requires Fanout","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T22:24:16.304360Z"},"links":{"cited_paper":"/paper/2504.06433","citing_paper":"/paper/2608.06703"},"observation_digest":"sha256:c7a150c82ba2dd03ae26b4520244170aa95dfe7037336569f2c84737f1d8efc5","observation_id":"8f3050a7-5231-4110-bfbd-64a5d809b341","resolution":{"observed_at":"2026-08-10T22:24:16.304360Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06433","last_updated":"2025-04-08T21:05:39Z","snapshot_observed_at":"2026-08-16T12:42:53.029012Z","submitted_at":"2025-04-08T21:05:39Z","title":"Tight bounds on depth-2 QAC-circuits computing parity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.06433","snapshot_observed_at":"2026-08-11T04:27:24.070049Z","title":"Fenner and Daniel Grier and Daniel Pad","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.06703","last_updated":"2026-08-10T17:30:15Z","snapshot_observed_at":"2026-08-19T13:02:23.598484Z","submitted_at":"2026-08-07T02:00:19Z","title":"Shor's algorithm requires Fanout","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T04:27:24.070049Z"},"links":{"cited_paper":"/paper/2504.06433","citing_paper":"/paper/2608.06703"},"observation_digest":"sha256:3ab0855769a89dfc4dbf9e22e7872cfb8615afa6930e60c2d34ff6762161aee4","observation_id":"da8c2e8c-a7bb-41e7-9028-50cc3de9a09f","resolution":{"observed_at":"2026-08-11T04:27:24.070049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2504.06433/citation-record","integrity":"/paper/2504.06433/integrity","json":"/paper/2504.06433/citation-record.json","paper":"/paper/2504.06433"},"outbound":[],"paper":{"arxiv_id":"2504.06433","last_updated":"2025-04-08T21:05:39Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T12:42:53.029012Z","submitted_at":"2025-04-08T21:05:39Z","title":"Tight bounds on depth-2 QAC-circuits computing parity"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2504.06433."}