{"as_of":"2026-08-09T16:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:010dcc248ac978bce1fbd1f917e22c1ef4a9ad500c8cd2720e41a8378560f733","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-06-27T10:36:26.784333Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2606.12505/citation-record","integrity":"/paper/2606.12505/integrity","json":"/paper/2606.12505/citation-record.json","paper":"/paper/2606.12505"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T10:36:26.784333Z","title":"Advances in Neural Information Processing Systems , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:d5a3fab6317b0cb85f1e8db7996ff134e90c07ce61f1b626d60932a900d1a55f","observation_id":"7f08a3ab-acc4-4139-a3f0-a6de9ecacf1c","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","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-06-27T10:36:26.784333Z","title":"Advances in Neural Information Processing Systems , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:a98ad4be761d693c3376c302ec7a735408372fade0978a780de5c1394e7188f9","observation_id":"a9f42c09-776d-4800-9898-5a795eeed333","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","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-06-27T10:36:26.784333Z","title":"The Method of Paired Comparisons , author =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:bff8497be6c470bc1e1a0f481dc53dcc297cb694b10f5f8cbcfde2e802a3317a","observation_id":"5130cb78-ddb5-498a-bd8c-c3da3ccb94cc","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","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-06-27T10:36:26.784333Z","title":"Advances in Neural Information Processing Systems , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:4f0abab4a667874c3da53f984c03e01800113659a9ce2973aeecb5a66ceb59ed","observation_id":"ab993950-bcd0-419a-abd5-46c9b0ea0700","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","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-06-27T10:36:26.784333Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:e59986e5572bb877099c060576816e768e460d2acb2e531e320b9a6aba13d036","observation_id":"cbf36011-e588-4292-ba28-6f978a891b3c","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10148","last_updated":"2025-07-19T03:40:37Z","snapshot_observed_at":"2026-07-31T17:19:15.491176Z","submitted_at":"2024-10-14T04:29:57Z","title":"AlphaDPO: Adaptive Reward Margin for Direct Preference Optimization","version":4},"cited_work":{"arxiv_id":"2410.10148","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10148","snapshot_observed_at":"2026-07-03T08:57:48.045665Z","title":"Alphadpo: Adaptive reward margin for direct preference optimization","venue":null,"work_id":"7860cb42-7fb9-4dc4-84fd-5eee9b4a9b92","year":2024},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"cited_paper":"/paper/2410.10148","citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:07de988777194aa211b410474ae016fa7f9f892abdd979ddd88cb2d10740979f","observation_id":"e45fb5f7-635f-49fb-b37f-e5cfc184354a","resolution":{"observed_at":"2026-07-03T08:57:48.047259Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-27T10:36:26.784333Z","title":"2024 , eprint =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:eacda18792d7a535d225377adb638ce6186c59a7af5823cfe8cfac3e8a0bf0b8","observation_id":"8568ac25-9b9f-456f-a1c4-3ed628a0daa3","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","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":"2410.07163","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T00:29:15.387147Z","title":"Simplicity prevails: Rethinking negative preference optimization for llm unlearning","venue":null,"work_id":"372e1066-40c7-4da3-97bd-755328c1de7a","year":2024},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:772b52f63bd83ddf235d7b0136c41aebf4097886bb3cc46ff41ef2f7f62c867e","observation_id":"5b4e59c9-ad7a-40a2-ae4a-26a77d7d28b7","resolution":{"observed_at":"2026-07-03T08:57:48.044433Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-06-27T10:36:26.784333Z","title":"Conference on Language Modeling , year =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:28fb4537b3e30c23e576375cc5c1bc567e497c9e56b6e3a491cd184c6c928792","observation_id":"3a1863a5-77cd-4b9f-8b88-380e69480e7d","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","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-06-27T10:36:26.784333Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:6cfeb8155c1c542fb45bf98498ddb8c1bb02dd465cc8bfa448f036de8e5c4652","observation_id":"ea16de6e-408c-4a4b-9262-820b28c7d855","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","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-06-27T10:36:26.784333Z","title":"2024 , eprint =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:a5d3420421f27b8129168c92abf7655e9bcfd6e5c3ae5bf01945f71104627efc","observation_id":"c5fd4ed7-f508-44b9-bae5-3a38819dded8","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","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-06-27T10:36:26.784333Z","title":"2024 , eprint =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:26.784333Z"},"links":{"citing_paper":"/paper/2606.12505"},"observation_digest":"sha256:81c374d3c544fbc871357af617a3a96a040f88564d92b4eaf96ad327472be540","observation_id":"7ac105ee-4bbd-4558-a586-1809a1db502d","resolution":{"observed_at":"2026-06-27T10:36:26.784333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.12505","last_updated":"2026-06-10T17:22:51Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T06:04:41.277529Z","submitted_at":"2026-06-10T17:22:51Z","title":"Boosting Direct Preference Optimization with Penalization"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2606.12505."}