{"as_of":"2026-08-22T01:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ffeea86b83d2f89aa2d5c186741243671b16831c7f5d6a16afd32f2a7f633cb9","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-21T06:32:19.484+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-11T05:45:35.297390Z","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-11T05:45:35.402357Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.02689","last_updated":"2024-02-05T02:36:54Z","snapshot_observed_at":"2026-08-20T07:49:39.630322Z","submitted_at":"2023-06-05T08:29:55Z","title":"Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context","version":3},"cited_work":{"arxiv_id":"2306.02689","doi":null,"metadata_source":"pith","pith_arxiv_id":"2306.02689","snapshot_observed_at":"2026-08-11T05:45:35.402357Z","title":"Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context","venue":"cs.LG","work_id":"515f699b-7b90-4baf-83cf-ace573730199","year":2023},"citing_paper":{"arxiv_id":"2412.17252","last_updated":"2025-07-22T22:52:59Z","snapshot_observed_at":"2026-08-20T07:43:37.357485Z","submitted_at":"2024-12-23T03:50:29Z","title":"A Coalition Game for On-demand Multi-modal 3D Automated Delivery System","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T05:45:35.297390Z"},"links":{"cited_paper":"/paper/2306.02689","citing_paper":"/paper/2412.17252"},"observation_digest":"sha256:07075ea098500e1fcd012d5c948b6985fe93afd25684dd84a942ffe0e4e6dff5","observation_id":"be04fff6-c9ee-4a4c-8606-8751e90365d8","resolution":{"observed_at":"2026-08-11T05:45:35.409386Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.02689/citation-record","integrity":"/paper/2306.02689/integrity","json":"/paper/2306.02689/citation-record.json","paper":"/paper/2306.02689"},"outbound":[],"paper":{"arxiv_id":"2306.02689","last_updated":"2024-02-05T02:36:54Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T07:49:39.630322Z","submitted_at":"2023-06-05T08:29:55Z","title":"Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context"},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2306.02689."}