Pith. sign in

Paper Citation Record · LEDGER

DeComp2: Description Complexity aware Decomposition

As of 18 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 0 inbound Pith citation observations for arXiv:2607.23990.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.23990 v1

Coverage vector

measured 63 of 63 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-31T23:24:28.328856Z

measured 63 of 63 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

63 of 63 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved63
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation d1ac69d4-3bf6-455f-9f78-55d0896541ab · outbound

This paper cites Modeling by shortest data description.Automatica, 14(5):465–471, 1978.

DeComp2: Description Complexity aware Decomposition Modeling by shortest data description.Automatica, 14(5):465–471, 1978

Reference 1

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.055396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.055396Z digest=sha256:c981f032129386b6af6ec3215779d7543f6a7963cded5fcb7613c4ae9020936d

Observation 4b5a388c-6926-4fc2-ba08-43662c7dc647 · outbound

This paper cites Second law of quantum complexity.Physical Review D, 97(8):086015, 2018.

DeComp2: Description Complexity aware Decomposition Second law of quantum complexity.Physical Review D, 97(8):086015, 2018

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.142929Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.142929Z digest=sha256:b60920928db4c74955ffbb1604944ba7c65cad3e7207e002d634b4c2d73092b0

Observation b3f9910a-3ff8-406a-9742-4e3fe331b442 · outbound

This paper cites Holographic complexity equals bulk action? Physical review letters, 116(19):191301, 2016.

DeComp2: Description Complexity aware Decomposition Holographic complexity equals bulk action? Physical review letters, 116(19):191301, 2016

Reference 3

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.213015Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.213015Z digest=sha256:8b859afc2a3f23fdcbcd03f34e83aaa3ee5beab3b21a2d61553cf66d6b475c84

Observation 29b54dc5-e7d7-4770-ba7e-4b80734ef2d0 · outbound

This paper cites Computational complexity and black hole horizons.Fortschritte der Physik, 64(1):24–43, 2016.

DeComp2: Description Complexity aware Decomposition Computational complexity and black hole horizons.Fortschritte der Physik, 64(1):24–43, 2016

Reference 4

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.260968Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.260968Z digest=sha256:55045f70e2454542a1a55a32b8d2d145b069ee26ae5edf2b609025a03e3aae73

Observation 4cc21104-f6b3-41ef-8a28-b81cb90931b0 · outbound

This paper cites Linear growth of quantum circuit complexity.Nature Physics, 18(5):528–532, 2022.

DeComp2: Description Complexity aware Decomposition Linear growth of quantum circuit complexity.Nature Physics, 18(5):528–532, 2022

Reference 5

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.325484Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.325484Z digest=sha256:9d25d49c0f13163bb68782e1875fa8b3da653013523478e93df892310add298e

Observation 2a5c2cf2-23cb-4acc-922d-d70d576e279d · outbound

This paper cites The Solovay-Kitaev algorithm.

DeComp2: Description Complexity aware Decomposition The Solovay-Kitaev algorithm

Reference 6

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.380401Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.380401Z digest=sha256:5c4f6df76bcb125e256797dfbd2f7406380372a806d78f7af3e3364197eb462e

Observation 6d0b791d-9855-48f7-8d1c-7955c70dbc25 · outbound

This paper cites A geometric approach to quantum circuit lower bounds.

DeComp2: Description Complexity aware Decomposition A geometric approach to quantum circuit lower bounds

Reference 7

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.442105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.442105Z digest=sha256:45f2cd85808313563b05a8129b7a43c413bcc4df952e0aabc84986c781e024a5

Observation 56daca16-6ec3-4336-98d1-47561ebd5067 · outbound

This paper cites Quantum computation as geometry.Science, 311(5764):1133–1135, 2006.

DeComp2: Description Complexity aware Decomposition Quantum computation as geometry.Science, 311(5764):1133–1135, 2006

Reference 8

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.500502Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.500502Z digest=sha256:c2def8aed34473492f997ad5ca173cd5deb11f7ae2dfd96703527d6a1af7fcc9

Observation 0eb361e7-a934-400b-b4e3-e78c9ce4798b · outbound

This paper cites Optimal control, geometry, and quantum computing.

DeComp2: Description Complexity aware Decomposition Optimal control, geometry, and quantum computing

Reference 9

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.563819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.563819Z digest=sha256:041377f16013972b57ec944ff484cb68a11901280111d48d94e4606d24cdf337

Observation f046bfe5-2545-48d0-93ff-6aa34a0c4ac0 · outbound

This paper cites Optimal control of coupled spin dynamics: design of nmr pulse sequences by gradient ascent algorithms.Journal of magnetic resonance, 172(2):296–305, 2005.

DeComp2: Description Complexity aware Decomposition Optimal control of coupled spin dynamics: design of nmr pulse sequences by gradient ascent algorithms.Journal of magnetic resonance, 172(2):296–305, 2005

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.616501Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.616501Z digest=sha256:ac13d23d21b886064804c24dd5ce2cc449a11954eb0c1b0e9a4c673c119bff0b

Observation 685218ec-67d6-4ab0-bb9f-a93c1888a1fb · outbound

This paper cites Chopped random-basis quantum optimization.Physical Review A—Atomic, Molecular, and Optical Physics, 84(2):022326, 2011.

DeComp2: Description Complexity aware Decomposition Chopped random-basis quantum optimization.Physical Review A—Atomic, Molecular, and Optical Physics, 84(2):022326, 2011

Reference 11

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.678627Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.678627Z digest=sha256:a9918f185efb91bdf070125be7d593faf3d893f2acd0175a9f52544b880f1289

Observation 897119e8-5aed-47c9-ad75-fdf374065526 · outbound

This paper cites Effectiveness of the Krotov method in controlling open quantum systems.

DeComp2: Description Complexity aware Decomposition Effectiveness of the Krotov method in controlling open quantum systems

Reference 12

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.769044Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.769044Z digest=sha256:12c993a156de18738a6af10efab7e71eb523e9f76a5c2e21da96265826ba511d

Observation 08105d74-189a-4da5-b81d-9f05615e4855 · outbound

This paper cites Tunable, flexible, and efficient optimization of control pulses for practical qubits.Physical review letters, 120(15):150401, 2018.

DeComp2: Description Complexity aware Decomposition Tunable, flexible, and efficient optimization of control pulses for practical qubits.Physical review letters, 120(15):150401, 2018

Reference 13

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.838042Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.838042Z digest=sha256:97b6af179507280f64c024015cb137d5701d66181716f6ef3c7314aa7fbb5a5b

Observation 6a4a7b4e-7dfd-4ef1-a331-30dfb4648f9e · outbound

This paper cites Universal quantum control through deep reinforcement learning.npj Quantum Information, 5(1):33, 2019.

DeComp2: Description Complexity aware Decomposition Universal quantum control through deep reinforcement learning.npj Quantum Information, 5(1):33, 2019

Reference 14

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.892553Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.892553Z digest=sha256:a92e17c8b71de169445b9a0485fee0acff0c030baef6d3a273be0edf82ac6cdb

Observation 40d97d27-b81e-40f9-a684-4615c915a87c · outbound

This paper cites Open and closed loop approaches for energy efficient quantum optimal control.Advanced Quantum Technologies, 8(10):2400690, 2025.

DeComp2: Description Complexity aware Decomposition Open and closed loop approaches for energy efficient quantum optimal control.Advanced Quantum Technologies, 8(10):2400690, 2025

Reference 15

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:22.981949Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:22.981949Z digest=sha256:6bbfe3533ef45e0c83169d067b34b5f8098cf9f1087015ed8cf0c0bd9ef7d27e

Observation d2ff55c0-cb89-451c-a42b-20a926c37662 · outbound

This paper cites Time/space trade-offs for reversible computation.SIAM Journal on Computing, 18(4):766–776, 1989.

DeComp2: Description Complexity aware Decomposition Time/space trade-offs for reversible computation.SIAM Journal on Computing, 18(4):766–776, 1989

Reference 16

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.043359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.043359Z digest=sha256:24c24731eabd5d59df6d9671db0ebc0ebd2cc92759ccc212c28fea135a40afe7

Observation 4369f7da-9ad9-4fb7-b43d-225c4f80cef1 · outbound

This paper cites Reversible pebbling game for quantum memory management.

DeComp2: Description Complexity aware Decomposition Reversible pebbling game for quantum memory management

Reference 17

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.092984Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.092984Z digest=sha256:860bc25843a02919c9b3c90b8e0c9772d4ccea43116bc67e1b4e3bac01af188f

Observation d0e772f1-09d0-44eb-870c-c061d71ea8b0 · outbound

This paper cites The uncertainty relation between energy and time in non-relativistic quantum mechanics.

DeComp2: Description Complexity aware Decomposition The uncertainty relation between energy and time in non-relativistic quantum mechanics

Reference 18

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.182030Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.182030Z digest=sha256:e5502e0a0d3dd4a89c182cf686097840d2903ea0927fbd63024f4fe850ce11f3

Observation 447eacde-a9af-4cc1-a8f2-b0fa69a9c35e · outbound

This paper cites The maximum speed of dynamical evolution.Physica D: Nonlinear Phenomena, 120(1-2):188–195, 1998.

DeComp2: Description Complexity aware Decomposition The maximum speed of dynamical evolution.Physica D: Nonlinear Phenomena, 120(1-2):188–195, 1998

Reference 19

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.247101Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.247101Z digest=sha256:11e37a79bdb360007d52f489f7cc93f101b8c39fedf16d4c2ae971009119b847

Observation 4dfaf7ce-ec61-4cc5-8c94-629ddc4274fb · outbound

This paper cites Generalized geometric quantum speed limits.Physical Review X, 6(2):021031, 2016.

DeComp2: Description Complexity aware Decomposition Generalized geometric quantum speed limits.Physical Review X, 6(2):021031, 2016

Reference 20

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.332887Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.332887Z digest=sha256:fbcaad11c0caca9c3b29f3d29a9d37e0097037c68fbda645c6184c1f8cb212ae

Observation a08cc4a8-62ec-4148-9534-d50b32f228e4 · outbound

This paper cites Quantum speed limits: from heisenberg’s uncertainty principle to optimal quantum control.

DeComp2: Description Complexity aware Decomposition Quantum speed limits: from heisenberg’s uncertainty principle to optimal quantum control

Reference 21

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.424804Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.424804Z digest=sha256:b6d52ada7fce76dbf6a0aa5d9de739da79f56ced8de78e1f7678a1c70fc1f472

Observation 25f05c65-f91f-4142-81ed-f8841aa52b49 · outbound

This paper cites Springer, 2008.

DeComp2: Description Complexity aware Decomposition Springer, 2008

Reference 22

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.494213Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.494213Z digest=sha256:c4977f525d0c8fb4916a2f56a595c625c6f715fc06042ec79db792d06a53e432

Observation 6e3a5a25-d18b-4091-8aaa-d5513ff0ed18 · outbound

This paper cites Symmetry principles in quantum systems theory.Journal of mathematical physics, 52(11), 2011.

DeComp2: Description Complexity aware Decomposition Symmetry principles in quantum systems theory.Journal of mathematical physics, 52(11), 2011

Reference 23

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.581560Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.581560Z digest=sha256:4ee28b256401e15e62ea0356c170bdb35d836cbac9ca18d338c4df151a6bd8b3

Observation 2f089cc4-0589-4871-b4ad-5c74795165c8 · outbound

This paper cites Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension.

DeComp2: Description Complexity aware Decomposition Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension

Reference 24

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.675714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.675714Z digest=sha256:4aec19204ae3ef9d0d0c68eb9eeebdd391ec53b7d57ce4b5c6207d965f334887

Observation bc31801e-b459-4ede-9d5e-35ab9f0297ec · outbound

This paper cites A universal operator growth hypothesis.

DeComp2: Description Complexity aware Decomposition A universal operator growth hypothesis

Reference 25

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.750303Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.750303Z digest=sha256:69da514e6a9ea37bc256e7859927cc550029fbd8a7b849513211c5b34282b677

Observation 27262f74-2185-4450-83df-c55f4643b52f · outbound

This paper cites Operator complexity: a journey to the edge of krylov space.Journal of High Energy Physics, 2021(6):1–24, 2021.

DeComp2: Description Complexity aware Decomposition Operator complexity: a journey to the edge of krylov space.Journal of High Energy Physics, 2021(6):1–24, 2021

Reference 26

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.833685Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.833685Z digest=sha256:6e33f3793619cb226b73e127e6f0b73d83367696f33d5dc305f6e188347b45a6

Observation e67e24c3-4843-42da-ba49-311d7bf09ccf · outbound

This paper cites Efficient solvability of hamiltonians and limits on the power of some quantum computational models.Physical review letters, 97(19):190501, 2006.

DeComp2: Description Complexity aware Decomposition Efficient solvability of hamiltonians and limits on the power of some quantum computational models.Physical review letters, 97(19):190501, 2006

Reference 27

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.925768Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.925768Z digest=sha256:f9940154f47445d9ffa8580c210d583f5f777451d8e9e6b0bb2a04788015b5a8

Observation 1f252a5a-985d-4682-97ed-b72bad38606a · outbound

This paper cites Lie-algebraic classical simulations for quantum computing.Physical Review Research, 7(3):033266, 2025.

DeComp2: Description Complexity aware Decomposition Lie-algebraic classical simulations for quantum computing.Physical Review Research, 7(3):033266, 2025

Reference 28

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:23.996368Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:23.996368Z digest=sha256:254c143e335edaaf0632ff092e8aa19bb2235222ece9c48f928331c2b002b3f7

Observation c7304212-928d-44e5-9adb-d9b08bc9b6ed · outbound

This paper cites Optimalancilla-freeclifford+tapproximationofz-rotations.QuantumInf.Comput.,16(11&12):901– 953, 2016.

DeComp2: Description Complexity aware Decomposition Optimalancilla-freeclifford+tapproximationofz-rotations.QuantumInf.Comput.,16(11&12):901– 953, 2016

Reference 29

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:24.080158Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:24.080158Z digest=sha256:7cfce1d9f69631af6742204dc651a2ebaf880ddf05420d3efd2daf3aa5b6b7a1

Observation 31d9f7b8-ac31-4478-8459-1d0837194c11 · outbound

This paper cites Eqisa: energy-efficient quantum instruction set architecture using sparse dictionary learning.arXiv preprint arXiv:2603.20646, 2026.

DeComp2: Description Complexity aware Decomposition Eqisa: energy-efficient quantum instruction set architecture using sparse dictionary learning.arXiv preprint arXiv:2603.20646, 2026

Reference 30

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:24.158182Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:24.158182Z digest=sha256:cfa39bafafb584a3304cd7e2212d07b71692969adcc3e81b03a29c9efa891640

Observation f452d1b2-e568-4f2b-a65f-01012bf74f7d · outbound

This paper cites Mqt bench: Benchmarking software and design automation tools for quantum computing.Quantum, 7:1062, 2023.

DeComp2: Description Complexity aware Decomposition Mqt bench: Benchmarking software and design automation tools for quantum computing.Quantum, 7:1062, 2023

Reference 31

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:24.211633Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:24.211633Z digest=sha256:b18092afa3d308faa328163bc98e72f024eb30d8719e6a6f6f9b8879a24ac2a8

Observation 2ab384c5-66b0-4d0a-9a30-a3d567705430 · outbound

This paper cites Universal sequential search problems.Problems of information transmission, 9(3):265–266, 1973.

DeComp2: Description Complexity aware Decomposition Universal sequential search problems.Problems of information transmission, 9(3):265–266, 1973

Reference 32

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:24.315712Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:24.315712Z digest=sha256:d5f4088e220ca2bd8edc6e0dad1d4cf77b778408d71a51a217a7ba0eddd4a4dc

Observation 7e63a4d9-2e6e-4b5b-bb58-09c553774d59 · outbound

This paper cites The speed prior: a new simplicity measure yielding near-optimal computable predictions.

DeComp2: Description Complexity aware Decomposition The speed prior: a new simplicity measure yielding near-optimal computable predictions

Reference 33

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:24.474450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:24.474450Z digest=sha256:abd41f64a49302646433d3a9a3f0b162f6efdf682060f6e057b905b732452f2b

Observation 9045e36e-4e64-4db4-9778-3e7c7b4fe0ad · outbound

This paper cites A formal theory of inductive inference.

DeComp2: Description Complexity aware Decomposition A formal theory of inductive inference

Reference 34

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:24.622035Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:24.622035Z digest=sha256:f12aa35a9ada5dcacc1decb0f9fe194c9be499f32bf2218393559a06f67f77d4

Observation 0fae8b36-7ef2-4b73-a69c-a8f5970c4e5a · outbound

This paper cites Laws of information conservation (nongrowth) and aspects of the foundation of probability theory.

DeComp2: Description Complexity aware Decomposition Laws of information conservation (nongrowth) and aspects of the foundation of probability theory

Reference 35

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:24.716667Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:24.716667Z digest=sha256:5209ab2c4f886ac4bef9ddf8a2e2a30060b9a191136d80aa8d395224a789dc8e

Observation f96bba63-6741-463d-a3fc-788d188a6c88 · outbound

This paper cites Visualizing quantum circuit probability: estimating quantum state complexity for quantum program synthesis.Entropy, 25(5):763, 2023.

DeComp2: Description Complexity aware Decomposition Visualizing quantum circuit probability: estimating quantum state complexity for quantum program synthesis.Entropy, 25(5):763, 2023

Reference 36

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:24.880819Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:24.880819Z digest=sha256:195ded00b2c5418addaf1d67a6668a317e20c7a769cc8559c1eab1ca43251fa7

Observation ca0d0ffa-6cb4-49fb-ab17-ce311dd7295c · outbound

This paper cites Algorithmic thermodynamics.Mathematical Structures in Computer Science, 22(5):771–787, 2012.

DeComp2: Description Complexity aware Decomposition Algorithmic thermodynamics.Mathematical Structures in Computer Science, 22(5):771–787, 2012

Reference 37

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:24.995906Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:24.995906Z digest=sha256:483f9a7a7b098173b4ecfd97f78b390c7cbff8931aeb3eaa44465dbf24eb77aa

Observation ce381370-457f-4022-a22d-1ef31c467c76 · outbound

This paper cites Foundations of algorithmic thermodynamics.Physical Review E, 111(1):014118, 2025.

DeComp2: Description Complexity aware Decomposition Foundations of algorithmic thermodynamics.Physical Review E, 111(1):014118, 2025

Reference 38

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:25.227732Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:25.227732Z digest=sha256:aca20d62d435908d0239034145edb93b926adeacb415f0912b39944bc868611e

Observation c259f29d-0d15-451b-963e-17967781a8ce · outbound

This paper cites What is the lagrangian counting?International Journal of Theoretical Physics, 42(2):363–381, 2003.

DeComp2: Description Complexity aware Decomposition What is the lagrangian counting?International Journal of Theoretical Physics, 42(2):363–381, 2003

Reference 39

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:25.372502Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:25.372502Z digest=sha256:594d827a7b34a7c65885d489c9eea5202b2a68ee8fddf0249c8dd7380a74a690

Observation 9c2fdf44-077d-4436-a3df-972d32ce3ddd · outbound

This paper cites Action, quantum computation and the structure of the yang–mills lagrangian.Quantum Studies: Mathematics and Foundations, 1(3):173–185, 2014.

DeComp2: Description Complexity aware Decomposition Action, quantum computation and the structure of the yang–mills lagrangian.Quantum Studies: Mathematics and Foundations, 1(3):173–185, 2014

Reference 40

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:25.510793Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:25.510793Z digest=sha256:70cf8f8a0f8be7d3a1b2dbab9f124e2d8ba3409134dcef7508f09132db5b7e1a

Observation d316d503-5b75-46bf-a407-0a11789187e0 · outbound

This paper cites na, 1988.

DeComp2: Description Complexity aware Decomposition na, 1988

Reference 41

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:25.681272Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:25.681272Z digest=sha256:3573196e4fd6d23b1f216e8ebc446a2f9ca4d3c5dad7bed60e89988ecad3bef5

Observation 70f6072f-ec3f-4c96-9481-b7bd506481b6 · outbound

This paper cites Information measures, effective complexity, and total information.Complexity, 2(1):44–52, 1996.

DeComp2: Description Complexity aware Decomposition Information measures, effective complexity, and total information.Complexity, 2(1):44–52, 1996

Reference 42

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:25.842338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:25.842338Z digest=sha256:9a82777cd1700c1a253283187974dcf3633a40fcfcbe4c1b9f038abce643b5b6

Observation 7b344a54-66ac-47c1-8e6a-8181edfa101f · outbound

This paper cites Effective complexity and its relation to logical depth.IEEE transactions on information theory, 56(9):4593–4607, 2010.

DeComp2: Description Complexity aware Decomposition Effective complexity and its relation to logical depth.IEEE transactions on information theory, 56(9):4593–4607, 2010

Reference 43

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:26.003448Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:26.003448Z digest=sha256:4b0423a514acb30fce1c14b65616e786a9aafc098aaedc6b605ffa66a468f240

Observation 0634f276-4ee6-47b5-b7d4-8771a332fd6a · outbound

This paper cites Complexity as thermodynamic depth.Annals of physics, 188(1):186–213, 1988.

DeComp2: Description Complexity aware Decomposition Complexity as thermodynamic depth.Annals of physics, 188(1):186–213, 1988

Reference 44

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:26.137795Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:26.137795Z digest=sha256:4131f1927044510d94dc09c9114d1a5292509e281bae2fa633e7d606a22911af

Observation 91e528bb-cbf9-42e5-8a3f-7fd8f5ed2e86 · outbound

This paper cites Inferring statistical complexity.Physical review letters, 63(2):105, 1989.

DeComp2: Description Complexity aware Decomposition Inferring statistical complexity.Physical review letters, 63(2):105, 1989

Reference 45

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:26.266545Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:26.266545Z digest=sha256:bc1aa35246bb765138e913844ce813569c551e34d0599c61b014a8450d8edd95

Observation e8b22ede-1363-43b2-8727-9b54bca2fbba · outbound

This paper cites A Theory of Universal Artificial Intelligence based on Algorithmic Complexity.

DeComp2: Description Complexity aware Decomposition A Theory of Universal Artificial Intelligence based on Algorithmic Complexity

Reference 46

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:26.386671Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:26.386671Z digest=sha256:37a5c8522bb39d0bc9bdf7f09aff93681b5c56347bb7a3036d6af24a87f8b2c1

Observation 609ecf9e-7726-4196-8afd-f66fb3ad2787 · outbound

This paper cites Qksa: Quantum knowledge seeking agent.

DeComp2: Description Complexity aware Decomposition Qksa: Quantum knowledge seeking agent

Reference 47

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:26.522888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:26.522888Z digest=sha256:48e71a0f210aad531bca0086fd0f10a11973318d0542f7211c93de865179b462

Observation e5dd2873-29bd-4c1d-9cff-f484511cc715 · outbound

This paper cites Quantum aixi: Universal intelligence via quantum information.

DeComp2: Description Complexity aware Decomposition Quantum aixi: Universal intelligence via quantum information

Reference 48

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:26.705288Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:26.705288Z digest=sha256:81b62bc4d0195ea79f84c9e990709353a9e67817dbd2339e6d381f807c5ce4f8

Observation 4ba5e005-31dd-43ef-8298-cb229095f7c3 · outbound

This paper cites The Tao of Agency: Autotelic AI, Embedded Agency and Dissolution of the Self.

DeComp2: Description Complexity aware Decomposition The Tao of Agency: Autotelic AI, Embedded Agency and Dissolution of the Self

Reference 49

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:26.864552Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:26.864552Z digest=sha256:14bbf4cf0dd02bcb6aa46d20ea7c7be177e82920281faaca082f2ee2f4bef385

Observation 6c45b437-5a0c-4256-8ed2-e0394a0c70c3 · outbound

This paper cites Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agents.

DeComp2: Description Complexity aware Decomposition Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agents

Reference 50

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:27.012566Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:27.012566Z digest=sha256:b641fa75a2d4a1ba790c9cb10c5cb433fb1d48969d44e23410a4dabd782479f7

Observation 558b4e5b-db31-4f20-935b-fa4541e51b02 · outbound

This paper cites Hyperagents.arXiv preprint arXiv:2603.19461, 2026.

DeComp2: Description Complexity aware Decomposition Hyperagents.arXiv preprint arXiv:2603.19461, 2026

Reference 51

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:27.143994Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:27.143994Z digest=sha256:1681b3c307ad59b767d9243e7ba476b61c6ec2e8b6cfe37397abf58e70b7bc87

Observation 8503aa3b-cdf9-45f7-9583-1f9bff2bb17c · outbound

This paper cites Gödel machines: Fully self-referential optimal universal self-improvers.

DeComp2: Description Complexity aware Decomposition Gödel machines: Fully self-referential optimal universal self-improvers

Reference 52

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:27.319135Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:27.319135Z digest=sha256:f4e5202d0ae5f509e9be3a6efc4cafcbc91c98ac62cc4b70d4c3825620336af6

Observation 55256664-4656-4928-babd-e13dda03531c · outbound

This paper cites bzip2 and libbzip2.avaliable at http://www.

DeComp2: Description Complexity aware Decomposition bzip2 and libbzip2.avaliable at http://www

Reference 53

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:27.443060Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:27.443060Z digest=sha256:63f313159ac03ec409cd9c6014eba9427b921742b62a063436169ee20b5be361

Observation 2610c590-335a-4afc-99ed-cb36d44b69b2 · outbound

This paper cites Pybdm: Python interface to the block decomposition method (0.1.

DeComp2: Description Complexity aware Decomposition Pybdm: Python interface to the block decomposition method (0.1

Reference 54

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:27.504129Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:27.504129Z digest=sha256:168095515cd6516330a9b680f74ef0a9a59c8ac7b9ab7e09637491cbd6c27b48

Observation fefdf6ce-319b-4116-8c1d-39a18f4d3f08 · outbound

This paper cites Calculating kolmogorov complexity from the output frequency distributions of small turing machines.PloS one, 9(5):e96223, 2014.

DeComp2: Description Complexity aware Decomposition Calculating kolmogorov complexity from the output frequency distributions of small turing machines.PloS one, 9(5):e96223, 2014

Reference 55

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:27.621805Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:27.621805Z digest=sha256:750a192fc7245bf3e812b41bb93e152274e7ad871d05910cfb484e7afaefcfad

Observation 6c676919-2e01-48f7-8cf0-fb74d5eb7203 · outbound

This paper cites Yaqq: yet another quantum quantizer design space exploration of quantum gate sets using novelty search.New Journal of Physics, 28(4):044504, 2026.

DeComp2: Description Complexity aware Decomposition Yaqq: yet another quantum quantizer design space exploration of quantum gate sets using novelty search.New Journal of Physics, 28(4):044504, 2026

Reference 56

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:27.708382Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:27.708382Z digest=sha256:ceb36759d2847d12ae27855a540af32c844bfe5a926d94fbe71adf8cabe3ddf6

Observation e9feba71-1184-42ee-8794-c545bab68d6b · outbound

This paper cites Super-golden-gates for pu (2).Advances in Mathematics, 327:869–901, 2018.

DeComp2: Description Complexity aware Decomposition Super-golden-gates for pu (2).Advances in Mathematics, 327:869–901, 2018

Reference 57

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:27.785079Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:27.785079Z digest=sha256:9abfe93d758fb6a8dcfcf9b8174a112c26ac980bc71930c487b6a73856881195

Observation bb0f2ade-f7c5-441a-8465-e072e2ba4bad · outbound

This paper cites Discovering quantum circuit components with program synthesis.Machine Learning: Science and Technology, 5(2):025029, 2024.

DeComp2: Description Complexity aware Decomposition Discovering quantum circuit components with program synthesis.Machine Learning: Science and Technology, 5(2):025029, 2024

Reference 58

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:27.941075Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:27.941075Z digest=sha256:f0f76bb0253a86878acfb09463896f72e8855b5b37f085dbd58e87e7797770f3

Observation 9c169599-1e0a-4cc0-a869-2ca5d7482d2a · outbound

This paper cites MLIR: A Compiler Infrastructure for the End of Moore's Law.

DeComp2: Description Complexity aware Decomposition MLIR: A Compiler Infrastructure for the End of Moore's Law

Reference 59

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:28.039849Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:28.039849Z digest=sha256:8a27b65bc78a19e905f0610f77059bc215ca9b3fbfa956f8cdf912464f96010b

Observation 3e3c6a21-7db4-4154-aa13-8f5590eca704 · outbound

This paper cites Qssa: an ssa-based ir for quantum computing.

DeComp2: Description Complexity aware Decomposition Qssa: an ssa-based ir for quantum computing

Reference 60

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:28.108902Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:28.108902Z digest=sha256:099327dd570b2521e7f3ac60ec5e515b6ebd9c2e4de8e6278f41d5a3907019a0

Observation a2e61614-a2f0-4694-b2ce-a4e071a1b6d7 · outbound

This paper cites The structure and performance of efficient interpreters.Journal of Instruction-Level Parallelism, 5:1–25, 2003.

DeComp2: Description Complexity aware Decomposition The structure and performance of efficient interpreters.Journal of Instruction-Level Parallelism, 5:1–25, 2003

Reference 61

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:28.178228Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:28.178228Z digest=sha256:b19204a0669c9f27c562c30642d95f5a034779ba8c3e209bdc53d923d417dc28

Observation 178b3932-92a8-42f0-9caa-418ec1ba36cf · outbound

This paper cites DeQompile: quantum circuit decompilation using genetic programming for explainable quantum architecture search.

DeComp2: Description Complexity aware Decomposition DeQompile: quantum circuit decompilation using genetic programming for explainable quantum architecture search

Reference 62

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:28.256418Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:28.256418Z digest=sha256:ea319113198d2103ea639cf19c8fc4b2117443c5328198b61846809465a1c0e6

Observation e3248db4-e203-4802-8e5a-5b2df326d5bd · outbound

This paper cites Compression and explanation using hierarchical grammars.The Computer Journal, 40(2_and_3):103–116, 1997.

DeComp2: Description Complexity aware Decomposition Compression and explanation using hierarchical grammars.The Computer Journal, 40(2_and_3):103–116, 1997

Reference 63

Resolution
unresolved
no resolver link, observed 2026-07-31T23:24:28.328856Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T23:24:28.328856Z digest=sha256:c5a047ee0cc17a14ac791c2130dd966f863aa93510976e196405dba001f53e9a

Pith citing papers

No inbound Pith citation observations are available.