{"as_of":"2026-08-12T05:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4053251b73ef59c8295378f32d84282845a5a8bd7c841885c2286f1c5f196669","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-11T06:34:44.6726+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-08T06:54:28.319323Z","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:8bfbffc926a87bed9261b939fcb0ca84f6a9a0117a32ab40be88fc5675da9694","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-08T06:54:28.319323Z","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:8cd552c5c613eb1252f76fde01c7cd8f862b80ff617e70af7147d11c55b0aba8","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-08T06:54:28.319323Z","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:f1750cf9439567394e819e148353652d5dd934aec7c43231d1c9b0cb98687606","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-08T06:54:28.319323Z","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:b5fb02ed3743b23178f2089f478d10deb10457b68ff5765438430696106f9a19","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-08T06:54:28.319323Z","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:ac903a005b3c2eddce2cf0875fa35ddb6aae406387220874b07d07065986ff66","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-08T06:54:28.319323Z","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:54c3c442cc49d1be1237d545e8f5aff5e5cdabce0a06efebc115176ed0cce522","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-08T06:54:28.319323Z","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:ecb206164c5b9f50b2e117fd21579f90e9328fc20f9be6e4b1effcdbd413b1d4","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-08T06:54:28.319323Z","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:d7590a9d2211f7ba00dd0653a5b6aec43435efe88e03df690bf70e1c6a37df80","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-08T06:54:28.319323Z","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:935043061d69551211a7f31632dc2ea653a74c4194b765ccd3dec02e3e3014bc","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-08T06:54:28.319323Z","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:94856a40f8588415f9d3a5c3fe4b5fc5846982326b7a69f145dde5afc3ca820f","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-08T06:54:28.319323Z","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:d929be4b0c026a98feae8e2bfaa2df6cb365192eae36596beb0f53d02bba73bc","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-08T06:54:28.319323Z","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:9136f1e1bfbe49149e8b9b4df5f84054cad65f9a36eb1b78475cb98c9fe743ee","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-08T06:54:28.319323Z","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:f28bbdd9a354a8c7c12934244d6366b629325250d21fbe474bf949fb8570e7e2","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-08T06:54:28.319323Z","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:605e5ed5c99f9f141b84b7d187bcfd884148e77a7845fbd17b7a150e8573164a","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-08T06:54:28.319323Z","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:1abdd24b6938ae2b2847e933c305f97970b815b4905280f786ca94369a37f3db","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-08T06:54:28.319323Z","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:380464c32166b85a6cf092997b49a81ff3e349084de393b5fa46a7217ef7cd9a","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-08T06:54:28.319323Z","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:5bb6e58705bbcbc1e30ae040d736254b065f03bc7472f861ae0f631074c1f1e0","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-08T06:54:28.319323Z","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:a6830dba744afe84912fb7fb655795d1564a91f7aafca835777ba1a1ea18a6ac","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-08T06:54:28.319323Z","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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"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."}