{"as_of":"2026-08-23T04:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6bd4567565567c157a41539100875b758c573488eb5f4e4fd2cdbc251aa79ef6","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T08:18:54.434329Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.29386/citation-record","integrity":"/paper/2607.29386/integrity","json":"/paper/2607.29386/citation-record.json","paper":"/paper/2607.29386"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:52.878176Z","title":"The complexity of approximating a nonlinear program.Mathe- matical Programming, 69:429–441, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:52.878176Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:40c0215ebaeaf084c0cbba4c0348d81db22dd0c071e6bde4c9f94898c71a1aac","observation_id":"341edd38-6759-495e-8c0e-cf97b7b383a2","resolution":{"observed_at":"2026-08-03T08:18:52.878176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:52.933450Z","title":"Biblioth` eque Nationale, Paris, 1829","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:52.933450Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:5b251108237b5e7412d7eedba44780c7ce622e34ba311ea22e55dd7060121d13","observation_id":"fb867a90-1b74-4d7e-b61a-7f9346909130","resolution":{"observed_at":"2026-08-03T08:18:52.933450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.021529Z","title":"Dax and S","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.021529Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:ad8cfb3a7db80f3b49a1cb0679d746b6a4183ea3f6c336339f67648d94062cf4","observation_id":"a470c4e4-44cb-4889-b798-ab56d3e4c3dc","resolution":{"observed_at":"2026-08-03T08:18:53.021529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.159221Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.159221Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:ab9f6ba4d316548a36960e43caf0905b957d69261b4dd0e99e9cc0c4907eb56b","observation_id":"9378ade9-2c98-4c21-9ee7-367bb1d2026f","resolution":{"observed_at":"2026-08-03T08:18:53.159221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.251093Z","title":"On approximation algorithms for concave mixed-integer quadratic programming","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.251093Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:a0712289568b74b9bc971cb7dd21349e3bc6d848deb77995bb043f428c56c0eb","observation_id":"e76977a1-d02f-4f6b-979d-3a298d04c1f5","resolution":{"observed_at":"2026-08-03T08:18:53.251093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.353720Z","title":"On approximation algorithms for concave mixed-integer quadratic programming","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.353720Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:c26636ce62ff244a6515aa2a967dddf9e5f42bcf836697d1f3a5e251a831f01c","observation_id":"e5baf5f8-c57d-4d91-99ef-132d50da31f3","resolution":{"observed_at":"2026-08-03T08:18:53.353720Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.456225Z","title":"An approximation algorithm for indefinite mixed integer quadratic programming","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.456225Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:0e7c104230bc6cf819acb83c7dce1a40ad03a4df9c23c4468ec21fef5ee9121c","observation_id":"3545986c-223a-4686-900c-e44608fff139","resolution":{"observed_at":"2026-08-03T08:18:53.456225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.552039Z","title":"Convex quadratic sets and the complexity of mixed integer convex quadratic programming.SIAM Journal on Optimization, 35(3):1822–1845, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.552039Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:5e9b3da5cf9fadb4f2c7b8a958f33d4dc8a5471d07bfdb8863ef85f2dde10c57","observation_id":"f96d9f9b-999a-474a-8400-cd0802f77776","resolution":{"observed_at":"2026-08-03T08:18:53.552039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.612258Z","title":"The mixed integer trust region problem.Mathematical Programming, Series A, 213:699–736, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.612258Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:2da60b63657e863f7122e6dfb197f3e757363d3e88712b3e0eab75762d2f81bd","observation_id":"b264941c-6f4a-4966-a89a-ac6dbb734bd3","resolution":{"observed_at":"2026-08-03T08:18:53.612258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.679694Z","title":"Dey, and Marco Molinaro","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.679694Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:4033e9e1a3b529ea0b2223b3338b256cea96c20ad91935868c9a83f2d9322876","observation_id":"831905d5-a987-4073-bdeb-ff4cca55174e","resolution":{"observed_at":"2026-08-03T08:18:53.679694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.776289Z","title":"Golub and C.F","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.776289Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:fbcfae4f55faf34a5a702d1d39960112e7190acf326a3209eecd06faab9fb537","observation_id":"8cf14955-bf1c-4a45-b546-60ae4debfaac","resolution":{"observed_at":"2026-08-03T08:18:53.776289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:53.867511Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:53.867511Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:28f2c175ee2cd2ae5f7e9c8df959c1243bf19c8ea9615c2461961dd2243b4354","observation_id":"08ccf725-4a22-44a3-b316-e4e53a045f34","resolution":{"observed_at":"2026-08-03T08:18:53.867511Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:54.006663Z","title":"Mignotte","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:54.006663Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:771696b051f8c5357c27353990839a54b3f0f24fc16f86853f665850534c8a4d","observation_id":"fe19b32f-537c-4082-a206-7bba230d524d","resolution":{"observed_at":"2026-08-03T08:18:54.006663Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:54.069532Z","title":"Nemirovski and David Berkovich Yudin.Problem Complexity and Method Efficiency in Optimization","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:54.069532Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:87e24dd1adce14562060a585cf9e2cea4224974a9425a31c8b4e7442ef8056bb","observation_id":"d44a1c94-7c9c-483d-bcf1-a2895d021335","resolution":{"observed_at":"2026-08-03T08:18:54.069532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:54.173141Z","title":"Pardalos and Stephen A","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:54.173141Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:aeb0e6145c9a733ca1bcf76fefa8390ff4770efbdf4cab81eb9fcf97c8fb3685","observation_id":"f806c329-62aa-4cea-bb3f-713acb8a3d63","resolution":{"observed_at":"2026-08-03T08:18:54.173141Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:54.237950Z","title":"Wiley, Chichester, 1986","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:54.237950Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:a6390aa828bbe9619ecfeb44912a73357d4b70364bf2b942435a668ed1bc9999","observation_id":"4d59a538-8671-447f-b2e8-80d0b3a5d2da","resolution":{"observed_at":"2026-08-03T08:18:54.237950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:54.343311Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:54.343311Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:4a0db8543bb25cd753d7bc819f317985a74e501ec62b9967c7f0479c172f8370","observation_id":"12f1a569-de99-402d-afb4-59bdba544f99","resolution":{"observed_at":"2026-08-03T08:18:54.343311Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T08:18:54.434329Z","title":null,"venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T08:18:54.434329Z"},"links":{"citing_paper":"/paper/2607.29386"},"observation_digest":"sha256:96a8db29fe26462e6fb97b48bac92ede642d0b1ef465c9f3db833fa9c39f64fe","observation_id":"a5e98191-55dd-4362-a4f8-73d0e6af7c59","resolution":{"observed_at":"2026-08-03T08:18:54.434329Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.29386","last_updated":"2026-07-31T13:06:43Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T05:12:16.281796Z","submitted_at":"2026-07-31T13:06:43Z","title":"Rational Jacobi Rotations and the Complexity of Approximating Mixed Integer Quadratic Programming"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":18},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:2607.29386."}