{"as_of":"2026-08-16T00:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b090216c44adfac516232b15ac32c9085ea48e65b27f2846f042e682af13c637","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T05:33:29.829084Z","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-07-04T11:39:47.093974Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.00256","last_updated":"2024-06-28T23:05:08Z","snapshot_observed_at":"2026-08-14T06:55:53.105519Z","submitted_at":"2024-06-28T23:05:08Z","title":"One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Prompts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00256","snapshot_observed_at":"2026-08-11T05:33:29.829084Z","title":"J.; and Hsieh, C.-J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.17404","last_updated":"2025-02-01T04:50:59Z","snapshot_observed_at":"2026-08-14T17:06:38.094819Z","submitted_at":"2024-12-23T09:13:35Z","title":"BrainMAP: Learning Multiple Activation Pathways in Brain Networks","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-11T05:33:29.829084Z"},"links":{"cited_paper":"/paper/2407.00256","citing_paper":"/paper/2412.17404"},"observation_digest":"sha256:4de5eb3f5bdc9f9bfe8d460c46b4396e3b42eb3b646631a9f6ce54fd61ee1cd2","observation_id":"d9a24e63-6c0f-460e-819d-978f7089815d","resolution":{"observed_at":"2026-08-11T05:33:29.829084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00256","last_updated":"2024-06-28T23:05:08Z","snapshot_observed_at":"2026-08-14T06:55:53.105519Z","submitted_at":"2024-06-28T23:05:08Z","title":"One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Prompts","version":1},"cited_work":{"arxiv_id":"2407.00256","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00256","snapshot_observed_at":"2026-07-04T11:39:47.093974Z","title":"One prompt is not enough: Automated construction of a mixture-of-expert prompts","venue":null,"work_id":"109414ed-94d1-4ead-bbe1-9112b992c8de","year":2024},"citing_paper":{"arxiv_id":"2605.17577","last_updated":"2026-05-17T18:07:08Z","snapshot_observed_at":"2026-08-15T22:01:31.311467Z","submitted_at":"2026-05-17T18:07:08Z","title":"TAME: Test-Time Adversarial Prompt Tuning via Mixture-of-Experts for Vision-Language Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-20T14:20:49.278545Z"},"links":{"cited_paper":"/paper/2407.00256","citing_paper":"/paper/2605.17577"},"observation_digest":"sha256:2caa738aadae8aed85edd403f0a3d24e703d5c33b4bb8777c4f43f4da0ce5e2a","observation_id":"c959e1d7-5a7d-41b8-87d4-af5c74723bc5","resolution":{"observed_at":"2026-05-20T14:23:21.502498Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2407.00256","last_updated":"2024-06-28T23:05:08Z","snapshot_observed_at":"2026-08-14T06:55:53.105519Z","submitted_at":"2024-06-28T23:05:08Z","title":"One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Prompts","version":1},"cited_work":{"arxiv_id":"2407.00256","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00256","snapshot_observed_at":"2026-07-04T11:39:47.093974Z","title":"One prompt is not enough: Automated construction of a mixture-of-expert prompts","venue":null,"work_id":"109414ed-94d1-4ead-bbe1-9112b992c8de","year":2024},"citing_paper":{"arxiv_id":"2606.24004","last_updated":"2026-06-29T07:01:12Z","snapshot_observed_at":"2026-08-12T14:10:50.106399Z","submitted_at":"2026-06-22T23:21:55Z","title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","version":1},"reference_index":104,"source":"pdf_text","source_observed_at":"2026-06-26T07:49:36.816100Z"},"links":{"cited_paper":"/paper/2407.00256","citing_paper":"/paper/2606.24004"},"observation_digest":"sha256:4d8bc1b541a81029f0ab9868d05076247de92377bc06225431d692b17884d33c","observation_id":"52a4c69f-903f-46f5-ac68-93efdf39484e","resolution":{"observed_at":"2026-07-04T11:39:47.096263Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2407.00256","last_updated":"2024-06-28T23:05:08Z","snapshot_observed_at":"2026-08-14T06:55:53.105519Z","submitted_at":"2024-06-28T23:05:08Z","title":"One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Prompts","version":1},"cited_work":{"arxiv_id":"2407.00256","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00256","snapshot_observed_at":"2026-07-04T11:39:47.093974Z","title":"One prompt is not enough: Automated construction of a mixture-of-expert prompts","venue":null,"work_id":"109414ed-94d1-4ead-bbe1-9112b992c8de","year":2024},"citing_paper":{"arxiv_id":"2606.24004","last_updated":"2026-06-29T07:01:12Z","snapshot_observed_at":"2026-08-12T14:10:50.106399Z","submitted_at":"2026-06-22T23:21:55Z","title":"Towards Spec Learning: Inference-Time Alignment from Preference Pairs","version":2},"reference_index":104,"source":"pdf_text","source_observed_at":"2026-06-30T10:17:33.176525Z"},"links":{"cited_paper":"/paper/2407.00256","citing_paper":"/paper/2606.24004"},"observation_digest":"sha256:728d3b38f250dfbde4c61a24cb2b5b36700f9f1a9275ef38af87b3e7c48bbe9b","observation_id":"0ace0ac1-54b9-4ba8-98e6-b38d501d9fc4","resolution":{"observed_at":"2026-06-30T12:04:39.389438Z","resolver_source":"arxiv_id","status":"verified_exact"},"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":"2407.00256","last_updated":"2024-06-28T23:05:08Z","snapshot_observed_at":"2026-08-14T06:55:53.105519Z","submitted_at":"2024-06-28T23:05:08Z","title":"One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Prompts","version":1},"cited_work":{"arxiv_id":"2407.00256","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00256","snapshot_observed_at":"2026-07-04T11:39:47.093974Z","title":"One prompt is not enough: Automated construction of a mixture-of-expert prompts","venue":null,"work_id":"109414ed-94d1-4ead-bbe1-9112b992c8de","year":2024},"citing_paper":{"arxiv_id":"2607.00427","last_updated":"2026-07-01T04:36:30Z","snapshot_observed_at":"2026-08-14T21:26:49.756857Z","submitted_at":"2026-07-01T04:36:30Z","title":"BT-APE: A Computationally Light Backtracking Approach to Automatic Prompt Engineering for Requirements Classification","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-02T09:12:59.039529Z"},"links":{"cited_paper":"/paper/2407.00256","citing_paper":"/paper/2607.00427"},"observation_digest":"sha256:db60486ac8def4f9b8c15a8f1ec4dee2036e0fc95acfc3791176bffc32ba193a","observation_id":"a84c92ac-245e-47b8-b837-3d6346d65aad","resolution":{"observed_at":"2026-07-02T09:16:48.651398Z","resolver_source":"arxiv_id","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2407.00256/citation-record","integrity":"/paper/2407.00256/integrity","json":"/paper/2407.00256/citation-record.json","paper":"/paper/2407.00256"},"outbound":[],"paper":{"arxiv_id":"2407.00256","last_updated":"2024-06-28T23:05:08Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-14T06:55:53.105519Z","submitted_at":"2024-06-28T23:05:08Z","title":"One Prompt is not Enough: Automated Construction of a Mixture-of-Expert Prompts"},"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 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2407.00256."}