{"as_of":"2026-08-12T20:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68f615f0253afe5c29bdf651872c61400bb9bc4116bc4cfcceff9afc5dcc844a","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T12:27:15.046470Z","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-08-11T00:07:41.665933Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.04879","last_updated":"2024-06-07T12:25:51Z","snapshot_observed_at":"2026-08-07T10:12:21.002117Z","submitted_at":"2024-06-07T12:25:51Z","title":"A Deep Dive into the Trade-Offs of Parameter-Efficient Preference Alignment Techniques","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.04879","snapshot_observed_at":"2026-08-11T12:27:15.046470Z","title":"A deep dive into the trade-offs of parameter-efficient preference alignment techniques","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14355","last_updated":"2024-12-18T21:43:40Z","snapshot_observed_at":"2026-08-11T19:04:40.952532Z","submitted_at":"2024-12-18T21:43:40Z","title":"Enabling Realtime Reinforcement Learning at Scale with Staggered Asynchronous Inference","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-11T12:27:15.046470Z"},"links":{"cited_paper":"/paper/2406.04879","citing_paper":"/paper/2412.14355"},"observation_digest":"sha256:9a1bcede3170cb1d497c25b7d16e954d777c96ffd80a379fd868a8b56cd41255","observation_id":"5647d77d-8fcb-4be3-9ed2-b50b3c8d46ed","resolution":{"observed_at":"2026-08-11T12:27:15.046470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.04879","last_updated":"2024-06-07T12:25:51Z","snapshot_observed_at":"2026-08-07T10:12:21.002117Z","submitted_at":"2024-06-07T12:25:51Z","title":"A Deep Dive into the Trade-Offs of Parameter-Efficient Preference Alignment Techniques","version":1},"cited_work":{"arxiv_id":"2406.04879","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.04879","snapshot_observed_at":"2026-08-11T00:07:41.665933Z","title":"A Deep Dive into the Trade-Offs of Parameter-Efficient Preference Alignment Techniques","venue":"cs.CL","work_id":"f962795d-7336-4eef-a2c8-dd77301bf75f","year":2024},"citing_paper":{"arxiv_id":"2412.19726","last_updated":"2025-06-12T14:58:31Z","snapshot_observed_at":"2026-08-10T23:53:24.513179Z","submitted_at":"2024-12-27T16:30:12Z","title":"Position: Theory of Mind Benchmarks are Broken for Large Language Models","version":4},"reference_index":107,"source":"arxiv_source","source_observed_at":"2026-08-11T00:07:41.474552Z"},"links":{"cited_paper":"/paper/2406.04879","citing_paper":"/paper/2412.19726"},"observation_digest":"sha256:2507a5a1a4766057c5bcd7a331d53bcfa84e884573ab9e121eda329583c91d0a","observation_id":"400e92c7-d45f-4fa1-a428-3c9eff4cf0bb","resolution":{"observed_at":"2026-08-11T00:07:41.670852Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.04879/citation-record","integrity":"/paper/2406.04879/integrity","json":"/paper/2406.04879/citation-record.json","paper":"/paper/2406.04879"},"outbound":[],"paper":{"arxiv_id":"2406.04879","last_updated":"2024-06-07T12:25:51Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T10:12:21.002117Z","submitted_at":"2024-06-07T12:25:51Z","title":"A Deep Dive into the Trade-Offs of Parameter-Efficient Preference Alignment Techniques"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.04879."}