{"as_of":"2026-08-15T08:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e0f4fabb4a06a7e17d996804b56fad32085a45f1f93fccac3f8a6f553442d51","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-15T06:32:42.880941+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-07T12:23:10.297250Z","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-07T12:23:11.584450Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.14034","last_updated":"2023-10-21T15:18:22Z","snapshot_observed_at":"2026-08-13T05:44:04.881879Z","submitted_at":"2023-10-21T15:18:22Z","title":"Tree Prompting: Efficient Task Adaptation without Fine-Tuning","version":1},"cited_work":{"arxiv_id":"2310.14034","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.14034","snapshot_observed_at":"2026-08-07T12:23:11.584450Z","title":"Tree Prompting: Efficient Task Adaptation without Fine-Tuning","venue":"cs.CL","work_id":"311d7a5b-9efb-4636-8316-ecef45c9b4aa","year":2023},"citing_paper":{"arxiv_id":"2505.24622","last_updated":"2026-06-23T10:51:44Z","snapshot_observed_at":"2026-08-09T08:55:26.221330Z","submitted_at":"2025-05-30T14:13:21Z","title":"Random Rule Forest (RRF): Interpretable and Manageable Ensembles of LLM-Generated Questions for Predicting Success from Unstructured Data","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T12:23:10.297250Z"},"links":{"cited_paper":"/paper/2310.14034","citing_paper":"/paper/2505.24622"},"observation_digest":"sha256:8d9d4e86b32912c3337b43b957ef058fde0681676215cf627176f75e1914cdc1","observation_id":"fee785b2-703e-4e63-96e4-211f0974653e","resolution":{"observed_at":"2026-08-07T12:23:11.622635Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.14034","last_updated":"2023-10-21T15:18:22Z","snapshot_observed_at":"2026-08-13T05:44:04.881879Z","submitted_at":"2023-10-21T15:18:22Z","title":"Tree Prompting: Efficient Task Adaptation without Fine-Tuning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.14034","snapshot_observed_at":"2026-08-02T05:16:36.544435Z","title":"Tree prompting: efficient task adaptation without fine-tuning.arXiv preprint arXiv:2310.14034,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.13425","last_updated":"2026-07-15T04:03:24Z","snapshot_observed_at":"2026-08-03T17:12:53.669172Z","submitted_at":"2026-07-15T04:03:24Z","title":"Data-Efficient Adaptation of LLMs via Attention Head Reweighting","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T05:16:36.544435Z"},"links":{"cited_paper":"/paper/2310.14034","citing_paper":"/paper/2607.13425"},"observation_digest":"sha256:427741313e4eb9c99912bdb2f40641766c0e54a3e36f612fb779979519f98359","observation_id":"3fb4b496-45f2-4177-844e-f3142d249ff7","resolution":{"observed_at":"2026-08-02T05:16:36.544435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2310.14034/citation-record","integrity":"/paper/2310.14034/integrity","json":"/paper/2310.14034/citation-record.json","paper":"/paper/2310.14034"},"outbound":[],"paper":{"arxiv_id":"2310.14034","last_updated":"2023-10-21T15:18:22Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T05:44:04.881879Z","submitted_at":"2023-10-21T15:18:22Z","title":"Tree Prompting: Efficient Task Adaptation without Fine-Tuning"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2310.14034."}