{"as_of":"2026-08-19T18:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e33a9af1508df26bb7f2a15462b91e84b5714a685ba8b98cb9327e9cfdf2cc7","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T20:11:31.139350Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2506.13533/citation-record","integrity":"/paper/2506.13533/integrity","json":"/paper/2506.13533/citation-record.json","paper":"/paper/2506.13533"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:11:31.129388Z","title":"Sandeep Silwal","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.129388Z"},"links":{"citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:08f437766a78b6bfb3085ea4d37834f9b75c871155729855d634b4f17372d8f5","observation_id":"fab89cad-5933-4ff3-ad5d-9f3ef4ce2a54","resolution":{"observed_at":"2026-08-15T20:11:31.129388Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1612.07925","last_updated":"2017-04-10T13:36:10Z","snapshot_observed_at":"2026-08-14T21:23:56.445210Z","submitted_at":"2016-12-23T10:34:53Z","title":"Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms","version":2},"cited_work":{"arxiv_id":"1612.07925","doi":null,"metadata_source":"pith","pith_arxiv_id":"1612.07925","snapshot_observed_at":"2026-08-15T20:11:31.494270Z","title":"Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms","venue":"cs.DS","work_id":"83c949d5-c8c2-4f0b-b4c1-b00f9a626839","year":2016},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.086379Z"},"links":{"cited_paper":"/paper/1612.07925","citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:e85e01ec70b4e30b37de157d076fcc020e2c37746833f4bb4c597fd390468a3a","observation_id":"ee183250-c048-4545-9d6f-49ed98f37cb4","resolution":{"observed_at":"2026-08-15T20:11:31.497746Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03559","last_updated":"2024-08-06T15:56:31Z","snapshot_observed_at":"2026-08-16T16:10:23.898146Z","submitted_at":"2022-12-07T10:19:39Z","title":"GraphLearner: Graph Node Clustering with Fully Learnable Augmentation","version":3},"cited_work":{"arxiv_id":"2212.03559","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.03559","snapshot_observed_at":"2026-08-15T20:11:31.191874Z","title":"GraphLearner: Graph Node Clustering with Fully Learnable Augmentation","venue":"cs.LG","work_id":"1a7f86ab-942d-4280-a322-e0e83690e648","year":2022},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.136325Z"},"links":{"cited_paper":"/paper/2212.03559","citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:e1ec774d564decf89357118ed794c4b5b3a9cbc0907268214df8c3b5a77be071","observation_id":"fcf9cdf5-f931-4ac3-92fe-dd602a6b32b2","resolution":{"observed_at":"2026-08-15T20:11:31.196696Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:11:31.103723Z","title":"Edward W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":1962,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.103723Z"},"links":{"citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:e5d6ab89fa4fe48d9465985767b699e2fa5ba78a3bb3875783cd6b9a2ad4f7d6","observation_id":"46a420e4-70c8-43e1-ae95-98b7a45e9642","resolution":{"observed_at":"2026-08-15T20:11:31.103723Z","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-15T20:11:31.111873Z","title":"Mary Inaba, Naoki Katoh, and Hiroshi Imai","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.111873Z"},"links":{"citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:cb923cd8fb6ae21600c161b70ab5f0019f8f4120910f55720c81b262201c392f","observation_id":"47bad72b-64e5-4d08-84d4-d73e4d643428","resolution":{"observed_at":"2026-08-15T20:11:31.111873Z","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-15T20:11:31.122649Z","title":"Mario Lucic, Olivier Bachem, and Andreas Krause","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":1982,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.122649Z"},"links":{"citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:a81b2218066aa3fa2063ef323274f0081259ba9be52c095f96670f9ec0b860e7","observation_id":"adbe7f03-98a3-4bf2-83cf-a514b299c307","resolution":{"observed_at":"2026-08-15T20:11:31.122649Z","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-15T20:11:31.109157Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.109157Z"},"links":{"citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:e4d0e34ad4143d82fcd28bddb0e593225ba19d71bc46120e772f635e7973f828","observation_id":"67a6eb70-5549-459e-a078-83f1b7e2053a","resolution":{"observed_at":"2026-08-15T20:11:31.109157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1211.0243","last_updated":"2012-11-01T18:02:58Z","snapshot_observed_at":"2026-08-15T00:40:47.722018Z","submitted_at":"2012-11-01T18:02:58Z","title":"Approximating $k$-Median via Pseudo-Approximation","version":1},"cited_work":{"arxiv_id":"1211.0243","doi":null,"metadata_source":"pith","pith_arxiv_id":"1211.0243","snapshot_observed_at":"2026-08-15T20:11:31.340880Z","title":"Approximating $k$-Median via Pseudo-Approximation","venue":"cs.DS","work_id":"cd89be3d-664f-425c-89d1-1f1c5399bddc","year":2012},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.118895Z"},"links":{"cited_paper":"/paper/1211.0243","citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:1b3537a55b12e321a6f6d747ec5070ba5dbd87981f650f3d5f6d451996b1f019","observation_id":"90cbe4c1-59e9-46e2-ab72-4b91f6a15c5a","resolution":{"observed_at":"2026-08-15T20:11:31.345224Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:11:31.100692Z","title":"Robert W","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.100692Z"},"links":{"citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:09b2843bd84cb4e5549c4a0d1d7c0ce2f3003dd302403d367446e40e7d87251b","observation_id":"aac1b3c1-96d0-4ac6-bbc4-b8bbf4ea447d","resolution":{"observed_at":"2026-08-15T20:11:31.100692Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07148","last_updated":"2016-09-22T20:00:04Z","snapshot_observed_at":"2026-08-14T21:38:34.549599Z","submitted_at":"2016-09-22T20:00:04Z","title":"X-ray and Ultraviolet Properties of AGN in Nearby Dwarf Galaxies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07148","snapshot_observed_at":"2026-08-15T20:11:31.125909Z","title":"James MacQueen","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.125909Z"},"links":{"cited_paper":"/paper/1609.07148","citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:ce3c025eb255a2ec4bee23262be3729d7bc111eca212a2f08845ecce91e29abc","observation_id":"bc283415-1674-48e4-ad03-c2993e558bcc","resolution":{"observed_at":"2026-08-15T20:11:31.125909Z","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-15T20:11:31.082330Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.082330Z"},"links":{"citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:87ee84fc921d1700636746900a38bfe4cd1b00dbb2e13da38506d0da11601352","observation_id":"e3e80863-f264-499f-86c7-ede8781801fa","resolution":{"observed_at":"2026-08-15T20:11:31.082330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.00087","last_updated":"2020-10-02T17:35:55Z","snapshot_observed_at":"2026-08-16T19:16:44.119691Z","submitted_at":"2020-09-30T20:05:46Z","title":"On Approximability of Clustering Problems Without Candidate Centers","version":2},"cited_work":{"arxiv_id":"2010.00087","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.00087","snapshot_observed_at":"2026-08-15T20:11:31.480751Z","title":"On Approximability of Clustering Problems Without Candidate Centers","venue":"cs.CC","work_id":"58c9b385-6ba7-40e1-9c91-48601a0538e6","year":2020},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.093563Z"},"links":{"cited_paper":"/paper/2010.00087","citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:9d2afe98dbc11c3d804a4d947adb9a52b1c13a6d4954c167d21fd02a291f9241","observation_id":"9cbc940f-06e1-44d4-9a06-232df9dc739d","resolution":{"observed_at":"2026-08-15T20:11:31.484895Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.10912","last_updated":"2021-11-21T22:42:42Z","snapshot_observed_at":"2026-08-18T14:03:19.813444Z","submitted_at":"2021-11-21T22:42:42Z","title":"Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics","version":1},"cited_work":{"arxiv_id":"2111.10912","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.10912","snapshot_observed_at":"2026-08-15T20:11:31.463192Z","title":"Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics","venue":"cs.CC","work_id":"c9cf7a5a-d4b2-46fb-80ed-8d47996afc57","year":2021},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.096817Z"},"links":{"cited_paper":"/paper/2111.10912","citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:060e3043a39eb820c5758881c4b3b44a833ded9eb9964370bcd1ceb88a218363","observation_id":"3f3b65a2-e998-464c-8488-ed3901ffb22c","resolution":{"observed_at":"2026-08-15T20:11:31.467664Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T20:11:31.504023Z","title":"Making k-means even faster.Proceedings of the 2010 SIAM International Conference on Data Mining , pages 130–140,","venue":null,"work_id":"114cbe72-835f-4c42-bd32-bd620c63e4be","year":2010},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.106527Z"},"links":{"citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:4fb3fba9e4ab38bb726faef18a7a73e17cd9c520e887ee8ab9f37612b672c463","observation_id":"c3d9cab1-2796-40b5-9888-0add30d652e0","resolution":{"observed_at":"2026-08-15T20:11:31.508289Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.07389","last_updated":"2024-01-14T23:19:53Z","snapshot_observed_at":"2026-08-16T14:27:36.223921Z","submitted_at":"2024-01-14T23:19:53Z","title":"A Rapid Review of Clustering Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.07389","snapshot_observed_at":"2026-08-15T20:11:31.139350Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T20:11:31.139350Z"},"links":{"cited_paper":"/paper/2401.07389","citing_paper":"/paper/2506.13533"},"observation_digest":"sha256:5d5ca3ba83b0b5ba41372ac845c9d5956861600c87ccf7e3a711e08d0f29d41e","observation_id":"dd20ad55-88c8-415d-9d4e-984e4c5188a7","resolution":{"observed_at":"2026-08-15T20:11:31.139350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.13533","last_updated":"2025-06-16T14:23:16Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T19:56:53.435528Z","submitted_at":"2025-06-16T14:23:16Z","title":"Learning Augmented Graph $k$-Clustering"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":9,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":15},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2506.13533."}