{"as_of":"2026-08-16T14:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b78d176c62ea2e0f1d46e52c24d1bd81492c01cf696658b9f14226b6ace63d99","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T12:41:36.183528Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"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.06795/citation-record","integrity":"/paper/1908.06795/integrity","json":"/paper/1908.06795/citation-record.json","paper":"/paper/1908.06795"},"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-14T12:41:38.085118Z","title":"Abu-Khzam, Michael R","venue":null,"work_id":"e79c8282-fa46-4b99-ac16-c56289a1685a","year":2007},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.849023Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:85b58b04b5f5944d20d669ef25babdb69424943b4c7203a287f72bde0109aa88","observation_id":"fb7e62ae-7634-4a8d-8122-85896bd49048","resolution":{"observed_at":"2026-08-14T12:41:38.091905Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:35.856169Z","title":"Akiba and Y","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.856169Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:925710a2764e6943fa2c942d902b30f94b9a8f35de8b0c50c95318fd1fefce66","observation_id":"44e2a7ce-dfd0-4b23-8c1f-816267bfed2f","resolution":{"observed_at":"2026-08-14T12:41:35.856169Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:35.865289Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.865289Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:e2fe8ab019fda2ef78e4eb65a0f6ccd12020817fd1672f92ab472082d8d884e5","observation_id":"89ae6c80-8761-4c4b-b9a5-e7becc9af0c9","resolution":{"observed_at":"2026-08-14T12:41:35.865289Z","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":null,"doi":"10.1007/s10878-012-9592-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.716802Z","title":"Batsyn, B","venue":null,"work_id":"de3953bd-f017-4c16-bf99-9390820219dc","year":2014},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.874014Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:fa5ce56ae68430af897ca0c8a3d4e71aac9843b0c880776b6f90b25a3ed09095","observation_id":"cb36044f-ba93-4824-b014-31f735a9e338","resolution":{"observed_at":"2026-08-14T12:41:36.725455Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:35.881323Z","title":"Butenko, P","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.881323Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:ab5268708a1602bbc42060b4f7b656119614aab7adada7a31f85eb4c25eab42a","observation_id":"7214723d-45c2-4442-a1cf-7daf1942c078","resolution":{"observed_at":"2026-08-14T12:41:35.881323Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:35.889464Z","title":"Butenko and S","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.889464Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:0d23fd72bdb243fb4b77b188c2a8fe594ff4fe2105a7e4202e9255a1fd420bfd","observation_id":"998d724e-5470-476c-b460-57b32be7a3b5","resolution":{"observed_at":"2026-08-14T12:41:35.889464Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:35.897098Z","title":"Estimating the size of correcting codes using extremal graph prob- lems","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.897098Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:a767c0f6614057581d3dc484943d2f3e64cdbdcff37346ee1748fa372a06bca3","observation_id":"2bed23be-9540-410d-9a20-8ba63bd2ec3a","resolution":{"observed_at":"2026-08-14T12:41:35.897098Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:35.903310Z","title":"Efficient maximum clique computation over large sparse graphs","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.903310Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:24af37daeeaef10702bd8cc4a5788769fde9496422c902a55a0da607cc6af9ec","observation_id":"06694f3a-898b-4c74-adf0-d701a4402601","resolution":{"observed_at":"2026-08-14T12:41:35.903310Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:35.909067Z","title":"Computing a near-maximum independent set in linear time by reducing-peeling","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.909067Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:e2fabf75a095cd33f5751506f1f84e37d6c47299a6c130e74257368144901c49","observation_id":"d298db75-2ae5-4a9f-93fb-cf26b3241e24","resolution":{"observed_at":"2026-08-14T12:41:35.909067Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:35.915275Z","title":"Kanj, and Weijia Jia","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.915275Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:50934f86f7fee2385f93b2c94eb4ce8424ee464a5a60aa64e679ceb2f9c4f392","observation_id":"8401c5e9-ce2f-47f0-8450-e34dcabec75d","resolution":{"observed_at":"2026-08-14T12:41:35.915275Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:35.920430Z","title":"Kanj, and Ge Xia","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.920430Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:b8e4fddc6868b193e11711f3f993b5cf4de314f2ceaaf95b038d97081e9d5357","observation_id":"6dd2483f-fd11-4f29-a9f0-8ca3af6eab45","resolution":{"observed_at":"2026-08-14T12:41:35.920430Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:38.062839Z","title":null,"venue":null,"work_id":"1543d6f4-429e-4e5f-b112-b6368a074f60","year":null},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.925695Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:b0ac85dba1df5b1ed4a6a4374dabc90b782c4f5791768fe258b9ce005d6cdcf3","observation_id":"f7ba4964-0e0f-488f-9342-496b91196ae7","resolution":{"observed_at":"2026-08-14T12:41:38.071475Z","resolver_source":"raw_fallback","status":"unresolved"},"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.1007/978-3-540-30559-0_22","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.596146Z","title":"Lin- ear kernels in linear time, or how to save k colors in o(n2) steps","venue":null,"work_id":"7d6ec033-0be8-4444-8cf4-ec9269df3e43","year":2005},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.936750Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:06295dbb98de60d5e7d62c087157591259fd85f403ce6b0996457773b8242c2a","observation_id":"ed748a0f-d789-490c-a91e-01ee1b12f793","resolution":{"observed_at":"2026-08-14T12:41:36.604055Z","resolver_source":"doi","status":"verified_exact"},"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.1007/978-3-319-38851-9_9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.571545Z","title":null,"venue":null,"work_id":"1261faff-934f-4324-8e92-08d8f876be9b","year":2016},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.942955Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:79d19fa7edbd173dce96d2973ea23f4897556b40209d973a0eb719af94e37ce1","observation_id":"8102dd77-5c13-479a-8827-3065e3271d7f","resolution":{"observed_at":"2026-08-14T12:41:36.578658Z","resolver_source":"doi","status":"verified_exact"},"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-14T12:41:38.035225Z","title":"Fellows, Lars Jaffke, Aliz Izabella Király, Frances A","venue":null,"work_id":"72b095fe-cc10-484b-af6f-c86843c6e4e5","year":2018},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.949322Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:c72a7b5d634dba9b21062dfde3c2d2ac74f8e20792dbc5b48998711bfdcae1c7","observation_id":"6309f5eb-c877-4da9-9a62-230c02d318d6","resolution":{"observed_at":"2026-08-14T12:41:38.043697Z","resolver_source":"raw_fallback","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-14T12:41:38.006042Z","title":"A measure & conquer approach for the analy- sis of exact algorithms.Journal of the ACM, 56(5):25,","venue":null,"work_id":"3f5abde8-d20f-4215-af9f-02988c14d292","year":null},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.954553Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:87d866d6bf1a3e7445795a2fba094bca2f571d605e3d05e2b7529b0c6c8a246f","observation_id":"5a0a2acf-0c5c-4c41-9b7f-5f1554e7a21a","resolution":{"observed_at":"2026-08-14T12:41:38.013000Z","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-14T12:41:37.985318Z","title":"Fomin and D","venue":null,"work_id":"7ff5d331-f8a0-4c77-8358-75ad2c903688","year":2010},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.965381Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:d98ff8233749487e403e9f03c3e38e1659ca5d1e53387e40cc45813753e46ec2","observation_id":"3f7b7492-a225-49f4-8e9e-67715e313e47","resolution":{"observed_at":"2026-08-14T12:41:37.991032Z","resolver_source":"raw_fallback","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":"10.1021/ci990262o","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.547289Z","title":"Gardiner, , Peter Willett, and Peter J","venue":null,"work_id":"32b6dccb-a4ac-497c-8be3-423b85367388","year":2000},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.970882Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:60f87d83471aeab222c2e3a89abdca1e32e2210d30fa8cd926a799c2a3de694e","observation_id":"ef900a08-47aa-4e8a-a0c7-d44fb4504f2f","resolution":{"observed_at":"2026-08-14T12:41:36.555761Z","resolver_source":"doi","status":"verified_exact"},"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.1007/978-3-642-45030-3_39","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.521528Z","title":"Gemsa, B","venue":null,"work_id":"8dfaeec1-f32d-41bc-9dc2-bd07194d74a0","year":2013},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.977623Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:c438e2020698caceb5d37c04ddd3367c1610494169f83cf0f392f82c4161fefc","observation_id":"ea6c94bc-65e9-46ff-a310-299debe75d29","resolution":{"observed_at":"2026-08-14T12:41:36.529394Z","resolver_source":"doi","status":"verified_exact"},"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-14T12:41:37.964550Z","title":"Gottlieb, A","venue":null,"work_id":"d335685a-ba6a-42fb-9b6e-8aafcb588942","year":null},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.983919Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:3195c1319b33b2eb7d7185a8eb40012f75cf58ae9c79639899fc7d6721f2624f","observation_id":"495afa55-0f4d-48f8-9e8e-5d294700181b","resolution":{"observed_at":"2026-08-14T12:41:37.972755Z","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-14T12:41:37.939070Z","title":"Harary and I","venue":null,"work_id":"0bdf6fd9-252e-4598-bdef-f6e86a3fccbe","year":1957},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.995445Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:069f3c24447ac7d9a48d563e2892e0680381346a7230e57dc41906ee9eb238f5","observation_id":"9f4760bf-08fc-42f0-b789-4778983937f4","resolution":{"observed_at":"2026-08-14T12:41:37.945935Z","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.1137/1.9781611975055.19","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.489136Z","title":"Hespe, C","venue":null,"work_id":"d4fdaaf1-e2dc-4119-8733-c1bd20854ace","year":2018},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.001481Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:b7e271019b69a04b631155d32e339ed10b6973295faf674b7d1e003a581b9178","observation_id":"269df79b-e000-4b40-9b44-e9bb28acad28","resolution":{"observed_at":"2026-08-14T12:41:36.501931Z","resolver_source":"doi","status":"verified_exact"},"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.5281/zenodo.2816116","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.456093Z","title":"WeGotYouCovered, May 2019","venue":null,"work_id":"3baf867d-b98b-4117-b4d8-042df264a824","year":2019},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.008022Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:7b3b3af229a933ebb4f47897eaed3eeaedca8298e0a12ea91e3e93b413ef8ba6","observation_id":"c9c0f40a-4ef9-4c8b-8dc9-6d2e0e83afa7","resolution":{"observed_at":"2026-08-14T12:41:36.464385Z","resolver_source":"doi","status":"verified_exact"},"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":"4074.26342","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:37.268020Z","title":"Iwata, K","venue":null,"work_id":"39432fac-2270-49e3-9261-b5642ddce5a8","year":2014},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.013765Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:d0073dd8e7def47bd57a9da1d5bc25e4a9823232df5b365fd828ba3f25a81e8e","observation_id":"56ec6450-5d14-4504-ada8-a99fb768344a","resolution":{"observed_at":"2026-08-14T12:41:37.280590Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.020176Z","title":"A Fine-grained Analysis of a Simple Indepen- dent Set Algorithm","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.020176Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:91af7a37ae3b4a8d5124e58b4097db0b1b7fd1ba3bbb7c673fbeb22691f0f5e6","observation_id":"5ea1585d-a2d4-4a0b-a96a-fd03634f6ffb","resolution":{"observed_at":"2026-08-14T12:41:36.020176Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:37.917746Z","title":null,"venue":null,"work_id":"977cac69-8f5c-4a72-a40b-0068b16bbf31","year":2007},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.026136Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:6dcc2be5031836a26284e7280d1e10221eb863f41eca685331199dc3c100f0db","observation_id":"b2979069-0d00-4319-9913-c90d4e875d54","resolution":{"observed_at":"2026-08-14T12:41:37.923631Z","resolver_source":"raw_fallback","status":"unresolved"},"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-14T12:41:37.897765Z","title":null,"venue":null,"work_id":"f92c04fb-7fbc-4ba7-883b-fd172e71acb8","year":2013},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.032747Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:7f417b0386e7f8add028e6fed97c8ae179a8abcfe525122701dc0bc10f1841db","observation_id":"0ca7020a-0f60-4539-9f4f-f32b0e2f6536","resolution":{"observed_at":"2026-08-14T12:41:37.903828Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.037964Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.037964Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:c65e6dce7fda20fecc8445858553a7ca97156b5c394592da827eb87eb62494d5","observation_id":"6058ea45-0dd9-4c3b-8d69-6cc1a2f980c1","resolution":{"observed_at":"2026-08-14T12:41:36.037964Z","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":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:37.874663Z","title":"An efficient branch- and-bound algorithm based on MaxSAT for the max- imum clique problem","venue":null,"work_id":"9df1fdff-1498-4766-bfe8-e2baa723932f","year":2010},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.046560Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:ce1087bd75dfe05b0d72ae3b60bb4bf9214ff3682db3ab0b650c5ae54bbfe63e","observation_id":"ccb9cb0b-18a5-4121-b5b8-d3eb19993367","resolution":{"observed_at":"2026-08-14T12:41:37.882076Z","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-14T12:41:37.822112Z","title":"Nemhauser and L","venue":null,"work_id":"4fd45913-7411-46ff-82e5-a0489598bb4c","year":1975},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.058774Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:ce73f17d0f2dc3101372839dbcb17664d1923f871f5425c52d7d63a1765ab4fd","observation_id":"a6b3a751-72a2-4a24-975f-1d9b881ee42e","resolution":{"observed_at":"2026-08-14T12:41:37.829867Z","resolver_source":"raw_fallback","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":"10.5281/zenodo.3082356","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.410213Z","title":"Peaty: an exact solver for the vertex cover problem, May 2019.doi: 10.5281/zenodo.3082356","venue":null,"work_id":"d1438315-58de-46fb-9ceb-4e98619df61a","year":2019},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.066587Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:4bc95be67c3607cdd490307549557885e01ff49e3d3ff14efea53951cdb95d27","observation_id":"abf4058c-3b61-4563-b6ab-0ccf8212e2bf","resolution":{"observed_at":"2026-08-14T12:41:36.417772Z","resolver_source":"doi","status":"verified_exact"},"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-14T12:41:37.797058Z","title":"San Segundo, F","venue":null,"work_id":"f8f6e822-037e-4582-a58c-c62167a34e93","year":null},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.072655Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:404f3db3df7f197e6f27010a0746d5f4195155e9400b18757066fce1c496bdf8","observation_id":"b828745e-719e-456c-8894-08801428b591","resolution":{"observed_at":"2026-08-14T12:41:37.804021Z","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.1016/j.cor.2010.07.019","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.358400Z","title":null,"venue":null,"work_id":"f674420b-0b9e-4d36-ab07-6b6b54837325","year":2011},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.084376Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:4ddad4292b1525f05effc2e9b49573212afe374f84255d865de1c98babe0a98a","observation_id":"4ea9cd3d-d4f7-470e-bf53-43b7254bb0ad","resolution":{"observed_at":"2026-08-14T12:41:36.364485Z","resolver_source":"doi","status":"verified_exact"},"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-14T12:41:37.772615Z","title":"Pardalos","venue":null,"work_id":"bb3e3034-1702-40b4-af67-fc48edd4a88f","year":2016},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.106678Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:f7ecd1d043bbbf5723d1d977e421b74bab827f5c0a5e8550100c35dccbac68ae","observation_id":"f98f8645-7479-4b41-a136-da61c8c6e6e8","resolution":{"observed_at":"2026-08-14T12:41:37.780159Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.115106Z","title":"Sander, Diego Nehab, Eden Chlamtac, and Hugues Hoppe","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.115106Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:ec02f65cff8021ae146db14870dfb19acd1b662f32dd07b913b5433e7353fb4b","observation_id":"22971fb3-99e8-4ab7-9a24-a5a1ab69efe5","resolution":{"observed_at":"2026-08-14T12:41:36.115106Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:37.750734Z","title":"On the power of simple reduc- tions for the maximum independent set problem","venue":null,"work_id":"a41e3966-3354-48de-9c9c-68e791fcd33f","year":2016},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.122267Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:3e92f3675ea762b9e77dcb2932cbe6cb5491af7ac51bfc53253f64e2190fef2a","observation_id":"b999a90a-dced-4261-93fc-916c362ba9df","resolution":{"observed_at":"2026-08-14T12:41:37.758320Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.128489Z","title":"Szabó and B","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.128489Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:610208bbbbb38181989b514f05005dbca1f1089d1d25b1ff51496cdfa3292714","observation_id":"a221ab4c-252b-4033-8866-044440e7f8e9","resolution":{"observed_at":"2026-08-14T12:41:36.128489Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.133782Z","title":null,"venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.133782Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:650a5ba4feb0d964059aa8f81c22838fe1dee7032990302b9d5f2f50247e95e3","observation_id":"4a25d3dc-6782-4552-96b2-18da0e1085f5","resolution":{"observed_at":"2026-08-14T12:41:36.133782Z","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":null,"doi":"10.1007/978-3-642-11440-3_18","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.316409Z","title":"Tomita, Y","venue":null,"work_id":"352a9216-944f-40a2-970e-fe6aeb55e34f","year":2010},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.140989Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:b4209acce82ef3673998ea7a4c303939ff5997a0fc36f5542f863088db1ae491","observation_id":"3e47eda6-e51c-4bf8-8257-eb223a195c61","resolution":{"observed_at":"2026-08-14T12:41:36.324041Z","resolver_source":"doi","status":"verified_exact"},"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":"2014.0618","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.954620Z","title":"Solving the maximum clique and vertex coloring prob- lems on very large sparse networks.INFORMS Jour- nal on Computing, 27(1):164–177, 2015.doi:10.1287/ ijoc.2014.0618","venue":null,"work_id":"51958786-88f7-4865-a2f2-6acae00714d6","year":2015},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.147130Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:1276e53793ff363f844cd06e1313cccf1fd779379028e1ff73d89d3a5b23a120","observation_id":"72a895d7-61ba-42c5-bc73-0c930e02561c","resolution":{"observed_at":"2026-08-14T12:41:36.966464Z","resolver_source":"raw_fallback","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-14T12:41:37.727394Z","title":"Wu and J","venue":null,"work_id":"fdb06fb4-8051-4627-97b7-e5ae72c33ce3","year":2015},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.152861Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:8f72a1f2bc81e758f3755d2e376a52e632a8554570ecd7743e067504e9e0c4bc","observation_id":"86781bcf-fc2c-49fb-8290-687e0c55b790","resolution":{"observed_at":"2026-08-14T12:41:37.736571Z","resolver_source":"raw_fallback","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.158769Z","title":"Xiang, C","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.158769Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:d1d46079ceb3cba49d4e7c30817ff682c38ccbbe94112d718651b10bcd71b5ae","observation_id":"0536ce1e-53fd-47aa-b824-31ee37b8c7b2","resolution":{"observed_at":"2026-08-14T12:41:36.158769Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.164033Z","title":"Xiao and H","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.164033Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:7b223e78cbb3abd840719770e29e82fc1bfd4879c756afcdc50a39822add769b","observation_id":"c5a34b52-42a7-4e6f-a27e-04f248be9dd3","resolution":{"observed_at":"2026-08-14T12:41:36.164033Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.170083Z","title":"Exact algo- rithms for maximum independent set.Information and Computation, 255:126–146, 2017.doi:10.1016/j.ic","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.170083Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:1a95c40d7d3f629021815ac3910b2f61b75705d2a8c3f4a9439b565ac07e3100","observation_id":"18a289cc-506d-4d19-a8c6-e5351f931d0c","resolution":{"observed_at":"2026-08-14T12:41:36.170083Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:37.702401Z","title":null,"venue":null,"work_id":"a2be0e31-90b1-4a26-9583-2a784151d44b","year":1997},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.177781Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:22b27602da6e1d7ceb280a810a6b7aa3c6b3558df8b06100e647013e0d05e74a","observation_id":"087e8099-7332-43c8-9894-47e6c0e6cab1","resolution":{"observed_at":"2026-08-14T12:41:37.708631Z","resolver_source":"raw_fallback","status":"unresolved"},"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.5281/zenodo.3228802","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.234843Z","title":"zbogdan/pace-2019 a, May 2019","venue":null,"work_id":"0b624539-131a-404f-8f91-99702d4dec87","year":2019},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.183528Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:3f55ea8e6737b05a6c68685a4afad5ac0ba9a510efc5700e8d1b702af6005ff1","observation_id":"ce7c015a-bdf6-44fd-b840-f94304b8a42c","resolution":{"observed_at":"2026-08-14T12:41:36.245550Z","resolver_source":"doi","status":"verified_exact"},"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.1371/journal.pcbi.1000135","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.618168Z","title":null,"venue":null,"work_id":"fa59732e-90c9-480e-a122-c775ca296636","year":null},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.930751Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:7a41fdd1c21f8340ce34d2b6bdfae84411c2198af08832262d4c2c488d67c8cb","observation_id":"70b12210-b7bf-4906-bca1-09030c9d0997","resolution":{"observed_at":"2026-08-14T12:41:36.624286Z","resolver_source":"doi","status":"verified_exact"},"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":"2285.15522","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:37.424786Z","title":null,"venue":null,"work_id":"86a413c4-6108-4825-b979-10327969951f","year":null},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.960083Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:d56f85418e3a5a2e5100e9c8c158b80f8a07ce5415460e4ab62238637e4eaf1e","observation_id":"6d81545e-af33-4d58-93dc-e5816d633645","resolution":{"observed_at":"2026-08-14T12:41:37.439949Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-14T12:41:37.855742Z","title":null,"venue":null,"work_id":"ebd6fe3c-0768-4e2a-865c-cc824ec5d428","year":null},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.052691Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:4b257aac1a0817bb1d29fe37fbff58717642142d288cfc5b4a1c283f3ded7251","observation_id":"59c7d74c-bc75-499c-bbc1-8ae1571efbcc","resolution":{"observed_at":"2026-08-14T12:41:37.862175Z","resolver_source":"raw_fallback","status":"unresolved"},"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.1007/s11590-011-0431-y","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:36.385428Z","title":null,"venue":null,"work_id":"554554cb-201e-487d-8c3e-41ec5a442e24","year":null},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:36.078027Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:1a18bd24d4f22ef1fe98f0e83fc02d4ed1d31486059efc3791e394bdfcb74953","observation_id":"60753b34-2ac8-4215-9d13-6507b4fe13d3","resolution":{"observed_at":"2026-08-14T12:41:36.393197Z","resolver_source":"doi","status":"verified_exact"},"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":"2014.23398","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T12:41:37.344994Z","title":null,"venue":null,"work_id":"117971c0-e547-4cf3-b0c4-d917059ee2ac","year":2014},"citing_paper":{"arxiv_id":"1908.06795","last_updated":"2019-08-20T07:54:58Z","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track","version":2},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T12:41:35.989603Z"},"links":{"citing_paper":"/paper/1908.06795"},"observation_digest":"sha256:adb2e1a962db0ae4b8bf43e787bbcb0d9c379a7be2199cc3d89f87f29b623dcb","observation_id":"b0e8f87f-874c-4ac8-83a4-cfcba46a3c32","resolution":{"observed_at":"2026-08-14T12:41:37.353897Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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.06795","last_updated":"2019-08-20T07:54:58Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T12:32:24.750756Z","submitted_at":"2019-08-19T13:34:15Z","title":"WeGotYouCovered: The Winning Solver from the PACE 2019 Implementation Challenge, Vertex Cover Track"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":14,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":16,"verified_exact":13,"verified_fuzzy":5},"total_outbound_references":51},"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 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:1908.06795."}