Pith. sign in

Paper Citation Record · LEDGER

DeComp2: Description Complexity aware Decomposition

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.

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-09T06:31:02.800959+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:bad26cec6f69f02968c53d1bc3ccd9ac026f6a208bed23984dc6007c3974bc7e

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

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

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:9e1a97acf68562f4f1924f850969e819fc9b8ad780c05bf646e9993279be1780

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

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:30b55928b5a9bb0d96de6c2a55b11e8cd8b10537a2c2dc38d49b32694ab80fc3

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:238ca022a6d2996e8cad72ae368807b1b05b218bf9bb9e8c3810bad93936cdf4

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

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:44ebb78d227d0ef0aa924cb94fb09d36c4ec6b42fd1149a61baebbf224397386

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

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

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:2503f65fa2b0e99973316b8dbe912a2d305ac70bdc66249dcde960468a5cdbad

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:875f738b3fd16424a26fd6afb4d9da6537639b3f247871423cb01570cdfa735c

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:94ead69e6effac177bb8fd5e456623091d378d85a40b5d9b0538196e95b36629

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:890a55ba3c654240bcc519908b3e73486a66562904dccb90c628ccf452f54824

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

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:20e887dab21105217a6c907fd98a884ca641b6caa22b8fae6022937c2fdaf5f0

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

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

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:65ab158a1259e4c9a7a110cd7214d40f23e8e6a57ca9c6310e3c1f6c3e7ea0f2

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:21977a7d32ca7fe21b3f7787cd6def41e8d85b5f33f3aedf9d59bf29885bc85e

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

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

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

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:633c35e745f766e45c7a761243e0a1a46f6bd8a6ead32e2c3ec0f2b9459aa5e2

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:49a03aed18c5d3ee25ff04fd0c843036df69e095128ed366387d262cab4a8843

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

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

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:331a52999af57ccd8f52c1f387ad0348538078c7b3780774850ad6b077b99378

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:65f88499f02957057ab0a9b91a5a76c787bd7b5d28a91ed96c1fc65aebc74a25

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

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:17833e335d5a970e9df2e507c195bc4233302322488b18785c921c42bfcde56a

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

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:434732efe55d490d1ffd244ef9a6499ff0454c6cd5234809d4e6155c5ef982df

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

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:8590f2bf54012ce7fc49a6697fd08665e1da2293f2ab807e9021dbd4ae3dd4b5

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:361b1cf6078e3b713e3f4c25749fa827c9ffbd505ca661660b1af6ac1c52463a

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:71ce04dfb88b570341f2d8096eb905d7d3d8a14e7eaabf378cc37e31c1077e01

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:53a13e617caa9cd4c8158814227cbb526e5fc65486c1e1dedb998f3d49854c9d

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

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

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

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

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

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:883ee072f9ba780f159a920c09a8529bdef371e9c34cbe92a6738037a632e3a3

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:96a26b239fd4f7a760e72c968107f1294947712fd5460cfba4ffbb27c36a988e

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

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:0039cebd6f8a248fe02128cc5b157e96cf09e8403221cc1bed44d084eb72bbda

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:583af4ae18b406235aa58851ac276785301692e912d1b5a0bba4f88bba165401

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:62e7a21a6bd45cf99d5302ead98b3b4452db0fdb559c208a755c94a305002863

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:33d51b306e347aebb63600c1aa7d6accf84af09340c6bffdff831b06c9bc80a9

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

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

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

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:9f48e311c54b8b210abc54593a53dfba42c79d27e4cd56cbc5765a307f393bd0

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:04754e4c9d2fd7ccfa29bce7c6f3f24f8c1d77e36a750aa9d1ec2314941d069a

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

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

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

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

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:73859b29ee323d1c632153d967458bcd6ca564f6651c649638a3885fe4dc066e

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

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

Pith citing papers

No inbound Pith citation observations are available.