{"as_of":"2026-08-08T10:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d9d5339fd87a43af57cecba75bc9018a41dcefe19d35abfdc5fb168b0668aa62","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-08T06:32:00.761636+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-06T21:32:23.825194Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T08:02:43.339076Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.19684","last_updated":"2025-02-17T15:32:50Z","snapshot_observed_at":"2026-07-06T20:13:45.123960Z","submitted_at":"2024-12-27T15:21:17Z","title":"Boosting Private Domain Understanding of Efficient MLLMs: A Tuning-free, Adaptive, Universal Prompt Optimization Framework","version":2},"cited_work":{"arxiv_id":"2412.19684","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.19684","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6264f763-8214-48b9-b0be-32422193240b","year":2024},"citing_paper":{"arxiv_id":"2412.04300","last_updated":"2025-06-04T03:29:18Z","snapshot_observed_at":"2026-08-08T07:13:29.035650Z","submitted_at":"2024-12-05T16:21:01Z","title":"T2I-FactualBench: Benchmarking the Factuality of Text-to-Image Models with Knowledge-Intensive Concepts","version":3},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-23T08:00:12.781392Z"},"links":{"cited_paper":"/paper/2412.19684","citing_paper":"/paper/2412.04300"},"observation_digest":"sha256:8f2fe6a4aae5a656c2990dcb07bc3afc1fee12de1b34405d0e96f358faa13544","observation_id":"15660616-820d-4ace-b611-5878892086a3","resolution":{"observed_at":"2026-05-23T08:02:43.342981Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19684","last_updated":"2025-02-17T15:32:50Z","snapshot_observed_at":"2026-07-06T20:13:45.123960Z","submitted_at":"2024-12-27T15:21:17Z","title":"Boosting Private Domain Understanding of Efficient MLLMs: A Tuning-free, Adaptive, Universal Prompt Optimization Framework","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19684","snapshot_observed_at":"2026-08-06T21:32:23.825194Z","title":"Boosting private domain understanding of efficient mllms: A tuning-free, adaptive, universal prompt optimization framework","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.23940","last_updated":"2025-07-01T03:26:52Z","snapshot_observed_at":"2026-08-07T22:13:54.563047Z","submitted_at":"2025-06-30T15:07:41Z","title":"Graft: Integrating the Domain Knowledge via Efficient Parameter Synergy for MLLMs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:32:23.825194Z"},"links":{"cited_paper":"/paper/2412.19684","citing_paper":"/paper/2506.23940"},"observation_digest":"sha256:527c2544ab57a1736e85287256bb6260fcd90d895c38189036c87284a5e04bde","observation_id":"29eb50a3-4367-4532-94f5-39646381daf0","resolution":{"observed_at":"2026-08-06T21:32:23.825194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.19684/citation-record","integrity":"/paper/2412.19684/integrity","json":"/paper/2412.19684/citation-record.json","paper":"/paper/2412.19684"},"outbound":[],"paper":{"arxiv_id":"2412.19684","last_updated":"2025-02-17T15:32:50Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T20:13:45.123960Z","submitted_at":"2024-12-27T15:21:17Z","title":"Boosting Private Domain Understanding of Efficient MLLMs: A Tuning-free, Adaptive, Universal Prompt Optimization Framework"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2412.19684."}