{"as_of":"2026-08-09T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b96094936a00536f912fde21789a5fb7568951bd598c0decde53e3d1a93f9035","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T23:24:28.328856Z","state":"measured"},{"denominator":63,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":63,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.23990/citation-record","integrity":"/paper/2607.23990/integrity","json":"/paper/2607.23990/citation-record.json","paper":"/paper/2607.23990"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T23:24:22.055396Z","title":"Modeling by shortest data description.Automatica, 14(5):465–471, 1978","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.055396Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:bad26cec6f69f02968c53d1bc3ccd9ac026f6a208bed23984dc6007c3974bc7e","observation_id":"d1ac69d4-3bf6-455f-9f78-55d0896541ab","resolution":{"observed_at":"2026-07-31T23:24:22.055396Z","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-31T23:24:22.142929Z","title":"Second law of quantum complexity.Physical Review D, 97(8):086015, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.142929Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:8aa01f0d255ee5746a0f542138ae19284f9c423003cf4665c04bcfeecd89010e","observation_id":"4b5a388c-6926-4fc2-ba08-43662c7dc647","resolution":{"observed_at":"2026-07-31T23:24:22.142929Z","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-31T23:24:22.213015Z","title":"Holographic complexity equals bulk action? Physical review letters, 116(19):191301, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.213015Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:7f60fc7f39c59a43276d0464cdce6937e15e47bac2b1401832f255bd28a779e6","observation_id":"b3f9910a-3ff8-406a-9742-4e3fe331b442","resolution":{"observed_at":"2026-07-31T23:24:22.213015Z","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-31T23:24:22.260968Z","title":"Computational complexity and black hole horizons.Fortschritte der Physik, 64(1):24–43, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.260968Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:9e1a97acf68562f4f1924f850969e819fc9b8ad780c05bf646e9993279be1780","observation_id":"29b54dc5-e7d7-4770-ba7e-4b80734ef2d0","resolution":{"observed_at":"2026-07-31T23:24:22.260968Z","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-31T23:24:22.325484Z","title":"Linear growth of quantum circuit complexity.Nature Physics, 18(5):528–532, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.325484Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:0a14fd1c0ffed6f3dcd967d1edc37da7f483d31332e3572db682a0bfc6b209c8","observation_id":"4cc21104-f6b3-41ef-8a28-b81cb90931b0","resolution":{"observed_at":"2026-07-31T23:24:22.325484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0505030","last_updated":"2005-08-23T01:12:00Z","snapshot_observed_at":"2026-07-07T07:19:07.719177Z","submitted_at":"2005-05-06T00:55:45Z","title":"The Solovay-Kitaev algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0505030","snapshot_observed_at":"2026-07-31T23:24:22.380401Z","title":"The solovay-kitaev algorithm.arXiv preprint quant-ph/0505030, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.380401Z"},"links":{"cited_paper":"/paper/quant-ph/0505030","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:30b55928b5a9bb0d96de6c2a55b11e8cd8b10537a2c2dc38d49b32694ab80fc3","observation_id":"2a5c2cf2-23cb-4acc-922d-d70d576e279d","resolution":{"observed_at":"2026-07-31T23:24:22.380401Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0502070","last_updated":"2005-02-11T23:54:58Z","snapshot_observed_at":"2026-07-07T07:18:23.115345Z","submitted_at":"2005-02-11T23:54:58Z","title":"A geometric approach to quantum circuit lower bounds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0502070","snapshot_observed_at":"2026-07-31T23:24:22.442105Z","title":"A geometric approach to quantum circuit lower bounds.arXiv preprint quant-ph/0502070, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.442105Z"},"links":{"cited_paper":"/paper/quant-ph/0502070","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:238ca022a6d2996e8cad72ae368807b1b05b218bf9bb9e8c3810bad93936cdf4","observation_id":"6d0b791d-9855-48f7-8d1c-7955c70dbc25","resolution":{"observed_at":"2026-07-31T23:24:22.442105Z","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-31T23:24:22.500502Z","title":"Quantum computation as geometry.Science, 311(5764):1133–1135, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.500502Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:3e32e136e9f6f39bbfee849ea5f83e0ea8f24e96ae23bde14e73dee10b891c1d","observation_id":"56daca16-6ec3-4336-98d1-47561ebd5067","resolution":{"observed_at":"2026-07-31T23:24:22.500502Z","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-31T23:24:22.563819Z","title":"Optimal control, geometry, and quantum computing","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.563819Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:44ebb78d227d0ef0aa924cb94fb09d36c4ec6b42fd1149a61baebbf224397386","observation_id":"0eb361e7-a934-400b-b4e3-e78c9ce4798b","resolution":{"observed_at":"2026-07-31T23:24:22.563819Z","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-31T23:24:22.616501Z","title":"Optimal control of coupled spin dynamics: design of nmr pulse sequences by gradient ascent algorithms.Journal of magnetic resonance, 172(2):296–305, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.616501Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:ec1dd4c612af43502db0bd475c2c3793b617a95fc725b51b1d70e2b99a09e03d","observation_id":"f046bfe5-2545-48d0-93ff-6aa34a0c4ac0","resolution":{"observed_at":"2026-07-31T23:24:22.616501Z","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-31T23:24:22.678627Z","title":"Chopped random-basis quantum optimization.Physical Review A—Atomic, Molecular, and Optical Physics, 84(2):022326, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.678627Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:7fbb08c7d995f7723692007fa9931e8464433f7585aff867b3cb8a21c47b2a9f","observation_id":"685218ec-67d6-4ab0-bb9f-a93c1888a1fb","resolution":{"observed_at":"2026-07-31T23:24:22.678627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.03114","last_updated":"2023-07-25T19:49:02Z","snapshot_observed_at":"2026-08-05T03:34:12.681292Z","submitted_at":"2022-08-05T12:02:23Z","title":"Effectiveness of the Krotov method in controlling open quantum systems","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.03114","snapshot_observed_at":"2026-07-31T23:24:22.769044Z","title":"Effectiveness of the krotov method in controlling open quantum systems.arXiv preprint arXiv:2208.03114, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.769044Z"},"links":{"cited_paper":"/paper/2208.03114","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:2503f65fa2b0e99973316b8dbe912a2d305ac70bdc66249dcde960468a5cdbad","observation_id":"897119e8-5aed-47c9-ad75-fdf374065526","resolution":{"observed_at":"2026-07-31T23:24:22.769044Z","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-31T23:24:22.838042Z","title":"Tunable, flexible, and efficient optimization of control pulses for practical qubits.Physical review letters, 120(15):150401, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.838042Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:875f738b3fd16424a26fd6afb4d9da6537639b3f247871423cb01570cdfa735c","observation_id":"08105d74-189a-4da5-b81d-9f05615e4855","resolution":{"observed_at":"2026-07-31T23:24:22.838042Z","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-31T23:24:22.892553Z","title":"Universal quantum control through deep reinforcement learning.npj Quantum Information, 5(1):33, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.892553Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:94ead69e6effac177bb8fd5e456623091d378d85a40b5d9b0538196e95b36629","observation_id":"6a4a7b4e-7dfd-4ef1-a331-30dfb4648f9e","resolution":{"observed_at":"2026-07-31T23:24:22.892553Z","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-31T23:24:22.981949Z","title":"Open and closed loop approaches for energy efficient quantum optimal control.Advanced Quantum Technologies, 8(10):2400690, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:22.981949Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:890a55ba3c654240bcc519908b3e73486a66562904dccb90c628ccf452f54824","observation_id":"40d97d27-b81e-40f9-a684-4615c915a87c","resolution":{"observed_at":"2026-07-31T23:24:22.981949Z","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-31T23:24:23.043359Z","title":"Time/space trade-offs for reversible computation.SIAM Journal on Computing, 18(4):766–776, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.043359Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:2d6a98a9faff6ccc49138352fc1471e3974792c4bd2a05ece76c70664d76579b","observation_id":"d2ff55c0-cb89-451c-a42b-20a926c37662","resolution":{"observed_at":"2026-07-31T23:24:23.043359Z","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-31T23:24:23.092984Z","title":"Reversible pebbling game for quantum memory management","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.092984Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:20e887dab21105217a6c907fd98a884ca641b6caa22b8fae6022937c2fdaf5f0","observation_id":"4369f7da-9ad9-4fb7-b43d-225c4f80cef1","resolution":{"observed_at":"2026-07-31T23:24:23.092984Z","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-31T23:24:23.182030Z","title":"The uncertainty relation between energy and time in non-relativistic quantum mechanics","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.182030Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:6d927d0a70c25218df2c1f6e95d8061432ab8c256594009af20b7e9894171819","observation_id":"d0e772f1-09d0-44eb-870c-c061d71ea8b0","resolution":{"observed_at":"2026-07-31T23:24:23.182030Z","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-31T23:24:23.247101Z","title":"The maximum speed of dynamical evolution.Physica D: Nonlinear Phenomena, 120(1-2):188–195, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.247101Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:d4d4301ef738a9d8d7834ac5f69e191364cb86b5838f9c1c81112a19c766d470","observation_id":"447eacde-a9af-4cc1-a8f2-b0fa69a9c35e","resolution":{"observed_at":"2026-07-31T23:24:23.247101Z","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-31T23:24:23.332887Z","title":"Generalized geometric quantum speed limits.Physical Review X, 6(2):021031, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.332887Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:65ab158a1259e4c9a7a110cd7214d40f23e8e6a57ca9c6310e3c1f6c3e7ea0f2","observation_id":"4dfaf7ce-ec61-4cc5-8c94-629ddc4274fb","resolution":{"observed_at":"2026-07-31T23:24:23.332887Z","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-31T23:24:23.424804Z","title":"Quantum speed limits: from heisenberg’s uncertainty principle to optimal quantum control","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.424804Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:21977a7d32ca7fe21b3f7787cd6def41e8d85b5f33f3aedf9d59bf29885bc85e","observation_id":"a08cc4a8-62ec-4148-9534-d50b32f228e4","resolution":{"observed_at":"2026-07-31T23:24:23.424804Z","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-31T23:24:23.494213Z","title":"Springer, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.494213Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:3dc2cb97813ad4f6a65d2b6eb5abbf6ef8db0f6901b723e90953ae680c77d23f","observation_id":"25f05c65-f91f-4142-81ed-f8841aa52b49","resolution":{"observed_at":"2026-07-31T23:24:23.494213Z","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-31T23:24:23.581560Z","title":"Symmetry principles in quantum systems theory.Journal of mathematical physics, 52(11), 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.581560Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:fd323bbe3d59be21ddeccbae73b553d3385667b5f3129fa944e4cd22d93da0a8","observation_id":"6e3a5a25-d18b-4091-8aaa-d5513ff0ed18","resolution":{"observed_at":"2026-07-31T23:24:23.581560Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.05690","last_updated":"2023-09-23T14:02:13Z","snapshot_observed_at":"2026-07-06T16:17:04.004519Z","submitted_at":"2023-09-11T17:59:41Z","title":"Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.05690","snapshot_observed_at":"2026-07-31T23:24:23.675714Z","title":"Classification of dynamical lie algebras for translation-invariant 2-local spin systems in one dimension.arXiv preprint arXiv:2309.05690, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.675714Z"},"links":{"cited_paper":"/paper/2309.05690","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:ec215cd0ca47de4e0de1e5cfb22e59a0cb77c3455496896bceac3cc1fda90d9a","observation_id":"2f089cc4-0589-4871-b4ad-5c74795165c8","resolution":{"observed_at":"2026-07-31T23:24:23.675714Z","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-31T23:24:23.750303Z","title":"A universal operator growth hypothesis","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.750303Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:633c35e745f766e45c7a761243e0a1a46f6bd8a6ead32e2c3ec0f2b9459aa5e2","observation_id":"bc31801e-b459-4ede-9d5e-35ab9f0297ec","resolution":{"observed_at":"2026-07-31T23:24:23.750303Z","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-31T23:24:23.833685Z","title":"Operator complexity: a journey to the edge of krylov space.Journal of High Energy Physics, 2021(6):1–24, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.833685Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:49a03aed18c5d3ee25ff04fd0c843036df69e095128ed366387d262cab4a8843","observation_id":"27262f74-2185-4450-83df-c55f4643b52f","resolution":{"observed_at":"2026-07-31T23:24:23.833685Z","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-31T23:24:23.925768Z","title":"Efficient solvability of hamiltonians and limits on the power of some quantum computational models.Physical review letters, 97(19):190501, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.925768Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:a00ecde3ff9757a8c7a14ca1d62c4e10ef929522479b0c3df661e6cc0c85bedb","observation_id":"e67e24c3-4843-42da-ba49-311d7bf09ccf","resolution":{"observed_at":"2026-07-31T23:24:23.925768Z","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-31T23:24:23.996368Z","title":"Lie-algebraic classical simulations for quantum computing.Physical Review Research, 7(3):033266, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:23.996368Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:6b56886db9c42d5f77d17c9f9c588c0a9d0853e3ef01ffc6cc690a193711c945","observation_id":"1f252a5a-985d-4682-97ed-b72bad38606a","resolution":{"observed_at":"2026-07-31T23:24:23.996368Z","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-31T23:24:24.080158Z","title":"Optimalancilla-freeclifford+tapproximationofz-rotations.QuantumInf.Comput.,16(11&12):901– 953, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:24.080158Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:331a52999af57ccd8f52c1f387ad0348538078c7b3780774850ad6b077b99378","observation_id":"c7304212-928d-44e5-9adb-d9b08bc9b6ed","resolution":{"observed_at":"2026-07-31T23:24:24.080158Z","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-31T23:24:24.158182Z","title":"Eqisa: energy-efficient quantum instruction set architecture using sparse dictionary learning.arXiv preprint arXiv:2603.20646, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:24.158182Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:65f88499f02957057ab0a9b91a5a76c787bd7b5d28a91ed96c1fc65aebc74a25","observation_id":"31d9f7b8-ac31-4478-8459-1d0837194c11","resolution":{"observed_at":"2026-07-31T23:24:24.158182Z","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-31T23:24:24.211633Z","title":"Mqt bench: Benchmarking software and design automation tools for quantum computing.Quantum, 7:1062, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:24.211633Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:6c74afec603735b5d14cce34aa7960a45a3825dd188df389be3a032d4edca89f","observation_id":"f452d1b2-e568-4f2b-a65f-01012bf74f7d","resolution":{"observed_at":"2026-07-31T23:24:24.211633Z","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-31T23:24:24.315712Z","title":"Universal sequential search problems.Problems of information transmission, 9(3):265–266, 1973","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:24.315712Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:17833e335d5a970e9df2e507c195bc4233302322488b18785c921c42bfcde56a","observation_id":"2ab384c5-66b0-4d0a-9a30-a3d567705430","resolution":{"observed_at":"2026-07-31T23:24:24.315712Z","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-31T23:24:24.474450Z","title":"The speed prior: a new simplicity measure yielding near-optimal computable predictions","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:24.474450Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:7e8c5cecf151cc72ab86bc678cf074968703f8bcbd928026b70931a7148e715a","observation_id":"7e63a4d9-2e6e-4b5b-bb58-09c553774d59","resolution":{"observed_at":"2026-07-31T23:24:24.474450Z","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-31T23:24:24.622035Z","title":"A formal theory of inductive inference","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:24.622035Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:434732efe55d490d1ffd244ef9a6499ff0454c6cd5234809d4e6155c5ef982df","observation_id":"9045e36e-4e64-4db4-9778-3e7c7b4fe0ad","resolution":{"observed_at":"2026-07-31T23:24:24.622035Z","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-31T23:24:24.716667Z","title":"Laws of information conservation (nongrowth) and aspects of the foundation of probability theory","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:24.716667Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:4af2acaf911fcbbf4175f7da269fbd86eafa79f14e13080417d2cc237848d0a1","observation_id":"0fae8b36-7ef2-4b73-a69c-a8f5970c4e5a","resolution":{"observed_at":"2026-07-31T23:24:24.716667Z","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-31T23:24:24.880819Z","title":"Visualizing quantum circuit probability: estimating quantum state complexity for quantum program synthesis.Entropy, 25(5):763, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:24.880819Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:8590f2bf54012ce7fc49a6697fd08665e1da2293f2ab807e9021dbd4ae3dd4b5","observation_id":"f96bba63-6741-463d-a3fc-788d188a6c88","resolution":{"observed_at":"2026-07-31T23:24:24.880819Z","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-31T23:24:24.995906Z","title":"Algorithmic thermodynamics.Mathematical Structures in Computer Science, 22(5):771–787, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:24.995906Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:361b1cf6078e3b713e3f4c25749fa827c9ffbd505ca661660b1af6ac1c52463a","observation_id":"ca0d0ffa-6cb4-49fb-ab17-ce311dd7295c","resolution":{"observed_at":"2026-07-31T23:24:24.995906Z","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-31T23:24:25.227732Z","title":"Foundations of algorithmic thermodynamics.Physical Review E, 111(1):014118, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:25.227732Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:71ce04dfb88b570341f2d8096eb905d7d3d8a14e7eaabf378cc37e31c1077e01","observation_id":"ce381370-457f-4022-a22d-1ef31c467c76","resolution":{"observed_at":"2026-07-31T23:24:25.227732Z","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-31T23:24:25.372502Z","title":"What is the lagrangian counting?International Journal of Theoretical Physics, 42(2):363–381, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:25.372502Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:53a13e617caa9cd4c8158814227cbb526e5fc65486c1e1dedb998f3d49854c9d","observation_id":"c259f29d-0d15-451b-963e-17967781a8ce","resolution":{"observed_at":"2026-07-31T23:24:25.372502Z","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-31T23:24:25.510793Z","title":"Action, quantum computation and the structure of the yang–mills lagrangian.Quantum Studies: Mathematics and Foundations, 1(3):173–185, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:25.510793Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:5f0ceb1f286d1c0730534d282fedadf3b6a8f6e641d46130fb4eada7a3d942e2","observation_id":"9c2fdf44-077d-4436-a3df-972d32ce3ddd","resolution":{"observed_at":"2026-07-31T23:24:25.510793Z","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-31T23:24:25.681272Z","title":"na, 1988","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:25.681272Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:e1958cbfe575908ad2a0c10a9b175613c8567ac947ac10eb209f35598ee95b65","observation_id":"d316d503-5b75-46bf-a407-0a11789187e0","resolution":{"observed_at":"2026-07-31T23:24:25.681272Z","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-31T23:24:25.842338Z","title":"Information measures, effective complexity, and total information.Complexity, 2(1):44–52, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:25.842338Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:cb5d602a0f8cdcfaa4db071ffb74e5def29440d43f02e321c58fc80e43cc07db","observation_id":"70f6072f-ec3f-4c96-9481-b7bd506481b6","resolution":{"observed_at":"2026-07-31T23:24:25.842338Z","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-31T23:24:26.003448Z","title":"Effective complexity and its relation to logical depth.IEEE transactions on information theory, 56(9):4593–4607, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:26.003448Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:b0c0a139fadaf17149de3861c328961d0577d284725101683df7447c35cf6757","observation_id":"7b344a54-66ac-47c1-8e6a-8181edfa101f","resolution":{"observed_at":"2026-07-31T23:24:26.003448Z","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-31T23:24:26.137795Z","title":"Complexity as thermodynamic depth.Annals of physics, 188(1):186–213, 1988","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:26.137795Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:2a0dc7135cde0c6cecd2f362f082037b02e7c5871b4f516d6a13a71e89948f15","observation_id":"0634f276-4ee6-47b5-b7d4-8771a332fd6a","resolution":{"observed_at":"2026-07-31T23:24:26.137795Z","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-31T23:24:26.266545Z","title":"Inferring statistical complexity.Physical review letters, 63(2):105, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:26.266545Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:883ee072f9ba780f159a920c09a8529bdef371e9c34cbe92a6738037a632e3a3","observation_id":"91e528bb-cbf9-42e5-8a3f-7fd8f5ed2e86","resolution":{"observed_at":"2026-07-31T23:24:26.266545Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0004001","last_updated":"2000-04-03T06:16:16Z","snapshot_observed_at":"2026-08-05T07:12:56.583695Z","submitted_at":"2000-04-03T06:16:16Z","title":"A Theory of Universal Artificial Intelligence based on Algorithmic Complexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0004001","snapshot_observed_at":"2026-07-31T23:24:26.386671Z","title":"A theory of universal artificial intelligence based on algorithmic complexity.arXiv preprint cs/0004001, 2000","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:26.386671Z"},"links":{"cited_paper":"/paper/cs/0004001","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:96a26b239fd4f7a760e72c968107f1294947712fd5460cfba4ffbb27c36a988e","observation_id":"e8b22ede-1363-43b2-8727-9b54bca2fbba","resolution":{"observed_at":"2026-07-31T23:24:26.386671Z","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-31T23:24:26.522888Z","title":"Qksa: Quantum knowledge seeking agent","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:26.522888Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:d13128ca4a724cf36d796d8df3bfc233c0901539aabb83101df36d72de9af292","observation_id":"609ecf9e-7726-4196-8afd-f66fb3ad2787","resolution":{"observed_at":"2026-07-31T23:24:26.522888Z","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-31T23:24:26.705288Z","title":"Quantum aixi: Universal intelligence via quantum information","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:26.705288Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:0039cebd6f8a248fe02128cc5b157e96cf09e8403221cc1bed44d084eb72bbda","observation_id":"e5dd2873-29bd-4c1d-9cff-f484511cc715","resolution":{"observed_at":"2026-07-31T23:24:26.705288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.19924","last_updated":"2026-06-18T08:20:33Z","snapshot_observed_at":"2026-08-05T14:43:36.349636Z","submitted_at":"2026-06-18T08:20:33Z","title":"The Tao of Agency: Autotelic AI, Embedded Agency and Dissolution of the Self","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.19924","snapshot_observed_at":"2026-07-31T23:24:26.864552Z","title":"The tao of agency: Autotelic ai, embedded agency and dissolution of the self.arXiv preprint arXiv:2606.19924, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:26.864552Z"},"links":{"cited_paper":"/paper/2606.19924","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:583af4ae18b406235aa58851ac276785301692e912d1b5a0bba4f88bba165401","observation_id":"4ba5e005-31dd-43ef-8298-cb229095f7c3","resolution":{"observed_at":"2026-07-31T23:24:26.864552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22954","last_updated":"2026-03-12T23:47:40Z","snapshot_observed_at":"2026-07-06T21:32:33.515702Z","submitted_at":"2025-05-29T00:26:15Z","title":"Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22954","snapshot_observed_at":"2026-07-31T23:24:27.012566Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:27.012566Z"},"links":{"cited_paper":"/paper/2505.22954","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:62e7a21a6bd45cf99d5302ead98b3b4452db0fdb559c208a755c94a305002863","observation_id":"6c45b437-5a0c-4256-8ed2-e0394a0c70c3","resolution":{"observed_at":"2026-07-31T23:24:27.012566Z","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-31T23:24:27.143994Z","title":"Hyperagents.arXiv preprint arXiv:2603.19461, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:27.143994Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:33d51b306e347aebb63600c1aa7d6accf84af09340c6bffdff831b06c9bc80a9","observation_id":"558b4e5b-db31-4f20-935b-fa4541e51b02","resolution":{"observed_at":"2026-07-31T23:24:27.143994Z","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-31T23:24:27.319135Z","title":"Gödel machines: Fully self-referential optimal universal self-improvers","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:27.319135Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:fcd5caf06bc2088f30e50a99d015d63651beac9c7236f4e4d0af97be95725ff3","observation_id":"8503aa3b-cdf9-45f7-9583-1f9bff2bb17c","resolution":{"observed_at":"2026-07-31T23:24:27.319135Z","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-31T23:24:27.443060Z","title":"bzip2 and libbzip2.avaliable at http://www","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:27.443060Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:c9cc396ebd792797dfd788ef1fd32edd9fc6881b6ed04a7fc01757f8fd3b6797","observation_id":"55256664-4656-4928-babd-e13dda03531c","resolution":{"observed_at":"2026-07-31T23:24:27.443060Z","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-31T23:24:27.504129Z","title":"Pybdm: Python interface to the block decomposition method (0.1","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:27.504129Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:0fd41c4ab69f1d0971d836f784d342e74fc18d673113a9a3ab6d96e0b215951c","observation_id":"2610c590-335a-4afc-99ed-cb36d44b69b2","resolution":{"observed_at":"2026-07-31T23:24:27.504129Z","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-31T23:24:27.621805Z","title":"Calculating kolmogorov complexity from the output frequency distributions of small turing machines.PloS one, 9(5):e96223, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:27.621805Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:9f48e311c54b8b210abc54593a53dfba42c79d27e4cd56cbc5765a307f393bd0","observation_id":"fefdf6ce-319b-4116-8c1d-39a18f4d3f08","resolution":{"observed_at":"2026-07-31T23:24:27.621805Z","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-31T23:24:27.708382Z","title":"Yaqq: yet another quantum quantizer design space exploration of quantum gate sets using novelty search.New Journal of Physics, 28(4):044504, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:27.708382Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:04754e4c9d2fd7ccfa29bce7c6f3f24f8c1d77e36a750aa9d1ec2314941d069a","observation_id":"6c676919-2e01-48f7-8cf0-fb74d5eb7203","resolution":{"observed_at":"2026-07-31T23:24:27.708382Z","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-31T23:24:27.785079Z","title":"Super-golden-gates for pu (2).Advances in Mathematics, 327:869–901, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:27.785079Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:c8249ce505d1809d470017d613b288af7624e3a449a0769b14e0e61566bcc2ba","observation_id":"e9feba71-1184-42ee-8794-c545bab68d6b","resolution":{"observed_at":"2026-07-31T23:24:27.785079Z","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-31T23:24:27.941075Z","title":"Discovering quantum circuit components with program synthesis.Machine Learning: Science and Technology, 5(2):025029, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:27.941075Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:df89ab195783baa76da18867194d47fbf9435295f5e6451a6eb32dc43de422ab","observation_id":"bb0f2ade-f7c5-441a-8465-e072e2ba4bad","resolution":{"observed_at":"2026-07-31T23:24:27.941075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.11054","last_updated":"2020-03-01T00:38:46Z","snapshot_observed_at":"2026-08-08T19:43:09.940097Z","submitted_at":"2020-02-25T17:24:50Z","title":"MLIR: A Compiler Infrastructure for the End of Moore's Law","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.11054","snapshot_observed_at":"2026-07-31T23:24:28.039849Z","title":"Mlir: A compiler infrastructure for the end of moore’s law.arXiv preprint arXiv:2002.11054, 2020","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:28.039849Z"},"links":{"cited_paper":"/paper/2002.11054","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:e12cc2d3a49cc92d68dfb548dfb944fc1d5e3b17e3dbdd32da31197d8e083bb7","observation_id":"9c169599-1e0a-4cc0-a869-2ca5d7482d2a","resolution":{"observed_at":"2026-07-31T23:24:28.039849Z","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-31T23:24:28.108902Z","title":"Qssa: an ssa-based ir for quantum computing","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:28.108902Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:a1b66bb457cb2ab79a21ea611ef9bfa2f2d96637fd47f002f608200247bc7550","observation_id":"3e3c6a21-7db4-4154-aa13-8f5590eca704","resolution":{"observed_at":"2026-07-31T23:24:28.108902Z","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-31T23:24:28.178228Z","title":"The structure and performance of efficient interpreters.Journal of Instruction-Level Parallelism, 5:1–25, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:28.178228Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:73859b29ee323d1c632153d967458bcd6ca564f6651c649638a3885fe4dc066e","observation_id":"a2e61614-a2f0-4694-b2ce-a4e071a1b6d7","resolution":{"observed_at":"2026-07-31T23:24:28.178228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.08310","last_updated":"2025-04-11T07:23:14Z","snapshot_observed_at":"2026-08-07T16:06:37.683908Z","submitted_at":"2025-04-11T07:23:14Z","title":"DeQompile: quantum circuit decompilation using genetic programming for explainable quantum architecture search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.08310","snapshot_observed_at":"2026-07-31T23:24:28.256418Z","title":"Deqompile: quantum circuit decompilation using genetic programming for explainable quantum architecture search.arXiv preprint arXiv:2504.08310, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:28.256418Z"},"links":{"cited_paper":"/paper/2504.08310","citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:e3cbc8e05e62a4771150ea3d632a1997843516e124740c03f95c2eaa0ebe0999","observation_id":"178b3932-92a8-42f0-9caa-418ec1ba36cf","resolution":{"observed_at":"2026-07-31T23:24:28.256418Z","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-31T23:24:28.328856Z","title":"Compression and explanation using hierarchical grammars.The Computer Journal, 40(2_and_3):103–116, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-31T23:24:28.328856Z"},"links":{"citing_paper":"/paper/2607.23990"},"observation_digest":"sha256:5b1db286f596f60ec19c721fda932f33c4f8ddf6b643df23db42857aa591d573","observation_id":"e3248db4-e203-4802-8e5a-5b2df326d5bd","resolution":{"observed_at":"2026-07-31T23:24:28.328856Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23990","last_updated":"2026-07-27T04:39:10Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-07-31T23:24:19.434220Z","submitted_at":"2026-07-27T04:39:10Z","title":"DeComp2: Description Complexity aware Decomposition"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":63,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":63},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 0 inbound Pith citation observations for arXiv:2607.23990."}