{"as_of":"2026-08-20T03:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0ec6f11c4f297b6ea72c5fb6381cc2895f954e6ee836c33866def5f6136b5c8e","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-19T06:32:44.657259+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-15T19:46:01.780670Z","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-15T19:46:02.163401Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.17950","last_updated":"2024-05-28T08:26:54Z","snapshot_observed_at":"2026-08-20T01:15:07.893858Z","submitted_at":"2024-05-28T08:26:54Z","title":"Self-Guiding Exploration for Combinatorial Problems","version":1},"cited_work":{"arxiv_id":"2405.17950","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.17950","snapshot_observed_at":"2026-08-15T19:46:02.163401Z","title":"Self-Guiding Exploration for Combinatorial Problems","venue":"cs.AI","work_id":"a677cc0e-b8cf-4c75-a1d1-ddee1ca62839","year":2024},"citing_paper":{"arxiv_id":"2506.15196","last_updated":"2025-06-24T14:48:12Z","snapshot_observed_at":"2026-08-17T10:07:56.386477Z","submitted_at":"2025-06-18T07:20:01Z","title":"HeurAgenix: Leveraging LLMs for Solving Complex Combinatorial Optimization Challenges","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T19:46:01.780670Z"},"links":{"cited_paper":"/paper/2405.17950","citing_paper":"/paper/2506.15196"},"observation_digest":"sha256:e754266b54fb75492579e8102406a3c1396a2b2954007e9d9cd76fd8af5fb7e8","observation_id":"60e3ad4f-05e2-4b77-8cf1-f3f6e02fc108","resolution":{"observed_at":"2026-08-15T19:46:02.170417Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.17950/citation-record","integrity":"/paper/2405.17950/integrity","json":"/paper/2405.17950/citation-record.json","paper":"/paper/2405.17950"},"outbound":[],"paper":{"arxiv_id":"2405.17950","last_updated":"2024-05-28T08:26:54Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-20T01:15:07.893858Z","submitted_at":"2024-05-28T08:26:54Z","title":"Self-Guiding Exploration for Combinatorial Problems"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2405.17950."}