{"as_of":"2026-08-06T07:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:472bb79b21153492c4fb78d79297db727ebf26b1612b89ff44a91455e5dc3172","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T16:37:55.804747Z","state":"measured"},{"denominator":13,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":13,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T20:06:23.200486Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.10467","snapshot_observed_at":"2026-08-01T20:06:23.200486Z","title":"An Upper Bound on the Linear Turán Number ofk-Crowns.arXiv preprint arXiv:2604.10467, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.16854","last_updated":"2026-07-18T15:32:12Z","snapshot_observed_at":"2026-08-01T20:06:22.316166Z","submitted_at":"2026-07-18T15:32:12Z","title":"Linear Tur\\'an Numbers of Uniform Hypertrees","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T20:06:23.200486Z"},"links":{"cited_paper":"/paper/2604.10467","citing_paper":"/paper/2607.16854"},"observation_digest":"sha256:bf51ce31fbe7ae730fccd7340e49b5ea73cdbc6186f9ae2d2a73ff691cc1332b","observation_id":"5acfae71-683d-4fc9-aacf-8738167f4c1c","resolution":{"observed_at":"2026-08-01T20:06:23.200486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.10467/citation-record","integrity":"/paper/2604.10467/integrity","json":"/paper/2604.10467/citation-record.json","paper":"/paper/2604.10467"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.01501","last_updated":"2025-05-07T11:58:34Z","snapshot_observed_at":"2026-08-05T01:22:33.763539Z","submitted_at":"2025-04-02T08:52:28Z","title":"Vertex-Based Localization of Erd\\H{o}s-Gallai Theorems for Paths and Cycles","version":2},"cited_work":{"arxiv_id":"2504.01501","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.01501","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Vertex-Based Localization of Erd˝ os-Gallai The- orems for Paths and Cycles","venue":null,"work_id":"f80fb203-6662-446a-a8bc-bc386d3a8bdb","year":2025},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"cited_paper":"/paper/2504.01501","citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:48bed48a0c062cb2e89a042980eee8b9ccce73d32d3b1a52cee2cde30fbb9d34","observation_id":"0b5a07a4-c1ed-4f82-a536-c5359ae2d752","resolution":{"observed_at":"2026-05-11T08:26:01.905031Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Localization: A framework to generalize extremal graph problems","venue":null,"work_id":"808c3b8b-2988-43a8-bc90-b00d8d5036c6","year":2026},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:2558e6fdad75e3b56c11dba12957295ca388f8a5bb6a4fe85a13d369693df9bd","observation_id":"f77670c3-41ab-4629-94db-2cbc52123c63","resolution":{"observed_at":"2026-05-17T14:24:45.088306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2601.17325","last_updated":"2026-07-16T05:12:54Z","snapshot_observed_at":"2026-08-03T08:32:36.016104Z","submitted_at":"2026-01-24T06:09:20Z","title":"Bounds on Linear Tur\\'{a}n Number for Trees","version":4},"cited_work":{"arxiv_id":"2601.17325","doi":null,"metadata_source":"pith","pith_arxiv_id":"2601.17325","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bounds on Linear Tur\\'{a}n Number for Trees","venue":"math.CO","work_id":"270ee33b-27bc-458e-b7bf-492fcf427c12","year":2026},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"cited_paper":"/paper/2601.17325","citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:1cc9609d657779331d3d04bbabf94cd6b87f04d019a5a4d6f3922825c451f924","observation_id":"cafcfbd6-0e14-4001-af0e-7fedea953b3e","resolution":{"observed_at":"2026-05-11T08:26:01.886373Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.14713","last_updated":"2021-07-30T15:35:39Z","snapshot_observed_at":"2026-07-06T11:34:11.902934Z","submitted_at":"2021-07-30T15:35:39Z","title":"Crowns in linear $3$-graphs","version":1},"cited_work":{"arxiv_id":"2107.14713","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2107.14713","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Crowns in linear3-graphs","venue":null,"work_id":"76360ec2-a0d3-4749-9c40-502ac6097203","year":2021},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"cited_paper":"/paper/2107.14713","citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:237379c29408ab8a7a9c60fb3e38ed78baa9630257512db881641ef4eb5674d8","observation_id":"c2e00d82-1565-4fc3-8fa4-b320f2f06395","resolution":{"observed_at":"2026-05-11T08:26:01.899811Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Crowns in linear 3-graphs of minimum degree 4.The Electronic Journal of Combinatorics, pages P4–17","venue":null,"work_id":"0aa09c93-8667-412e-8a33-3768d97eb32c","year":2022},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:5a6c83d92e322eba4a80af5ff2c75d691b63c6579422f8dcbad2581371577739","observation_id":"5dd5d592-80d5-4e56-a4ea-5546125bb07c","resolution":{"observed_at":"2026-05-17T14:24:45.092657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.02729","last_updated":"2021-09-06T20:48:37Z","snapshot_observed_at":"2026-08-03T21:22:30.260079Z","submitted_at":"2021-09-06T20:48:37Z","title":"Improved Upper Bound on the Linear Tur\\'an Number of the Crown","version":1},"cited_work":{"arxiv_id":"2109.02729","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.02729","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved upperbound onthe linear tur\\’annumber ofthe crown","venue":null,"work_id":"d5fc230d-f729-4b16-ae22-41642402b297","year":2021},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"cited_paper":"/paper/2109.02729","citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:acd71cea8e12af891086b5ddc30587d5779aa76915c2108dc5d51f356390aabe","observation_id":"a4ee020e-47f8-43b4-b7ad-e4e41ff3791e","resolution":{"observed_at":"2026-05-11T08:26:01.911596Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Linear Tur´ an numbers of acyclic triple systems.European Journal of Combinatorics, 99:103435","venue":null,"work_id":"23efe689-bcd3-4502-856b-2e1920bb33ed","year":2022},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:0dbf5e982872f6bc0654bf1295e9151cfedb458c6b09f379ed9b3e60b6a2dbdd","observation_id":"5000be26-091f-47ef-87d2-1d477b8bd74b","resolution":{"observed_at":"2026-05-17T14:24:45.080231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Localized versions of extremal problems.European Journal of Combinatorics, 112:103715","venue":null,"work_id":"0ac51ff3-9c86-4ae0-9c8b-c96e7b1263d9","year":2023},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:05c6a5060a8f008eec5172792e7ce1c282a2eecf393e718d6a73ffd09197f652","observation_id":"346d4151-3f01-412b-a5cd-d49a160aebec","resolution":{"observed_at":"2026-05-17T14:24:45.103048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"On the Tur´ an Number of the Linear 3-GraphC 13 .The Electronic Journal of Combinatorics, pages P3–46","venue":null,"work_id":"1ff4d399-a767-4f34-8c92-2b9b91f3bf48","year":2022},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:8c9023627935880cc7b0448c1096a3efed723fc40e2f9e9fdcec244a48cbe122","observation_id":"f728e9ac-f451-4774-b8ca-c5c40cc9d956","resolution":{"observed_at":"2026-05-17T14:24:45.084119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"Generalized crowns in linear r-graphs.The Electronic Journal of Combinatorics, pages P1–29","venue":null,"work_id":"3bb57584-c2cf-4b32-b5db-22d9fb3e3209","year":2025},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:8231b7139cc7b69ada24c325bbf485a6a233d30e01dcf5d6e8429dee82493a6f","observation_id":"7dd1bfc8-ae93-4e4f-843f-ce8298854892","resolution":{"observed_at":"2026-05-17T14:24:45.098793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"The Linear Tur´ an Numbers of Acyclic Linear 4-graphs.Acta Mathematicae Applicatae Sinica, English Series, pages 1–13","venue":null,"work_id":"7ad56509-53ae-4233-a723-ac099e927237","year":2025},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:86927a1e84a1f3df609a32de7ea6bb0d5680621af2d2a045e38601316c01469c","observation_id":"2525661c-fc55-4e7a-9669-3cc2c2d4a663","resolution":{"observed_at":"2026-05-17T14:24:45.074665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-06-05T21:23:00.469572Z","title":"A localized approach for Tur´ an number of long cycles.Journal of Graph Theory, 108(3):582–607","venue":null,"work_id":"67751c16-8168-4ac8-a9d5-afa1114791dc","year":2025},"citing_paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T16:37:55.804747Z"},"links":{"citing_paper":"/paper/2604.10467"},"observation_digest":"sha256:2c403d401fdaa36578974085092af1ca74e8aabee02416140a096daeae0cb9d7","observation_id":"ad869e07-8fe5-4bd6-9ea8-328ca4ea0d22","resolution":{"observed_at":"2026-05-17T14:24:45.063879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.10467","last_updated":"2026-04-12T05:27:56Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-04T01:50:40.325473Z","submitted_at":"2026-04-12T05:27:56Z","title":"An Upper Bound on the Linear Tur\\'{a}n Number of $k$-Crowns"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":4,"verified_fuzzy":8},"total_outbound_references":12},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 1 inbound Pith citation observation for arXiv:2604.10467."}