{"as_of":"2026-08-10T09:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a14d6ab60291e3889ab8081b96988552bf250fc2682c0dd366854e270628c028","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T18:00:22.154795Z","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-09T18:00:23.175985Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.10504","last_updated":"2025-05-19T06:17:42Z","snapshot_observed_at":"2026-07-06T18:31:21.929350Z","submitted_at":"2024-06-15T04:54:26Z","title":"Task Facet Learning: A Structured Approach to Prompt Optimization","version":2},"cited_work":{"arxiv_id":"2406.10504","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.10504","snapshot_observed_at":"2026-08-09T18:00:23.175985Z","title":"Task Facet Learning: A Structured Approach to Prompt Optimization","venue":"cs.AI","work_id":"e1af5708-c9e3-40a6-8e0c-34f5681300b1","year":2024},"citing_paper":{"arxiv_id":"2502.00728","last_updated":"2025-02-02T09:22:39Z","snapshot_observed_at":"2026-08-09T17:53:54.249868Z","submitted_at":"2025-02-02T09:22:39Z","title":"Meta-Prompt Optimization for LLM-Based Sequential Decision Making","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T18:00:22.154795Z"},"links":{"cited_paper":"/paper/2406.10504","citing_paper":"/paper/2502.00728"},"observation_digest":"sha256:48e3ec8b8a66282d16cfcb676a370f243f31f9dca54eef15a3db346b48b493af","observation_id":"4eceadef-b432-4c94-af6d-1a2370874ca4","resolution":{"observed_at":"2026-08-09T18:00:23.182415Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.10504/citation-record","integrity":"/paper/2406.10504/integrity","json":"/paper/2406.10504/citation-record.json","paper":"/paper/2406.10504"},"outbound":[],"paper":{"arxiv_id":"2406.10504","last_updated":"2025-05-19T06:17:42Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T18:31:21.929350Z","submitted_at":"2024-06-15T04:54:26Z","title":"Task Facet Learning: A Structured Approach to Prompt 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2406.10504."}