{"as_of":"2026-08-08T16:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d400cd723f8c2a960b47b82cedab86032781cfad90b509be8d55296e9ae09ae8","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T09:12:23.110176Z","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-08T06:32:00.761636+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.20862/citation-record","integrity":"/paper/2607.20862/integrity","json":"/paper/2607.20862/citation-record.json","paper":"/paper/2607.20862"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:12:22.222607Z","title":"https://arxiv.org/abs/2509.21164v1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.222607Z"},"links":{"citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:42eadb69f1f9d6ba5be84301159b48c426c545ff0f60bc51a1cddf3be24c63f0","observation_id":"df391c9b-cbf7-4036-8717-7f1d27435d4e","resolution":{"observed_at":"2026-08-01T09:12:22.222607Z","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-01T09:12:22.301722Z","title":"Jonas Gehring, Kunhao Zheng, Jade Copet, Vegard Mella, Quentin Carbonneaux, Taco Cohen, and Gabriel Synnaeve","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.301722Z"},"links":{"citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:6e693db537b3ab4448ae7e8417dbbc025279251ae464cec8ae6ecca1067a9541","observation_id":"26babd2f-4efb-4165-8438-73a1337fafba","resolution":{"observed_at":"2026-08-01T09:12:22.301722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02089","last_updated":"2025-02-18T11:39:46Z","snapshot_observed_at":"2026-07-06T19:26:38.002071Z","submitted_at":"2024-10-02T23:25:17Z","title":"RLEF: Grounding Code LLMs in Execution Feedback with Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02089","snapshot_observed_at":"2026-08-01T09:12:22.385849Z","title":"https://arxiv.org/abs/2410.02089v2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.385849Z"},"links":{"cited_paper":"/paper/2410.02089","citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:02686c80b86e8c0781a3d1296de2a9ec536172e097cd6084ae2f8a8ffc56c051","observation_id":"873b42e5-cbfb-4569-9dae-a9a5bf5f35a1","resolution":{"observed_at":"2026-08-01T09:12:22.385849Z","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-01T09:12:22.465440Z","title":"InPro- ceedings of the 2024 Conference on Empiri- cal Methods in Natural Language Processing, pages 4334–4353, Miami, Florida, USA","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.465440Z"},"links":{"citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:81bfd663c3ed7a40c777a1ca29e8ee688f18f8adf17df3b8f210a00bd40eb2b4","observation_id":"55e5c279-2c64-4e17-ac4c-7ced6addac90","resolution":{"observed_at":"2026-08-01T09:12:22.465440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.01352","last_updated":"2026-03-02T20:56:17Z","snapshot_observed_at":"2026-08-04T07:18:25.941807Z","submitted_at":"2025-07-02T04:40:29Z","title":"Skywork-Reward-V2: Scaling Preference Data Curation via Human-AI Synergy","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.01352","snapshot_observed_at":"2026-08-01T09:12:22.559587Z","title":"InFindings of the Association for Computa- tional Linguistics: NAACL 2025, pages 1755– 1797, Albuquerque, New Mexico","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.559587Z"},"links":{"cited_paper":"/paper/2507.01352","citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:75a243fd04a5a0ea4b86bbd9a2d8a4970c6caddcdc059ef2b41806620c556973","observation_id":"de9681b8-f232-4c83-9a0c-f538b7a4d6e1","resolution":{"observed_at":"2026-08-01T09:12:22.559587Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.00847","last_updated":"2025-02-12T03:34:29Z","snapshot_observed_at":"2026-07-06T19:25:23.988463Z","submitted_at":"2024-10-01T16:29:59Z","title":"Uncertainty-aware Reward Model: Teaching Reward Models to Know What is Unknown","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.00847","snapshot_observed_at":"2026-08-01T09:12:22.636028Z","title":"https://arxiv.org/abs/2410.00847v2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.636028Z"},"links":{"cited_paper":"/paper/2410.00847","citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:f3775e55b67006b7fb81059bddb683d2acd06a54502eca06a565c62bfca65b3c","observation_id":"607f6be3-24da-466f-a1df-51fbdc437eac","resolution":{"observed_at":"2026-08-01T09:12:22.636028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01937","last_updated":"2026-04-23T14:42:19Z","snapshot_observed_at":"2026-07-06T21:35:12.872021Z","submitted_at":"2025-06-02T17:54:04Z","title":"RewardBench 2: Advancing Reward Model Evaluation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01937","snapshot_observed_at":"2026-08-01T09:12:22.726532Z","title":"https://arxiv.org/abs/2506.01937v2","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.726532Z"},"links":{"cited_paper":"/paper/2506.01937","citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:0f4f4857d27348d210d061bdc35974d66b20f77b1cdbe62ed18ce7624428172b","observation_id":"2857f7a9-8d5e-4549-ae9b-57342d6791f1","resolution":{"observed_at":"2026-08-01T09:12:22.726532Z","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-01T09:12:22.795020Z","title":"InFindings of the Association for Computational Linguistics: EMNLP 2024, pages 1043–1067, Miami, Florida, USA","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.795020Z"},"links":{"citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:1888a71163259aa57d85de1dd77cf2d9df73180bff02b9871900b4e787abc94f","observation_id":"c1a278c1-b20e-47de-ac97-3c5474b3c4d0","resolution":{"observed_at":"2026-08-01T09:12:22.795020Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-01T09:12:22.874740Z","title":"https://arxiv.org/abs/2402.03300v3","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.874740Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:9c9c67c25649565d250be8bc042ca1620a51330afe7e35733a299437361995f8","observation_id":"90e65005-93a3-4fd1-af44-4bc6b3a2782b","resolution":{"observed_at":"2026-08-01T09:12:22.874740Z","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-01T09:12:23.110176Z","title":"Depending on the experiment, we use their reward scores, hidden states, or both","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:23.110176Z"},"links":{"citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:debb07d17ea5dffece8137c3f2d2016e2ee7daced5e0070af8a23efd6da4d4a1","observation_id":"33f67ffc-5efc-4ad0-b8d6-226d4deed4f3","resolution":{"observed_at":"2026-08-01T09:12:23.110176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04132","last_updated":"2024-03-07T01:22:38Z","snapshot_observed_at":"2026-08-02T17:55:33.750637Z","submitted_at":"2024-03-07T01:22:38Z","title":"Chatbot Arena: An Open Platform for Evaluating LLMs by Human Preference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.04132","snapshot_observed_at":"2026-08-01T09:12:22.182908Z","title":"https://arxiv.org/abs/2403.04132v1","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.182908Z"},"links":{"cited_paper":"/paper/2403.04132","citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:abf74588bf007c558673442687d7e57884c22b870b0c21a2b4f2934236b6a14e","observation_id":"ecea5ad7-4b16-48b1-9baa-cd0ccf4f2c87","resolution":{"observed_at":"2026-08-01T09:12:22.182908Z","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-01T09:12:22.126497Z","title":"https://arxiv.org/abs/2505.13388v3","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.126497Z"},"links":{"citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:c235e436aaec1185d13e75cd97e233cab04e2dcd5b82fe6fdc57eca50d1a0587","observation_id":"470eaa50-06dd-4076-95be-4e056e958fe4","resolution":{"observed_at":"2026-08-01T09:12:22.126497Z","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-01T09:12:22.984878Z","title":"Haoxiang Wang, Wei Xiong, Tengyang Xie, Han Zhao, and Tong Zhang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-01T09:12:22.984878Z"},"links":{"citing_paper":"/paper/2607.20862"},"observation_digest":"sha256:c1c2b111fd56146d71aabdc1b7ebb686fa7b369bce8190821dc552c48ea7bfdb","observation_id":"9200c067-6a2e-4097-8693-acbec9c66f3f","resolution":{"observed_at":"2026-08-01T09:12:22.984878Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20862","last_updated":"2026-07-23T02:39:11Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-06T06:00:14.599452Z","submitted_at":"2026-07-23T02:39:11Z","title":"CSPF: A Constrained Shared-Private Fusion Method for Non-Verifiable Preference Evaluation"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":13},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 0 inbound Pith citation observations for arXiv:2607.20862."}