{"as_of":"2026-08-09T18:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e8354cc4ac2747812f70246fa77d06d54e00a935f982e863a9b7a75e8ebf8c40","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-09T06:31:02.800959+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-08T11:15:06.854750Z","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-08T11:15:06.961563Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","snapshot_observed_at":"2026-08-02T07:32:06.784194Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","version":1},"cited_work":{"arxiv_id":"2412.00346","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.00346","snapshot_observed_at":"2026-08-08T11:15:06.961563Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention","venue":"cs.AI","work_id":"f7170678-6cdc-44c3-aeae-8e23b3e0f79a","year":2024},"citing_paper":{"arxiv_id":"2608.05541","last_updated":"2026-08-06T02:39:10Z","snapshot_observed_at":"2026-08-09T18:11:11.475718Z","submitted_at":"2026-08-06T02:39:10Z","title":"Hyper-ES: Effective Evolution Strategies for LLM Reasoning via Descent Direction Merging","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-08T11:15:06.854750Z"},"links":{"cited_paper":"/paper/2412.00346","citing_paper":"/paper/2608.05541"},"observation_digest":"sha256:a6b6f0147cc4f978548df98952f518c76d9c07ade1dab2e23cb907422815eaff","observation_id":"438b3021-970c-4297-b51d-558e47076881","resolution":{"observed_at":"2026-08-08T11:15:06.966095Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.00346/citation-record","integrity":"/paper/2412.00346/integrity","json":"/paper/2412.00346/citation-record.json","paper":"/paper/2412.00346"},"outbound":[],"paper":{"arxiv_id":"2412.00346","last_updated":"2024-11-30T04:11:36Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-02T07:32:06.784194Z","submitted_at":"2024-11-30T04:11:36Z","title":"CaDA: Cross-Problem Routing Solver with Constraint-Aware Dual-Attention"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2412.00346."}