{"as_of":"2026-08-15T12:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2585133f10f7e5dd078514eadbc193cc11e0129475082188f8a5aef229260be9","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T04:01:18.172992Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.11665/citation-record","integrity":"/paper/2607.11665/integrity","json":"/paper/2607.11665/citation-record.json","paper":"/paper/2607.11665"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:a5d63d0b089d4aaeb511d559374a953313500a0503944903dbccb51a12abbc19","observation_id":"1ec64ea5-0fdb-4946-af83-6315815cf54c","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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.ic.2005.04.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Information and Computation","work_id":"9ce628bb-acc2-4cfc-9bec-5f3b7ca6af8c","year":2005},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:16654b6986721f2542807dae99d6936856e22f0e87c195d6f922b867a715551a","observation_id":"04b228a4-fcd4-4e94-a1d9-4271627c6097","resolution":{"observed_at":"2026-07-14T04:10:13.959871Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:13.983019+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:13.983019+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:82d200fb029902cd0e51c4b7af3d8c4246a386e467a8c0262f93b6e63a6f09b2","observation_id":"d0c537bd-bb7a-474a-9467-9a8bf88bdae9","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:83d47c0d1962c86f7f888a1972f19037522ecbf87acae625cd0f3090e94b2b5e","observation_id":"3a1f9fff-5ad2-4ae5-bd89-b920e3e59fbe","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:37f7eae7c9ab1b39c0c81bd42064a14873ad3d3ea74fa6de96a13a7f7b96c6ea","observation_id":"5b135b0e-ff7e-44e3-a3da-cfe4e17525e5","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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/3371089","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"ea41dbe4-ef4b-43f4-be8e-0a20aa23756f","year":2019},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:867c61d05a468e2221790a5ff0518376952dd5d4d072ef6d88c1c5b28a813b5b","observation_id":"8599bb52-c331-43e3-a4b6-05652d021897","resolution":{"observed_at":"2026-07-14T04:10:13.972770Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:15.054181+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:15.054181+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3498678","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Thinniyam, and Georg Zetzsche","venue":"Proceedings of the ACM on Programming Languages","work_id":"ac5522b7-a8d0-46c5-bee0-e581419f8bcd","year":2022},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:184faab9ea7ea028055febd0ce70a31ea472e7395427f0ba947b610184d1ce94","observation_id":"112a6e5d-086a-48fe-b5b6-ebc6b1a7795f","resolution":{"observed_at":"2026-07-14T04:10:13.948774Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:15.285424+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:15.285424+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:3a9e628f0ddbead3fa79e59eb755d1bda7aac75aff902e4797dd78cc893a2ff7","observation_id":"c68c94a8-7a0e-4092-bbc4-933b4ffb46e8","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":"Evered, Alexandra A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:e41c3ededeb74ffe4d0ad15fdd00a5c1ad21a2e6cd36e0afdf85c1a50735599a","observation_id":"833c55c9-76fb-4ebf-b7b0-5c2fde9c8543","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":"Borodin and S","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:ec4f8d7cbc0187eacb00a748dab48935134a29e908f67de8e7e3fb9f0dc6d39b","observation_id":"00bacef3-a8a2-4d36-a9d6-6412d7cfd5c6","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:75e74756a1009702d2782a89d7bbf12dec181555c41c24345d708f7574d506b7","observation_id":"eac7fb4b-44ed-438c-b2c9-25a739c0677a","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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/3632861","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"8a6ed4fd-a00a-4b2a-80a2-16e285f0b5b2","year":2024},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:86b6cc850c9b8a479c91cf1d7980a744d6b9119219b3d67a200a712a3f496dfd","observation_id":"1bffb34e-4aa3-40ce-8bb3-3481a3b4a508","resolution":{"observed_at":"2026-07-14T04:10:13.895682Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:16.072073+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:16.072073+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:2549057b7042e45cd5c0d72b6ee114004dc5bd0355c37a2333e5bb1856eb0cbf","observation_id":"f30dcff5-3690-4c31-bf07-1b48a3257cb4","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:08c5a93130fe80d810e1087a0af0cc9749a3d6d14e1d00218ae63d289ffd2ced","observation_id":"f4df1f2f-8899-4d26-aec7-a2d9dee80dbd","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","resolver_source":null,"status":"malformed_identifier"},"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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:424de3f4ed8b3d97046bde60a0bda976adbd301965c1181d69c3ce07609256dd","observation_id":"22ef29e9-db4d-4de6-8673-90b6058b4595","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:eca75124a6302af863e13b7c83ef19a9750e120f1b5c0325770142fc831b106f","observation_id":"5441f08d-5ef6-4538-b3bb-dff9bc64d511","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":"Madhusudan","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:3f288a165300f3164584f22df0051cf089924c532d4f3287de779dab31e7fbdb","observation_id":"77457a46-a14a-4b63-b2f1-ac0099c425d7","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:59549fc23cec592be5673d1fdbd2bd83ab97794f8bc15fa6c868b95b8db9846f","observation_id":"c1ca9090-6a72-4542-a657-01aa7a1eb530","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:d7ba2e798abca44bf9a555292d3a841d35ee70b7dcf20b6cd8abf7c5925afaba","observation_id":"b8044123-9655-4a73-b6f8-50169664467e","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:36f3cc7c84b6733d5b0d8b3d19008ec7ffcc8528cd1fe2eeacef65d374f7b9e4","observation_id":"d6e7c8b5-abea-41ff-a78f-9866b4edb524","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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/978-3-319-58747-9_13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Lecture notes in computer science","work_id":"698b3ee8-aa65-4fc9-8122-13afca636bb0","year":2017},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:7067e1b23379db2f01829d2c3395d0a3c9bb9aabbc8567a44b5b969caa091b97","observation_id":"195a160f-79a0-4c7f-9569-0084b7e88c6a","resolution":{"observed_at":"2026-07-14T04:10:13.989995Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:18.13962+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:18.13962+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.92.052331","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Physical Review A","work_id":"1aa9bad7-8f15-4791-8830-ac4033fd9972","year":2015},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:af469a4052739c57435247114056167df16dfd806e3bccd447ea6abd90625893","observation_id":"1147813c-228e-4363-94a3-638338b5aced","resolution":{"observed_at":"2026-07-14T04:10:13.881197Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:18.37851+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:18.37851+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7659.104031","doi":"10.1145/1047659.1040318","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Gay and Rajagopal Nagarajan","venue":"ACM SIGPLAN Notices","work_id":"ac19a9fc-8f63-48d8-b7aa-60631ac8a4f1","year":2005},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:d0ff3a15a14cc2d16b43b1d6bce0b4df4de7e804b49a57cb393eb0af9c7c7c35","observation_id":"98c2d7d5-0ac3-4a84-871d-f10994f77f66","resolution":{"observed_at":"2026-07-14T04:10:13.912037Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:18.697625+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:18.697625+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:a0c47f7fed6b6004c1c6ed27c4a74e5a108aaa845ab3c634a7f243cb12c7302a","observation_id":"7a4ae43c-b724-4f72-a378-269af7b0fd64","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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/3808282","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Goharshady, Kerim Kochekov, Tian Shu, and Ahmed Khaled Zaher","venue":"Proceedings of the ACM on Programming Languages","work_id":"7a305bd5-16f4-43b4-adbe-266134795341","year":2026},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:31e0aa5f4de1882bf2cd3e7cee5743286fb239c3160abf7bc83c75c6d203bfb0","observation_id":"a532f454-f7cf-4cae-8bc0-85b24d6d1611","resolution":{"observed_at":"2026-07-14T04:10:13.807007Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:19.314691+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:19.314691+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:c4526de58a649f91dd2cfa28b89fc5f905ddab8cfc52033aece21ad86546db78","observation_id":"43d3cb6f-3c83-4715-9eba-06c1e9a86364","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:9b99482ca70972ff980fc86c64adc2125a71effcf1abb61393db59cd78a6be87","observation_id":"f5e88642-35e8-408c-a322-909f88365e2c","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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.1103/prxquantum.6.010307","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Wallman, and Irfan Siddiqi","venue":"PRX Quantum","work_id":"2ff13e9c-4a84-4951-a4f8-0f54fa24332d","year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:569c4d4758aa440d8632e114734c6ba88bc62e1307175ad64695a2a5f22e3142","observation_id":"a3cf5668-fc1c-49b4-9dd5-0088aa7f2791","resolution":{"observed_at":"2026-07-14T04:10:13.964305Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:19.548752+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:19.548752+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:9a5661600c2ad5801d7b28819d6be4093a22bcba61c33ac0dc811c9d61ffbc41","observation_id":"3066cfa9-9e97-496e-b9f9-9968138cec3b","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","resolver_source":null,"status":"malformed_identifier"},"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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:142646ca13fd6624ca76b7bcd5a7338156c9f24cd64a3d096b8c03b86fe60176","observation_id":"da6d115e-cc12-47c8-a391-749f53e2028e","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:e64169a77002e35c55404ae6a31146c488d7ecdc24d17233e018e8f35359a95f","observation_id":"11c0fbdd-55b9-4a9c-8d2b-d94b2626a788","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:cc6a67e3fa0c19e633f6c856845f31ebd3a9ab7c2ad922e015719ce88f3e5df0","observation_id":"21f5f269-5959-4609-81c3-7f6cd581cbb5","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:5d96082f469b502c8fd4ed19ae12bbf4f23096495324eedfe2bd9bbf32c150be","observation_id":"cd5f3042-f91f-4a03-9e6a-7a40dabb07ff","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:fb9202463e062652078d2bab0fd94bcff958c84b99cc0c781565de76c8e99709","observation_id":"06c9375b-3690-4458-baa3-17f4478b9e1a","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:b3f28f06bf2a2511443d82870f91304ebbf4133883b6d79389aafe58af39c718","observation_id":"0a92eed9-7c57-4127-b2bb-c244d0d9a9db","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:8b60face89a75fdd9065c08b5863fc79dd347d411cf5d3842ed23d27a29f5dcf","observation_id":"3b67e31d-b129-4a65-9d31-8500d04d81c9","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":"Byrd, and Huiyang Zhou","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:2377aeb21157c00aee30fd0c19bb5e5b8e7dcdc1b3377bd91ee3336353781426","observation_id":"02d13316-aeca-49a3-858e-7a8861ad52c9","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:b6e75d8bd28554776ce2cd0ddb0769a8cc4e39f457f39bdaaf9554391a7879d3","observation_id":"d6ddd586-2cc1-4f65-bdfc-5edc0a777260","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:3c6d05aedeff41cfbdbd99c6d4bd6b7f2a79c6a3ed2a987552d46237c76c4dd5","observation_id":"fb909dc0-9530-4f0f-96ea-02a1ca8b6300","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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/3776648","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"c2ec170b-f024-4244-855f-ba24d86c99f4","year":2026},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:ab3565950ba38d3daa8a39a0bfb0447ea6e181dfdf23e2e42d66cc601050fcb3","observation_id":"44bb8e3a-07d3-4132-9be1-e3ff6fa84c74","resolution":{"observed_at":"2026-07-14T04:10:13.903038Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:21.485501+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:21.485501+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:fb75c03146d7dc42290f3a84361a52c318bc6d0081d67d50ebe091bc8c048106","observation_id":"a2e33c7e-dea2-47c5-9595-af68e30fdca4","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:4c907d697711d95f6105df4b01c82f870d24c4fe07258784bfdb9f084e7bf790","observation_id":"e72c8776-b114-42d6-8c87-b110cb035e26","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":"Nielsen and Isaac L","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:c52b40cb9b910e3cffd599581748cc87777e5a6d707550fb88d6b20f975da434","observation_id":"42c89c04-ce7f-4934-ad70-bc9eceed1cd1","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:097d428135b28f443b98a50ab183adff2487c850446f9e2a327cbaaeefda21cc","observation_id":"63e408f4-8b75-417f-b692-c1653b3295f2","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03885","last_updated":"2025-05-06T18:00:07Z","snapshot_observed_at":"2026-08-13T03:45:23.612931Z","submitted_at":"2025-05-06T18:00:07Z","title":"A Framework for the Efficient Evaluation of Runtime Assertions on Quantum Computers","version":1},"cited_work":{"arxiv_id":"2505.03885","doi":"10.48550/arxiv.2505.03885","metadata_source":"pith","pith_arxiv_id":"2505.03885","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"A Framework for the Efficient Evaluation of Runtime Assertions on Quantum Computers","venue":"quant-ph","work_id":"fdb5289d-0108-43d7-a0f5-d216f64b26fe","year":2025},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"cited_paper":"/paper/2505.03885","citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:cd9b5217c9d43345b53027b38a9af03edb487c2bf24f88ac8e02e595af6a458f","observation_id":"7b922e3c-85e4-4723-9c92-8629804f92d1","resolution":{"observed_at":"2026-07-14T04:10:13.837986Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:21.993066+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:21.993066+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.tcs.2004.12.031","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Theoretical Computer Science","work_id":"282c7de6-98b2-415b-b8a0-e4df14056573","year":2005},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:86b452011aab222d594ff680bcf65865c14a845de5616c893e2aff731a1cd9a5","observation_id":"bc68a34f-aaff-4e70-908c-f499e6c74eed","resolution":{"observed_at":"2026-07-14T04:10:13.831679Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:22.224331+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:22.224331+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3776643","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the ACM on Programming Languages","work_id":"3edafa65-3d08-434e-83db-481b3ee27ccc","year":2026},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:13558689f385d096440642303bfe054c784678ff13fdafd955288fb09325b733","observation_id":"09379749-458f-43af-8ffd-8b28f006e304","resolution":{"observed_at":"2026-07-14T04:10:13.857617Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:22.520019+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:22.520019+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-14T04:01:18.172992Z","title":"Cross, Frederic T","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:58170bd75e45677723f0a347398c6262c999dcdc5735a57ee5e672d44f175cd1","observation_id":"5ac48df5-d6d9-4235-94b3-902b72260ab1","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:586214620eeceab41c3ebb6a8ad3cbe762a0e0a2989ae80854bcb70f430cf1b3","observation_id":"e4845ccb-1975-4440-bb99-34304cdc068c","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:fce4031135e4124a9a09fef10f17c985371210249491aecdf4843e06ba756a3d","observation_id":"6c3b44c3-dddb-42fd-b597-0f58a2607396","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:c0276e0e81c5515b333b69991247039b50b1c541e94a95ee6c55fe4d1b0ff531","observation_id":"c9f37115-5a2e-45cc-b2a6-1a70768210c8","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:56923d51cba80e653888efb43910b8197fa15227234b5ff786f637ef13a0ae4b","observation_id":"fdb20296-c51d-43b7-8b8e-1152f1cf6101","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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/3510454","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":null,"work_id":"968f4662-797e-4181-a29a-0ba04cae2491","year":2022},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:381fe552c0e2cb9184b0d772cfe9c6feb9083cc6890a9428b702f0bf1bc10c39","observation_id":"8de76d35-6612-41ad-a2d6-6388a33b31a6","resolution":{"observed_at":"2026-07-14T04:10:13.849449Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:23.530464+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:23.530464+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9780898719789","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2000.Branching Programs and Binary Decision Diagrams","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"86d4a259-dbca-4915-bf1f-e244f1046bae","year":2000},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:24998a22fece215048efea55f3fb5776d88d5e8731202db37b07e1109aef9871","observation_id":"f9a9e994-8ff1-404b-a31c-0fb0e1b950ab","resolution":{"observed_at":"2026-07-14T04:10:13.916713Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:21:23.763866+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:21:23.763866+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:10473806859e718e1b8582fda08e4dbe7a92309b331dd1e647f6cecbe78fabb6","observation_id":"f2b572b6-2c42-467e-a6f3-afd3f0ab53b7","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:84760c1a91739eb99d0e5205888ff2e6c93403ca4da93cc8972237c00c6f16bb","observation_id":"64e538ee-4192-4fe7-a845-a47087bf257c","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:fe38b5499111b04bfb3a428cb998b1a51fbd70d69f72d4f8fc691fd6d62e18a7","observation_id":"35775315-4a6e-4167-9227-5777b7dcfbd5","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":"Taking logarithms yields 𝑛≤ 2 log(1 + √","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:7c4002c70329efc64fa01dff3b4e2e8f131f687d73b4156357353d57279c7299","observation_id":"b703c791-6b59-41e5-aae0-95b94b4516cd","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","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-07-14T04:01:18.172992Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-14T04:01:18.172992Z"},"links":{"citing_paper":"/paper/2607.11665"},"observation_digest":"sha256:c1f6f464382ef67df0ad5a081b153d13a6d4e0147b4633735985dc1f6a36013f","observation_id":"ae1edd6a-4248-4dca-a9ad-4988a657eb27","resolution":{"observed_at":"2026-07-14T04:01:18.172992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.11665","last_updated":"2026-07-13T15:09:04Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-14T11:45:28.560812Z","submitted_at":"2026-07-13T15:09:04Z","title":"The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":15,"verified_fuzzy":0},"total_outbound_references":59},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2607.11665."}