Pith. sign in

Paper Citation Record · LEDGER

DeComp2: Description Complexity aware Decomposition

As of 11 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-10T06:31:04.303077+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:f782b36e8a5610a2ca10287b7f96f21f62679f754e98f1882379d66885bfcd75

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:ae5b9c19377da8972512c2d10f259918b7b326f26385f0b3d4497422a7a1ef6f

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:c5ac1bb883fbec3517d886dabdaf31168a7490813d35e23f3cd2ece73094f369

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:bb39a141b29e1b9b41ede65752f7c7dcf823da4b12a2243048279dbb1fa4d760

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:a005f784abba4b769a48c3a7ba19d68fdd44c03c0c2918e232a87c4e54b317b3

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:21e8707528ef98038346b567a7fb9fbc57e10f15fbc1b63421b402159ac80980

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:9835b7528825ad6a059dc30167b25bdab9b0029b5b5ebb9c8a89646fad6b9c7e

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:38aee332104354f3843b3bfd7f46e5cda2e6997c20678822821be8028004ea04

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:a968ca42a8bb35e7712857a7f27f992f005c812bab7b55e20a1566dc71d0b11e

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:3897453e88bf53cb22a4a4ceb7fc78fddd73d30b3ca3486d308eb8c4834219ef

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:07626afc2f9f612a8de389ff6bb00717dec5f80d55e8362ca6ef95feb48c5756

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:d63629aa4bf3c25941118113a2d38f32e21f98af4d2438c5fa13c1f0122521e2

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:7dfb7cc2f75949219fa73dc1bc0efdf411eae13abcbb4d0ee6bd7d40bc38eea4

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:dc23682b741cbdcfb987e4f6f8f29cda6b6711ce711454ed54c4364c5d6f9de1

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:967ffc2968dccdffd05640c3d160e988e730d45104c7853e0038ea0b9b30d956

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:2f1c4cc67d7d4a6758fd138dd7364dda3114f743a290d881acb74c83f7de553a

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:683fc4a5cf0378f1cd2d738bb6e22257b18aae7dabd4a24e2365017bef2fa462

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:285a04f490195b00f67f24c321de6c953946ec11ed1aa06818c4064727ca393a

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:e6c911c4d14112315bb4dcba99a1d87cb73cde94ac26214349ca59322047d0da

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:3d9daf73fed7bc71e75b00b8b119b78379eeddca8a037d9e9e53028f9445bc86

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:0a114f758a42748ba0f3657e7ca623daf9d8d43163511f9c85b28758f4d17007

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:6b815e94e40cdddcf46ddc3f2a87f583b0eec23e63e4be22bc37cd2e4ff9e56e

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:6a4b725ff6c77d083a5c2c1d43ba65dab3ff840ffb297ed2f97f633bc4ff7fa1

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:4147c78e76d263a622dc52c7823b29f5b4c1f49be81f5789a722ad704c2d5df0

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:934fe24e1d1cff3adea2d1bfe74dca973f733afb3af9a9f929be412f063eb24a

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:d89676afda1173374d411a4fac487590ae86b14bc9cc534bdfd2d4718e9e2a87

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:43995d696bdf385d142375bbc5e6df0db503b2f86093a82514c7aad9f536921b

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:1e1c84db285af1e59650b25d3d2686f92e6e937a7d72133aac1a5bccd455c5a5

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:eb3163dd7d5b6e834ff91fa45aa1ccaf545399f76a8fd0545117139f72e5d1bf

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:2bebc761f2f81afe2390c455db3cb51fce3d6b4d657f2ab118a757df0a84b2c4

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:b67f660a8af4911d4d1a4fd3fe3a9cd42a8c2dcb37787b0b38fbeadfe32f90f6

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:47fc4695c209cd2a08ca05e0e063b40e450c8e9d3f093cffa241a15da388052d

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:1b3259930109b1d9dcc8398e3fe87cd823364115fed646fd8433ce96c777499c

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:503352f49e149dd99d4d84e594119e88f304e5792e56b80a3ace71b327924908

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:e041342f762dbf6c65277dd3650a2837a2fa35defb0953f9c390c25c701594fc

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:99ae4010267ad94b3f4c9181aa12378cf11337d406a4db2b359116a629e86c15

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:42903ac667ad4f41a9033816c21b109ded40c286f862b74bbcba8bd6a80b7204

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:90f8e8f838c8566231c715b1fa269fc54ccf8c1ec3b56348cb82a5f8e6359159

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:5453509b107e5f3d293a0bc92dbfee2efe192e8b6aafb04b354e287825b6ad98

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:5a4f8ccff0fde8ae00a1da35f04380f57c6eb6f891807e32bc3d26a56f65b255

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:f5d417e8999e7c59f3ff5549f0469258f1433daa9a37d40ba08a880f8f3941ad

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:1517b45f5c07014937e282b79018befc6d1ab09fc6c7ed44ecdec1b4cc8c135b

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:832bb49376f0e6cbdb306208c939a3c98645ebb627dab4befb3657f54b530b6c

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:417a4081764074e101cff9aad1a4ddeab5effc281af6fd9cb15f0835a34f25ef

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:4bc934ead2638ef2ddd9315a732a0b425bf54d07e653f621cfe95ec4022a63be

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:11af2ec17d5e6c12a46cb3555238c1067edbd476c45a46bbfeb6c8c127aa5e16

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:e9f37fe978de6028fbef3531c1a1a349e46ae899825bc29678b21f07e5c75ce5

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:31f7e5573b30902b654341a7c96e3f50e5289a8273a9a11fb4d3355db8735231

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:6af6ea5ac5ec3f8b4c556f1071e6488846549e75a96bd31208cea1ff5c23babb

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:6cb3275a7f0dd854e93bdd192050304e078963aed876c33925b7f21569a4a7fe

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:83d43cb21ce118f9a0512854e7d2867e52afff5063d96aff45a069557a92e484

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:ff69d6ec94ae9af1cafd408495f954b5357d07ac2208560a8882a79325f20e58

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:72756a0383d9b929a7d5148ed2da65d67ddde47a8e7b99440133054f8bf01a5b

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:7017a31c1ffcd663ea2dd37e03dff579ccfaece862900359ad148f7f7d579b9f

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:d8cb6966358d24d541515331da6124ac5c6ab163ce80aa2fc4947da94512ec91

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:2c652efdd1f98b544d93ede257e2aef2ba322156d9f0b7352d8d3ad5bc5a3e9f

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:c3cc7108997bdd179afa0bb1a1d282ab19ce5b653ee1255feee9b998e190019a

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:f26ac32276151ef46f34752156133a225414d8657c82449a3fbed38e10839f42

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:b846b3d73e5b32c7c329b384901c452cf109a058459f958219d120cff69ca922

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:346e9386e4e7f753b00ed66cbdd42e516bddf027acdf64a3d49e991f38f252ae

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:e83055ff8b1a19c6ac939f5e7d06b8d462374b2c228527b36bcefe8a6b3975ae

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:ae7c779c2d0ec70a66d35e0f3a31efbab816e5ed8cf1cab7cb60b4d594facfd9

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:8ef83bc46df53f4da228da8f0c9c22d5379d3823b477deeeb48a05696e2b63d5

Pith citing papers

No inbound Pith citation observations are available.