{"as_of":"2026-08-23T14:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e91726e9850165a428bc92b505ff8c2920fc73a9c16398d0cd3fdd5708038149","coverage":[{"denominator":2,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T10:34:38.592458Z","state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.28692/citation-record","integrity":"/paper/2605.28692/integrity","json":"/paper/2605.28692/citation-record.json","paper":"/paper/2605.28692"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T10:34:38.592458Z","title":"Boland N, Dethridge J, Dumitrescu I (2006) Accelerated label setting algorithms for the elementary resource constrained shortest path problem.Operations Research Letters34(1):58–68","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2605.28692","last_updated":"2026-05-27T16:19:59Z","snapshot_observed_at":"2026-08-04T06:19:09.857159Z","submitted_at":"2026-05-27T16:19:59Z","title":"Adaptive Partitioning in Column Generation for Nested Paths","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T10:34:38.592458Z"},"links":{"citing_paper":"/paper/2605.28692"},"observation_digest":"sha256:e1dcdba09380d390389d9e3ac6338484d5394f2e8064f8479f9d756115afad2e","observation_id":"5646571a-a095-4132-b180-12d13f17cf15","resolution":{"observed_at":"2026-06-29T10:34:38.592458Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2407.02640","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T13:13:28.461320Z","title":"Irnich S (2008) Resource extension functions: Properties, inversion, and generalization to segments.OR Spectrum30(1):113–148","venue":null,"work_id":"7807ac8e-2e9b-40bc-8f70-2219345acd71","year":2005},"citing_paper":{"arxiv_id":"2605.28692","last_updated":"2026-05-27T16:19:59Z","snapshot_observed_at":"2026-08-04T06:19:09.857159Z","submitted_at":"2026-05-27T16:19:59Z","title":"Adaptive Partitioning in Column Generation for Nested Paths","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T10:34:38.592458Z"},"links":{"citing_paper":"/paper/2605.28692"},"observation_digest":"sha256:d268a58cd91cd1a8e8dfb0e88b824b2b5fe065fc5e09b1f371eb7a2ad1309022","observation_id":"c286af8a-167c-4906-b5d3-8df2d3814205","resolution":{"observed_at":"2026-06-29T13:13:28.462956Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.28692","last_updated":"2026-05-27T16:19:59Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-04T06:19:09.857159Z","submitted_at":"2026-05-27T16:19:59Z","title":"Adaptive Partitioning in Column Generation for Nested Paths"},"reference_resolution":{"displayed":2,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":2},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 2 of 2 outbound references and 0 inbound Pith citation observations for arXiv:2605.28692."}