Paper Citation Record · LEDGER

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming

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

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

pith.paper-citation-record.v1
2607.29386 v1

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T08:18:54.434329Z

measured 18 of 18 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+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

18 of 18 outbound references displayed

verified exact0
verified fuzzy0
unresolved18
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 341edd38-6759-495e-8c0e-cf97b7b383a2 · outbound

This paper cites The complexity of approximating a nonlinear program.Mathe- matical Programming, 69:429–441, 1995.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming The complexity of approximating a nonlinear program.Mathe- matical Programming, 69:429–441, 1995

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:52.878176Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb867a90-1b74-4d7e-b61a-7f9346909130 · outbound

This paper cites Biblioth` eque Nationale, Paris, 1829.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Biblioth` eque Nationale, Paris, 1829

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:52.933450Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a470c4e4-44cb-4889-b798-ab56d3e4c3dc · outbound

This paper cites Dax and S.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Dax and S

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.021529Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9378ade9-2c98-4c21-9ee7-367bb1d2026f · outbound

This paper cites an unresolved cited work.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Unresolved cited work

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.159221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e76977a1-d02f-4f6b-979d-3a298d04c1f5 · outbound

This paper cites On approximation algorithms for concave mixed-integer quadratic programming.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming On approximation algorithms for concave mixed-integer quadratic programming

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.251093Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e5baf5f8-c57d-4d91-99ef-132d50da31f3 · outbound

This paper cites On approximation algorithms for concave mixed-integer quadratic programming.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming On approximation algorithms for concave mixed-integer quadratic programming

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.353720Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3545986c-223a-4686-900c-e44608fff139 · outbound

This paper cites An approximation algorithm for indefinite mixed integer quadratic programming.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming An approximation algorithm for indefinite mixed integer quadratic programming

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.456225Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f96d9f9b-999a-474a-8400-cd0802f77776 · outbound

This paper cites Convex quadratic sets and the complexity of mixed integer convex quadratic programming.SIAM Journal on Optimization, 35(3):1822–1845, 2025.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Convex quadratic sets and the complexity of mixed integer convex quadratic programming.SIAM Journal on Optimization, 35(3):1822–1845, 2025

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.552039Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b264941c-6f4a-4966-a89a-ac6dbb734bd3 · outbound

This paper cites The mixed integer trust region problem.Mathematical Programming, Series A, 213:699–736, 2025.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming The mixed integer trust region problem.Mathematical Programming, Series A, 213:699–736, 2025

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.612258Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 831905d5-a987-4073-bdeb-ff4cca55174e · outbound

This paper cites Dey, and Marco Molinaro.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Dey, and Marco Molinaro

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.679694Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8cf14955-bf1c-4a45-b546-60ae4debfaac · outbound

This paper cites Golub and C.F.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Golub and C.F

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.776289Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08ccf725-4a22-44a3-b316-e4e53a045f34 · outbound

This paper cites an unresolved cited work.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:53.867511Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe19b32f-537c-4082-a206-7bba230d524d · outbound

This paper cites Mignotte.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Mignotte

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:54.006663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d44a1c94-7c9c-483d-bcf1-a2895d021335 · outbound

This paper cites Nemirovski and David Berkovich Yudin.Problem Complexity and Method Efficiency in Optimization.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Nemirovski and David Berkovich Yudin.Problem Complexity and Method Efficiency in Optimization

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:54.069532Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f806c329-62aa-4cea-bb3f-713acb8a3d63 · outbound

This paper cites Pardalos and Stephen A.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Pardalos and Stephen A

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:54.173141Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4d59a538-8671-447f-b2e8-80d0b3a5d2da · outbound

This paper cites Wiley, Chichester, 1986.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Wiley, Chichester, 1986

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:54.237950Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12f1a569-de99-402d-afb4-59bdba544f99 · outbound

This paper cites an unresolved cited work.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Unresolved cited work

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:54.343311Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a5e98191-55dd-4362-a4f8-73d0e6af7c59 · outbound

This paper cites an unresolved cited work.

Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-03T08:18:54.434329Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.