{"as_of":"2026-08-05T07:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b6f4923c326409bb7ad224538cb21ddd359d57a2908728780cc817a8d5f1a23c","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-09T03:36:57.168246Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-09T03:45:55.769708Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.14460","last_updated":"2025-08-20T06:31:18Z","snapshot_observed_at":"2026-07-06T22:15:27.120497Z","submitted_at":"2025-08-20T06:31:18Z","title":"DuPO: Enabling Reliable LLM Self-Verification via Dual Preference Optimization","version":1},"cited_work":{"arxiv_id":"2508.14460","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.14460","snapshot_observed_at":"2026-07-09T03:45:55.769708Z","title":"Dupo: Enabling reliable llm self-verification via dual preference optimization","venue":"cs.LG","work_id":"3fe81cf5-0f42-45fa-98fc-07de57879b71","year":2025},"citing_paper":{"arxiv_id":"2509.02547","last_updated":"2026-04-17T18:09:08Z","snapshot_observed_at":"2026-08-03T09:07:42.489237Z","submitted_at":"2025-09-02T17:46:26Z","title":"The Landscape of Agentic Reinforcement Learning for LLMs: A Survey","version":5},"reference_index":168,"source":"pdf_text","source_observed_at":"2026-05-18T19:19:36.427337Z"},"links":{"cited_paper":"/paper/2508.14460","citing_paper":"/paper/2509.02547"},"observation_digest":"sha256:b5f7d891b83c722c42cb8167e8185d10158fdd819d23e1a49533a66876add9ff","observation_id":"2c089767-b6be-4159-b829-90b0d5308803","resolution":{"observed_at":"2026-05-18T19:21:48.822252Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14460","last_updated":"2025-08-20T06:31:18Z","snapshot_observed_at":"2026-07-06T22:15:27.120497Z","submitted_at":"2025-08-20T06:31:18Z","title":"DuPO: Enabling Reliable LLM Self-Verification via Dual Preference Optimization","version":1},"cited_work":{"arxiv_id":"2508.14460","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.14460","snapshot_observed_at":"2026-07-09T03:45:55.769708Z","title":"Dupo: Enabling reliable llm self-verification via dual preference optimization","venue":"cs.LG","work_id":"3fe81cf5-0f42-45fa-98fc-07de57879b71","year":2025},"citing_paper":{"arxiv_id":"2604.17928","last_updated":"2026-04-20T08:09:01Z","snapshot_observed_at":"2026-07-06T23:04:55.190916Z","submitted_at":"2026-04-20T08:09:01Z","title":"HEALing Entropy Collapse: Enhancing Exploration in Few-Shot RLVR via Hybrid-Domain Entropy Dynamics Alignment","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-10T05:23:08.478393Z"},"links":{"cited_paper":"/paper/2508.14460","citing_paper":"/paper/2604.17928"},"observation_digest":"sha256:91eadcf663366a8f885a223916f0747bb72b73c4af3a1da2999e622fe574905e","observation_id":"f50b5d55-6c77-4489-8a46-2d1762a29fa6","resolution":{"observed_at":"2026-05-10T09:23:37.538719Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14460","last_updated":"2025-08-20T06:31:18Z","snapshot_observed_at":"2026-07-06T22:15:27.120497Z","submitted_at":"2025-08-20T06:31:18Z","title":"DuPO: Enabling Reliable LLM Self-Verification via Dual Preference Optimization","version":1},"cited_work":{"arxiv_id":"2508.14460","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.14460","snapshot_observed_at":"2026-07-09T03:45:55.769708Z","title":"Dupo: Enabling reliable llm self-verification via dual preference optimization","venue":"cs.LG","work_id":"3fe81cf5-0f42-45fa-98fc-07de57879b71","year":2025},"citing_paper":{"arxiv_id":"2605.12943","last_updated":"2026-05-13T03:26:07Z","snapshot_observed_at":"2026-08-02T16:54:34.012559Z","submitted_at":"2026-05-13T03:26:07Z","title":"Reinforced Collaboration in Multi-Agent Flow Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-14T20:42:48.438057Z"},"links":{"cited_paper":"/paper/2508.14460","citing_paper":"/paper/2605.12943"},"observation_digest":"sha256:48b10dbbfcba6948e030264905cd64246cdddb6c8cacc8ee7dae4ec01a49c6d5","observation_id":"5f83a916-69e9-4b21-9e86-0743939841f6","resolution":{"observed_at":"2026-05-14T20:42:57.152042Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14460","last_updated":"2025-08-20T06:31:18Z","snapshot_observed_at":"2026-07-06T22:15:27.120497Z","submitted_at":"2025-08-20T06:31:18Z","title":"DuPO: Enabling Reliable LLM Self-Verification via Dual Preference Optimization","version":1},"cited_work":{"arxiv_id":"2508.14460","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.14460","snapshot_observed_at":"2026-07-09T03:45:55.769708Z","title":"Dupo: Enabling reliable llm self-verification via dual preference optimization","venue":"cs.LG","work_id":"3fe81cf5-0f42-45fa-98fc-07de57879b71","year":2025},"citing_paper":{"arxiv_id":"2606.18961","last_updated":"2026-06-17T11:42:01Z","snapshot_observed_at":"2026-07-06T23:54:18.292223Z","submitted_at":"2026-06-17T11:42:01Z","title":"Be Your Own Teacher: Steering Protein Language Models via Unsupervised Reward Optimization","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-26T21:40:55.946788Z"},"links":{"cited_paper":"/paper/2508.14460","citing_paper":"/paper/2606.18961"},"observation_digest":"sha256:ec221513b6b1406be9f53360fcfb80a0cb87680a17ddb0fad836c32981c65139","observation_id":"6be0487b-94c1-4ea9-b66b-0180bdc3eeac","resolution":{"observed_at":"2026-07-03T23:49:02.982884Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14460","last_updated":"2025-08-20T06:31:18Z","snapshot_observed_at":"2026-07-06T22:15:27.120497Z","submitted_at":"2025-08-20T06:31:18Z","title":"DuPO: Enabling Reliable LLM Self-Verification via Dual Preference Optimization","version":1},"cited_work":{"arxiv_id":"2508.14460","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.14460","snapshot_observed_at":"2026-07-09T03:45:55.769708Z","title":"Dupo: Enabling reliable llm self-verification via dual preference optimization","venue":"cs.LG","work_id":"3fe81cf5-0f42-45fa-98fc-07de57879b71","year":2025},"citing_paper":{"arxiv_id":"2607.07663","last_updated":"2026-07-08T17:19:50Z","snapshot_observed_at":"2026-07-30T01:44:04.256851Z","submitted_at":"2026-07-08T17:19:50Z","title":"Recursive Self-Improvement in AI: From Bounded Self-Refinement to Autonomous Research Loops","version":1},"reference_index":147,"source":"pdf_text","source_observed_at":"2026-07-09T03:36:57.168246Z"},"links":{"cited_paper":"/paper/2508.14460","citing_paper":"/paper/2607.07663"},"observation_digest":"sha256:65ca276ac7baa681fccc132f7e4f8b5d2e54ca70e709a8c651856ca02f385a13","observation_id":"54bbfa46-f077-471c-8e24-920f431e2757","resolution":{"observed_at":"2026-07-09T03:45:55.770922Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.14460/citation-record","integrity":"/paper/2508.14460/integrity","json":"/paper/2508.14460/citation-record.json","paper":"/paper/2508.14460"},"outbound":[],"paper":{"arxiv_id":"2508.14460","last_updated":"2025-08-20T06:31:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T22:15:27.120497Z","submitted_at":"2025-08-20T06:31:18Z","title":"DuPO: Enabling Reliable LLM Self-Verification via Dual Preference Optimization"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2508.14460."}