{"as_of":"2026-08-21T15:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7eda6a0497f7f8309e9ab775672fc23d0433a9eea01dc553da20ccb361bc80c0","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-25T23:59:26.412209Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2606.24789/citation-record","integrity":"/paper/2606.24789/integrity","json":"/paper/2606.24789/citation-record.json","paper":"/paper/2606.24789"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-25T23:59:26.412209Z","title":"https://gitlab.tudelft.nl/ardeq-group/paulilim (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:8f4dfc7d9c0812a498656ab4b9c721ae2be0430bc64cfb19444db4eb97111701","observation_id":"d9c639b9-9b1f-4a31-a4f3-dfe6c92d39eb","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"https://gitlab.tudelft.nl/ardeq-group/qoldder (2026)","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:ad59e7c3b362b82ab294dc2bf64a82184a6c5b38fd280660566c36c21376491a","observation_id":"08ddade4-8b3d-44c9-a6c0-f26f80c5200e","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Physical Review A—Atomic, Molecular, and Optical Physics70(5), 052328 (2004)","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:6a6f4bad1671f09a7cfcc56ecbf09797fd2f157dd3c9970fe48b57c82e2df933","observation_id":"28fb03ce-6ee7-4574-8e62-c4a11c1b9a7c","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:b978acf1ff8e44833a1e80262134aeb9d477eae13bf8a1ea149a4ee4ec1487dc","observation_id":"46ad3a1c-d855-4017-a814-188fd2d49870","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"New Journal of Physics7(1), 170 (2005), http: //stacks.iop.org/1367-2630/7/i=1/a=170","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:d5cca4457c18a2aa1399479c8d16cb409cbb55f9c3c213f9947b43a5d03c4d87","observation_id":"db8c8fcc-5d4a-4b36-aa46-a6b8eb4d6c0d","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Formal methods in system design10(2), 171–206 (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:81d7f75ef24ef42849de3fc07a92c4635b5b96ecfe68202136287249f2472d28","observation_id":"7a922092-2dca-44b9-9335-0f818f9c859f","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:770423686e1c0c47cc12387a0a5bd98d84f94a007bbb0c6eac4b7ebff5006831","observation_id":"a46b2a80-a3a8-46a0-8a2c-dac080970c2b","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:5986a64f75a719bb23f3b6381f168e2e93f2793e61137d1137a31744ea2150f1","observation_id":"4ad74159-534d-4249-a2ec-75c87e757e12","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"ACM Computing Surveys (CSUR)24(3), 293–318 (1992)","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:6c9435c6d74f137deaeb3f5952d3e0fd910061086765c1039c210cd0d1553915","observation_id":"fec022a6-4836-4395-b53a-fd5823848e34","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 40(9), 1810–1824 (2020)","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:7d4229e5fa4fd509f28b2f29b74d39a65038d473a91ad2c90a17c762b88702e7","observation_id":"03b7b5a4-c4d0-4ac1-ad94-68d5fc8213ca","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Chemical reviews119(19), 10856–10915 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:e32988bc889aa385c2f2a021b5cd27d732463f4abdd1403fb598ab1f79132cb4","observation_id":"f5c799a8-7052-4773-a014-55a7873a76c9","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: International Conference on Tools and Algo- rithms for the Construction and Analysis of Systems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:8c5d6c2ecc84ef08ce1cbe9deba7310aeb0082ae13814a45ab986d1d778d3394","observation_id":"d22eae6c-46fa-4253-889f-9a5df48afeea","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Formal methods in system design10(2), 149–169 (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:cedfc0a8fc2860414a8d3e5fe5350c3ede5372f6a961d245c58d723dfe38ddba","observation_id":"96e329c0-03db-420f-b8b2-95f2ac8689cd","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Reviews of Modern Physics86(1), 153–185 (2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:6e543b09f602bad36f2c2d7c1a9c1292e8a4fa1abe5f9010e48f2efa31db4259","observation_id":"c95baca2-501b-4fca-81ab-740327120f6b","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"IEEE Transac- tions on Quantum Engineering2, 1–17 (2021)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:7faf4f537e8fbe8e9d2ef6b2a522133d17c0067592b7e04de8f7254c578bd624","observation_id":"62a63486-300d-4e03-b422-12b39976c19f","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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":"2504.01168","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T16:59:59.091153Z","title":"arXiv preprint arXiv:2504.01168 (2025)","venue":null,"work_id":"5f1071c9-8ec2-4847-be39-6548caf454f1","year":2025},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:1920c7a4adc284047da2a3c3930763621e6c03d5719ba6e0e507c91b2502c652","observation_id":"f38a2e7e-a0d5-46ec-8fa2-82eee53f3e2f","resolution":{"observed_at":"2026-07-04T16:59:59.092873Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-25T23:59:26.412209Z","title":"In: Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:538b082b2aa50968d32edf15f2f3c399ccc30b1f8ac30d8c94d493d6cbcc488f","observation_id":"d38488b7-b863-49b8-8330-a9a0a9423d32","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Physical Review B100(13), 134306 (2019) 18 J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:e8498a7306b1b2f30f65e059e54c60b03c8096a326fdb824c1fac7fb4b505ee1","observation_id":"7d20f1c8-f7cc-4e93-83ba-390ffa18cc62","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Journal of Symbolic Computation23(4), 335–354 (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:c0080c73bb84c2892064926670a2fe433cd902e5b3ca2b9e8f554e02efc71b0e","observation_id":"141b04f4-cde6-4152-8771-88cd36d3185a","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: Symbolic model checking, pp","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:335c2a90d06602a15c33b5582f0f8757cc9cf5865fc12522704e890f3419b2dc","observation_id":"8b85774b-a4f5-4d91-a771-eb807cf59b2b","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: 36th International Symposium on Multiple-Valued Logic (ISMVL’06)","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:7f1e70038fc4264d22392c2811d7a226051354a5417d58eee0efe3b196cee1eb","observation_id":"59e28a3c-b793-45be-b4af-94d1eb9f9ff0","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Cambridge University Press (2000)","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:9d6aa0978955654f4fc331eab5a3ee9571ad48e448ea45192a13d8eb0fcb1d06","observation_id":"d5fcbb42-27d7-41f4-ad01-387d5638900f","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Reviews in Physics4, 100028 (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:2b57858dc23da39c50cc26957cee77ee6b0611586897af1c95c3e11ec9b20715","observation_id":"4ae2133d-acae-4c89-848d-16239d8b453b","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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.22331/q-2023-07-20-1062","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum, doi:10.22331/q-2023-07-20-1062","venue":"Quantum","work_id":"a18cc4bc-f640-4c30-9d17-e703da8101e8","year":2023},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:4955a84d5c0d1bb45a8e79aa4a03a0b95001f4e65507a3aaf3c50b33b0d61298","observation_id":"4e3ef510-6c3f-4ede-ac7f-52bc31af874a","resolution":{"observed_at":"2026-06-26T00:08:43.147801Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-02T05:08:12.040871+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-02T05:08:12.040871+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2602.17775","doi":"10.48550/arxiv.2602.17775","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2602.17775 (2026).https://doi.org/10.48550/arXiv.2602.17775","venue":"Open MIND","work_id":"1465ffde-4a8d-4a1a-ae99-9d50376e9433","year":2026},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:09205e110c6b9773ca3413ff6a1eca3f3eb4cfe43c1f84e747daf292d323ace8","observation_id":"d8728325-df94-4cf6-8820-105c5f20b8af","resolution":{"observed_at":"2026-07-04T16:59:59.086900Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-05-24T01:24:40.208686+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-24T01:24:40.208686+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-25T23:59:26.412209Z","title":"In: European Symposium on Algorithms","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:cbebed37d703a860f57aedfcb9fc060253abd97637c8b077ed6377d14b36d38e","observation_id":"2e9d8b27-d2d6-4993-b711-74d2f38f057e","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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.5281/zenodo.19763549","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"faster algorithm for achieving minimal-size quantum decision diagrams","venue":"Zenodo (CERN European Organization for Nuclear Research)","work_id":"4b8afc11-ab81-4978-b10b-48553aa1cba7","year":2026},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:f294f4196c80f87d8749191689fe6bf4a45c3e8c9c0de54abe333c38cef86bad","observation_id":"6bdf4bc6-1f4d-4957-9447-4ee11562ea9e","resolution":{"observed_at":"2026-06-26T00:08:43.149680Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-25T23:59:26.412209Z","title":"In: IJCAI","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:94c79ce66a3600e974b9abff8e48f70ff3452e9b9a0b9260880eeb692b7e4138","observation_id":"1bac1434-4505-4453-b120-32815c5be359","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: FOCS","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:2d10a2ba090282689fc0e915eb7ea5788143a6cd1148b8db43f2b5c29f73f9c0","observation_id":"f1a0a99f-b49f-44ae-b8c3-f02e7e99aab8","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:44f21a1ed02bd3f8ea0e42a7f0d614ceaf997ba9dd3e76ad89a6a421900588e6","observation_id":"cf81ed18-ce77-4f1c-93ed-a396c2b66f88","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Proceedings of the ACM on Programming Languages 8(OOPSLA2), 1390–1419 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:d06cdb7a66028e8a134a0d035b2bd1a45916651edc96d43b3cfed7f62dbefab8","observation_id":"f8ee7317-0b13-43c2-986a-db0089344c4c","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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":"web/2017120","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T16:59:59.088284Z","title":"https: //web.archive.org/web/20171208230728/http://vlsi.colorado.edu/~fabio/CUDD/ cudd.pdf (2015)","venue":null,"work_id":"aa6a8e1f-904c-4c90-93f9-35fa15ceb008","year":2015},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:9ebf905a3491db69f157873dee4d985d1ed22cfd5b8bb122a073edb62e748bce","observation_id":"5cb5417f-7da2-4607-b4a4-acd030edd620","resolution":{"observed_at":"2026-07-04T16:59:59.090038Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-06-25T23:59:26.412209Z","title":"For- mal Methods in System Design10(2), 243–270 (1997)","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:f945efd076326af81476155ba5b5b808f0121b58577c9106e541bd97f5cb0a76","observation_id":"0659fffd-737a-4eee-b03c-307c2cfd167f","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: International Symposium on Automated Technology for Verification and Analysis","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:6cda3cdc1399e743d04b8d7f8f06396878c0a1cb4e4945ebb7801fae75882645","observation_id":"cf50c2fe-2a25-4696-a3ab-37dc28ea1aba","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: 2021 58th ACM/IEEE Design Automation Conference (DAC)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:e737c2e120db2132eb9b1f83613d309e2dff070f75965849b79673ce5d0affbc","observation_id":"ef53e1d5-2bf9-43d8-a81f-7949185ed1c5","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: Proceedings Design, Automation and Test in Europe Conference and Exhibition","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:91166215297860bc62fa29992e450f72bd66dfd6c22efc21b4814564faae6ccb","observation_id":"60580188-1cb9-47a9-a3ba-11bccfcefca0","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"Quantum7, 1108 (2023) Faster algorithm for achieving minimal-size quantum decision diagrams 19","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:ac739a92101bef7586945e6bbf79f8062d0ba48899b3afdbd5d1052ba2d6e0ca","observation_id":"3e37cbfb-141e-48e2-a7f1-b617731051b0","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: Proceedings of the AAAI Conference on Artificial Intel- ligence","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:6592f32ea17c02006ba598d7c728ca176bba29d0f6f1b7a969215a3eee7a3e62","observation_id":"4ff9bc0b-eb4a-49aa-b540-23f3e8e87075","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: International Symposium on Model Checking Software","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:f7e9aa538cec92d115da9430472530e6addfd1a53b2d19dd47df0f65b450588b","observation_id":"d37c1451-f2b4-4eef-a751-d8f5cd2c7fa4","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: Proceedings of the 59th Design Automation Conference","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:dc05ff69aae987a9eadf01bd21631c3d0997e153910bbc4a955d6f915bf6c71d","observation_id":"72e3c535-1776-4ba2-b562-3b113e92b719","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"In: 2019 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:e6d60850b8c30de4cc0bf0c295b30322ea0dca2ccb224fa008cd693c56faff66","observation_id":"1eec91b3-65f7-4124-b5a5-3e610835d0e6","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","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-06-25T23:59:26.412209Z","title":"u≼w” in the caption. This condition would be replaced by “max precedence holds","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-25T23:59:26.412209Z"},"links":{"citing_paper":"/paper/2606.24789"},"observation_digest":"sha256:522d728bfbfb360f8d98014624e5d9f254f4d5bb1ac1c71baee7cbc5c91c0a7c","observation_id":"15eb5648-9249-4606-a2f7-655452770bd2","resolution":{"observed_at":"2026-06-25T23:59:26.412209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.24789","last_updated":"2026-06-23T16:45:48Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T07:26:48.194379Z","submitted_at":"2026-06-23T16:45:48Z","title":"Faster algorithm for achieving minimal-size quantum decision diagrams"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":42},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2606.24789."}