{"as_of":"2026-08-16T22:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a81cdcff54b50ef3d8b6372b89502f490300576a1953fce948acfed8efad0e7d","coverage":[{"denominator":18,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:04:20.946324Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"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.02031/citation-record","integrity":"/paper/1908.02031/integrity","json":"/paper/1908.02031/citation-record.json","paper":"/paper/1908.02031"},"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-14T15:04:21.187810Z","title":"SCIP: Solving constraint integer program s","venue":null,"work_id":"31087246-cf85-4d67-b51d-e7a33dd3d158","year":2009},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.874502Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:cc47df543516288018508a2880ceed6b9960d2fa72930f063f9e21c8fccdb3ec","observation_id":"e43abf07-4120-4e61-94b0-87bb3ff4389c","resolution":{"observed_at":"2026-08-14T15:04:21.191329Z","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-14T15:04:21.174901Z","title":"An improved hybrid al gorithm for the set covering problem","venue":null,"work_id":"7cc92834-f324-43c2-b11e-2a4eed55db14","year":2015},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.878927Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:4c372e680fc3c8b8f614d659d87910d05abdb39613979f20b72c596ffaeefebb","observation_id":"fc9656ab-4bd0-437f-bb7a-7bc324c50370","resolution":{"observed_at":"2026-08-14T15:04:21.179929Z","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-14T15:04:21.162936Z","title":"Shortest path network interdiction with asymmetric information","venue":null,"work_id":"12c85c30-9e8a-4cec-863f-71ac22ca3d27","year":2008},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.882880Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:7d4132174f60130ececc8aa50f18cab54061de52d5b5b9b6ee269880e518edaf","observation_id":"d53f976b-ff8f-41be-8ce8-2045772a0507","resolution":{"observed_at":"2026-08-14T15:04:21.166687Z","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-14T15:04:21.152477Z","title":"An algorithm for set covering problem","venue":null,"work_id":"861e391f-5961-4fab-b8e0-cc8a9f07bcf0","year":1987},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.886703Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:41bbf8c48d6b1040befd122fa558d978de017378cf8094030d886b1bce6a3e1f","observation_id":"d22593ca-e634-4385-849c-63aff17db775","resolution":{"observed_at":"2026-08-14T15:04:21.155386Z","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-14T15:04:21.142711Z","title":"OR-Library: distributing test problems by e lectronic mail","venue":null,"work_id":"e5225f5f-abef-402b-81a3-79c34c8031a0","year":1990},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.890392Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:a9576341392f5da40d7b872f3f23316281f47ce5f9556afbd8a08e76fc9d2f98","observation_id":"cd2b34ed-db35-4913-b873-61eee1a429f2","resolution":{"observed_at":"2026-08-14T15:04:21.145909Z","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-14T15:04:21.132380Z","title":"An algorithm for the resource constrained shortest path prob- lem","venue":null,"work_id":"f5f0d448-bca6-496c-9d7a-adfd21eeefad","year":1989},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.894235Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:9c2ad6fe89e0a01a2f5f0ca6c576e345aa809cc548a73a54e4e102813ea716d3","observation_id":"3fe7c0eb-6b2a-40cd-bda7-7e308792e2e8","resolution":{"observed_at":"2026-08-14T15:04:21.136084Z","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-14T15:04:21.120155Z","title":"A genetic algorithm for the set coveri ng problem","venue":null,"work_id":"91ff2c7b-04ef-40c0-9c39-bf72fe6ce40e","year":1996},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.901267Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:490695900ce6c133ff2330a9653fd1a4e227c42ecc728605ed9b6abadc29704a","observation_id":"ca5cbfd5-ecbe-42f2-9f25-a20e0bb55277","resolution":{"observed_at":"2026-08-14T15:04:21.124813Z","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-14T15:04:21.108229Z","title":"Enhancing an algorithm for set co vering problems","venue":null,"work_id":"5aee4379-2439-47bc-9651-1d7339c59e1d","year":1992},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.905047Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:0a2454dbb5c38d27ec3432de058d41243443e258f296cfe1fc59bc1382635181","observation_id":"cbf7ea8c-cec3-4637-be4b-4800c93802eb","resolution":{"observed_at":"2026-08-14T15:04:21.112210Z","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-14T15:04:21.096887Z","title":"A heuristic method for the set covering problem","venue":null,"work_id":"ad169795-4de4-47fd-a2a3-96fd7a7b7366","year":1999},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.910609Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:75704d2adc9ec4e4470864ca6893cec9305d67b44cac18b524762b85529134ef","observation_id":"ea8690df-de7c-49c4-8b3f-5faf21a3299e","resolution":{"observed_at":"2026-08-14T15:04:21.100807Z","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-14T15:04:21.084722Z","title":"Algorithms for the set co vering problem","venue":null,"work_id":"23006509-aa02-401d-b032-0cf91f254a33","year":2000},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.914730Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:34e1f5ab92aace7183e5db58dcf6dac49fe983c0c4dc2b3b69580622ac9e7cd2","observation_id":"8926348b-e93b-4dc9-af83-868ed9cec616","resolution":{"observed_at":"2026-08-14T15:04:21.088957Z","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-14T15:04:21.073236Z","title":"An overview of bilevel op timization","venue":null,"work_id":"2744f0fb-b40c-4732-9d33-19f80c6bbd60","year":2007},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.918930Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:358a44bf8f72feea14142064c6dea6161e6b5fdf954b21358856e40c0466a67e","observation_id":"27c170cc-6810-4ee1-a4b9-ae298e4fe550","resolution":{"observed_at":"2026-08-14T15:04:21.076869Z","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-14T15:04:21.061654Z","title":"Annotated bibliography on bilevel programmin g and mathematical programs with equilibrium constraints","venue":null,"work_id":"6ace24bf-15b7-47a7-a442-60dabc67eccd","year":2003},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.922822Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:57ce8d152b5b446d182b148423254f66f9fb9781cee392b18b1e1aaa1fe028e3","observation_id":"9b063b1b-1c1c-4053-8d92-b74c79793618","resolution":{"observed_at":"2026-08-14T15:04:21.065829Z","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-14T15:04:21.050474Z","title":"Shortest-path network interdictio n","venue":null,"work_id":"cdb35bd8-627b-41f6-9199-860935be320e","year":2002},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.926930Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:d2ef39d4f77429a753493e6b40c08f4a17f3bcf8f930adc4101d139848b65243","observation_id":"18f69383-82c2-4351-8b1c-bd69c2f84895","resolution":{"observed_at":"2026-08-14T15:04:21.053919Z","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":"10.1155/201","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T15:04:20.982958Z","title":"Bilevel programming and applications","venue":null,"work_id":"3173d904-65f5-4ea2-a23b-8db801249b3d","year":2015},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.930967Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:917660059aea280db09fdc478706e35e6bbd5cf4682c44b22ba220a397966be4","observation_id":"164469eb-de7b-483d-9e7d-6817a07be4ba","resolution":{"observed_at":"2026-08-14T15:04:20.988936Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"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-14T15:04:21.039755Z","title":"An effective and simple he uristic for the set covering problem","venue":null,"work_id":"232a2f40-3fd9-4f36-bbba-f18324f7a33d","year":2007},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.935249Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:63571f081300d9de06c354464fc57a299e09f0caf758fe6a54e978edd4afa73e","observation_id":"76875433-c96d-4352-b518-d0c73ef12047","resolution":{"observed_at":"2026-08-14T15:04:21.043303Z","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-14T15:04:21.028351Z","title":"A bi-objective approach for shortest-path network inter- diction","venue":null,"work_id":"e39b8028-c0a6-4921-8455-a603176a2c81","year":2010},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.938924Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:a382455ec9a086b51904f117e9d8af53c309e2d5f357e9f1eacbf05389a53e79","observation_id":"aaa34e8b-e6d7-4345-85c2-4251eb3c6372","resolution":{"observed_at":"2026-08-14T15:04:21.032114Z","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-14T15:04:21.015138Z","title":"Available from http://scip.zib.de/ Last accessed February 16 2020","venue":null,"work_id":"78b7c0a5-c934-4b22-91ab-6c4cb3797400","year":2020},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.942524Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:e4bc6c14dfea0c28c59865efdd91900dd02a3e931a7991fd82eb80bf8bb69f2c","observation_id":"0454e402-0310-42bc-9fd1-2215bd06132c","resolution":{"observed_at":"2026-08-14T15:04:21.019193Z","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-14T15:04:21.001003Z","title":"Bilevel and multilevel program ming: a bibliography review","venue":null,"work_id":"2450b403-9cf6-4c7c-91e2-4f4c629bee5a","year":1994},"citing_paper":{"arxiv_id":"1908.02031","last_updated":"2023-10-24T05:48:05Z","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems","version":5},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:04:20.946324Z"},"links":{"citing_paper":"/paper/1908.02031"},"observation_digest":"sha256:f46a8d755597efc25ed91fcc09c7b7824cc670cee457af3f3baf576e5e3ca27e","observation_id":"a7b94f28-e29c-4d8d-83ff-444fbbfcbe68","resolution":{"observed_at":"2026-08-14T15:04:21.006675Z","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.02031","last_updated":"2023-10-24T05:48:05Z","latest_version":5,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T10:57:22.208340Z","submitted_at":"2019-08-06T09:12:45Z","title":"An algorithm for the optimal solution of variable knockout problems"},"reference_resolution":{"displayed":18,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":17},"total_outbound_references":18},"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 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:1908.02031."}