{"as_of":"2026-08-05T22:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d96638fe1db674bf1c7758d1fa9fa3ffe8fd1a74ec4d7d9a22870f0dd9aaa164","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-05T06:32:48.257954+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-06-27T13:59:45.153788Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.13569","last_updated":"2024-05-28T14:22:20Z","snapshot_observed_at":"2026-07-06T16:51:15.252642Z","submitted_at":"2023-11-13T12:24:54Z","title":"Combinatorial Optimization with Policy Adaptation using Latent Space Search","version":2},"cited_work":{"arxiv_id":"2311.13569","doi":"10.48550/arxiv.2311.13569","metadata_source":"arxiv_reference","pith_arxiv_id":"2311.13569","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"3e50ca7c-b7b3-448e-9b99-8a26a60090e4","year":2023},"citing_paper":{"arxiv_id":"2606.10611","last_updated":"2026-06-09T09:11:36Z","snapshot_observed_at":"2026-08-01T14:57:20.334017Z","submitted_at":"2026-06-09T09:11:36Z","title":"Geometry-Aware Reinforcement Learning for 2D Irregular Nesting","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T13:59:45.153788Z"},"links":{"cited_paper":"/paper/2311.13569","citing_paper":"/paper/2606.10611"},"observation_digest":"sha256:7bd9d7aa687e383fa2bd16a6c4f63d886f3a8af90a6012550add2abc87f86014","observation_id":"3172ad48-e0c4-42e1-bd32-9ae743e98b1d","resolution":{"observed_at":"2026-06-27T14:00:59.284283Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.13569/citation-record","integrity":"/paper/2311.13569/integrity","json":"/paper/2311.13569/citation-record.json","paper":"/paper/2311.13569"},"outbound":[],"paper":{"arxiv_id":"2311.13569","last_updated":"2024-05-28T14:22:20Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T16:51:15.252642Z","submitted_at":"2023-11-13T12:24:54Z","title":"Combinatorial Optimization with Policy Adaptation using Latent Space Search"},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2311.13569."}