{"as_of":"2026-08-16T14:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1374bbd52ca38fc1d8f7b715b5f9f2fe185933b8bf0e08cac35cdf8074a54b6a","coverage":[{"denominator":5,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:28:21.735432Z","state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.05082/citation-record","integrity":"/paper/1908.05082/integrity","json":"/paper/1908.05082/citation-record.json","paper":"/paper/1908.05082"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:28:21.809180Z","title":"Aissi, C","venue":null,"work_id":"63773b60-8632-41cd-a473-cc3ffc913999","year":2009},"citing_paper":{"arxiv_id":"1908.05082","last_updated":"2019-08-14T11:46:37Z","snapshot_observed_at":"2026-08-14T13:21:56.441248Z","submitted_at":"2019-08-14T11:46:37Z","title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:28:21.719455Z"},"links":{"citing_paper":"/paper/1908.05082"},"observation_digest":"sha256:01f01f61ac6c8e84a5836e4c7fa76e9abeb6f94a235d302d70ce5dce2be84d40","observation_id":"bdb6945b-2350-45b5-8633-659255d88c2a","resolution":{"observed_at":"2026-08-14T13:28:21.812563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:28:21.797108Z","title":"A scenario based heuristic for the robust shortest path tree problem","venue":null,"work_id":"15dd893e-81ea-4bde-88f1-0ad5de95240d","year":2016},"citing_paper":{"arxiv_id":"1908.05082","last_updated":"2019-08-14T11:46:37Z","snapshot_observed_at":"2026-08-14T13:21:56.441248Z","submitted_at":"2019-08-14T11:46:37Z","title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:28:21.723710Z"},"links":{"citing_paper":"/paper/1908.05082"},"observation_digest":"sha256:21d8fb13e981a407cc2c78a65992cd9e88e9f2e4a461134a87fa03f72d0896e1","observation_id":"4691d85f-b67a-4141-bb54-06e31dca7a2d","resolution":{"observed_at":"2026-08-14T13:28:21.802227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:28:21.786434Z","title":"Senario-based heuristics with path-relinking for the robust set covering problem","venue":null,"work_id":"5cf00347-9c0f-4601-824b-0cbcce364bbf","year":2015},"citing_paper":{"arxiv_id":"1908.05082","last_updated":"2019-08-14T11:46:37Z","snapshot_observed_at":"2026-08-14T13:21:56.441248Z","submitted_at":"2019-08-14T11:46:37Z","title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:28:21.727310Z"},"links":{"citing_paper":"/paper/1908.05082"},"observation_digest":"sha256:a95c8cdf54627271f91baa1f2a25d78020c6ec9905b692b762de420eeb54009e","observation_id":"6b0c2d86-ba3b-40c2-a361-22042b597d90","resolution":{"observed_at":"2026-08-14T13:28:21.790411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:28:21.774678Z","title":"An approximation a lgorithm for interval data minmax regret combinatorial optimization problems","venue":null,"work_id":"22374d57-afbd-49fd-ab17-5ddd05aef8a8","year":2006},"citing_paper":{"arxiv_id":"1908.05082","last_updated":"2019-08-14T11:46:37Z","snapshot_observed_at":"2026-08-14T13:21:56.441248Z","submitted_at":"2019-08-14T11:46:37Z","title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:28:21.731174Z"},"links":{"citing_paper":"/paper/1908.05082"},"observation_digest":"sha256:41e57f2e1293ad1e50348d451f29f86cf56570c9579e1c7e370adc240dd92fb6","observation_id":"2936f32a-a3e0-4883-b663-04fb67114bf3","resolution":{"observed_at":"2026-08-14T13:28:21.778582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:28:21.761358Z","title":"The robu st shortest path problem with interval data via benders decomposition","venue":null,"work_id":"e19c33f7-0290-4252-a522-a700585ab2fb","year":2005},"citing_paper":{"arxiv_id":"1908.05082","last_updated":"2019-08-14T11:46:37Z","snapshot_observed_at":"2026-08-14T13:21:56.441248Z","submitted_at":"2019-08-14T11:46:37Z","title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:28:21.735432Z"},"links":{"citing_paper":"/paper/1908.05082"},"observation_digest":"sha256:3374ce0b8fa0ccef5cfb045ea6ed88f7cfb87ab900a78deef8bcd27c0bd6a10f","observation_id":"b9807ab4-1e17-429b-9c15-2f39fc266511","resolution":{"observed_at":"2026-08-14T13:28:21.767125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.05082","last_updated":"2019-08-14T11:46:37Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T13:21:56.441248Z","submitted_at":"2019-08-14T11:46:37Z","title":"Algorithms the min-max regret 0-1 Integer Linear Programming Problem with Interval Data"},"reference_resolution":{"displayed":5,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":5},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 5 of 5 outbound references and 0 inbound Pith citation observations for arXiv:1908.05082."}