{"as_of":"2026-08-19T07:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4eca73815d2b0c9d87bb462e5cdc8b657be4ccea4e20b0d56e673416da0d6082","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T14:46:57.111998Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2608.04446/citation-record","integrity":"/paper/2608.04446/integrity","json":"/paper/2608.04446/citation-record.json","paper":"/paper/2608.04446"},"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-15T14:46:57.655298Z","title":"Learning what to defer for maximum independent sets","venue":null,"work_id":"90bb657b-f01d-4954-a3c9-84809e6698d1","year":2020},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:56.958339Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:42d9741f783ea9a9b9db28c5c82aa6a6183c236403010f56f5b853db881b9a6b","observation_id":"df3f6ca5-e96d-4629-b09d-56ea91d8a9bf","resolution":{"observed_at":"2026-08-15T14:46:57.660181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.592746Z","title":"Bodlaender, ´Edouard Bon- net, Lars Jaffke, Du ˇsan Knop, Paloma T","venue":null,"work_id":"f3dd1072-8533-4725-8370-7377451925df","year":2023},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:56.978643Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:d76b2d5da1411c23b8ff46535d732d2f4b87ad19caca217d12100932b9382932","observation_id":"6eab11b8-749a-479a-b4b0-c9850f28da8f","resolution":{"observed_at":"2026-08-15T14:46:57.597617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.543606Z","title":"The monadic second- order logic of graphs","venue":null,"work_id":"0f81f8a3-7e70-4868-9464-17c96c517bfb","year":1990},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:56.993566Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:c82bb96fba531e0f35b37155a568461ac88e3a21805b4ba6a27c05db1d2cadad","observation_id":"c97e0aff-a53e-40cd-a2f2-c16feec0ec81","resolution":{"observed_at":"2026-08-15T14:46:57.548596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.495982Z","title":null,"venue":null,"work_id":"66145f30-3ec3-4c3d-be19-e0632756b726","year":2013},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.006591Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:d199e705c0cc92a3c2fc89bfeddbde0b7425d22399b73f66a5ec19af7c3d460e","observation_id":"01971c1e-4886-4ec6-a5e0-b194a1119356","resolution":{"observed_at":"2026-08-15T14:46:57.500444Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.403109Z","title":null,"venue":null,"work_id":"57c345a9-00d8-44df-90e8-719aff4ec981","year":2021},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.036510Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:7dfb1cf75d7f465ce528668680488a8b4f1e5d92b7c7d5cb8e4fd2967dc6de5a","observation_id":"84844a9f-49a4-4104-95e1-412e045694d9","resolution":{"observed_at":"2026-08-15T14:46:57.407606Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.387272Z","title":"Parameterized approxima- tion schemes using graph widths","venue":null,"work_id":"d0a21412-fb7d-403e-990c-c5b6bb04e61b","year":2013},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.047572Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:7daa6bdd9c808694b0b870864506c50fffb5dd04841346a88750bd66cbdef096","observation_id":"15f9d40c-c429-4172-bb62-5811a4f85155","resolution":{"observed_at":"2026-08-15T14:46:57.392311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.371846Z","title":"Lewis and Mihalis Yannakakis","venue":null,"work_id":"516fb9e7-f8f9-40f2-bbea-65a77947d5ec","year":1980},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.052431Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:65b235c7fe1f13de76b385d4ea78e6d0dd8ae155a1dd851e1f6b3d448903737c","observation_id":"6d282548-5a00-41b1-93a0-9a6f29d4db1a","resolution":{"observed_at":"2026-08-15T14:46:57.376470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.337208Z","title":"Tree diet: reducing the treewidth to unlock fpt algorithms in rna bioinformatics.Algorithms for Molecular Biology : AMB, 17,","venue":null,"work_id":"9b8b0f4b-e65e-4052-94f2-d88b23065104","year":2021},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.065628Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:5959eb6a0976e9650cc2628229003eed6e06492f1799f2a1010598703c1430f9","observation_id":"47007ac2-4bdb-491d-b999-28cfd39d5971","resolution":{"observed_at":"2026-08-15T14:46:57.343307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.320681Z","title":"Benchmark for opti- mization software.http://plato","venue":null,"work_id":"b7be14be-250e-486f-a045-a5dfcc8e1138","year":2002},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.070546Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:d397b77c9293ec7859960d26d41e027d4cee5cbd512aa62f223cb6a7f2b7b9eb","observation_id":"bffa3452-62c0-41e1-b256-7aed8cee673e","resolution":{"observed_at":"2026-08-15T14:46:57.325757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.266503Z","title":null,"venue":null,"work_id":"00333ba4-3f04-45e1-a2bf-f166f8db19df","year":1984},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.085893Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:622b9fa8a5622ac44109938fe23d77ebae5097400b4893bdb2fd0fb7af124d06","observation_id":"c15722ca-bdde-4d00-a264-1868cfb96a4d","resolution":{"observed_at":"2026-08-15T14:46:57.271636Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.248021Z","title":null,"venue":null,"work_id":"6d72b764-9b89-4c07-9107-7fdd0ab5ce46","year":2021},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.090777Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:78bb4e52bc11d6c0204ac3c99f1e331440209303ea7bed6dbdd49fd4e2c3fd7c","observation_id":"cef046ed-e4eb-46bb-9573-cd819001adbd","resolution":{"observed_at":"2026-08-15T14:46:57.253304Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.08224","last_updated":"2023-12-02T21:27:23Z","snapshot_observed_at":"2026-08-16T15:54:55.637546Z","submitted_at":"2023-02-16T11:13:36Z","title":"DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.08224","snapshot_observed_at":"2026-08-15T14:46:57.095247Z","title":"Di- fusco: Graph-based diffusion solvers for combinatorial optimization.ArXiv, abs/2302.08224,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.095247Z"},"links":{"cited_paper":"/paper/2302.08224","citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:9226771250aef67464d07e4f8233c99f2dc49a2e4000385aa63659fae8083872","observation_id":"b43ce159-79a6-49e8-85dd-37b4fd947de9","resolution":{"observed_at":"2026-08-15T14:46:57.095247Z","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-15T14:46:57.229588Z","title":"Guha, and Hanjun Dai","venue":null,"work_id":"00cdc4d6-6932-42fc-a0af-165110891c74","year":2022},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.100689Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:5d455c43299d1965a17f421a3c037f9e371bf11507001e26caa5344fbb054d9f","observation_id":"8ebe983b-b6ea-4c67-a739-677a67319609","resolution":{"observed_at":"2026-08-15T14:46:57.234661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.211657Z","title":"Backdoors to typical case complexity","venue":null,"work_id":"559bc134-d28e-4b0b-8205-efb53b089185","year":2003},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.106503Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:d5e3281f75a85d416d1f3c0e57270fa39c94d5a06f361c3fffcb7e2abc8cba3f","observation_id":"f8fefc56-59b6-4371-ac8f-1cb58561695d","resolution":{"observed_at":"2026-08-15T14:46:57.216843Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.355047Z","title":"An experimental study of the treewidth of real-world graph data (extended version)","venue":null,"work_id":"f289fbba-1389-4230-bafa-898bdde71fb9","year":2019},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":1980,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.058239Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:29c9537849d4efc9f4e1b471a9715f3571e07083bca4b3d30671e2726589f8f7","observation_id":"b3e156cf-52d5-4d6a-a2db-96504fbcce96","resolution":{"observed_at":"2026-08-15T14:46:57.359975Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.464937Z","title":"Fomin, Daniel Lokshtanov, Neeldhara Misra, M","venue":null,"work_id":"3a4ba896-3949-4b0f-9f68-df00c3128598","year":2015},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":1984,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.016915Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:5559241ab2865dfe7c1afeec1865268351df18512ac587412bb51d08ca69a9af","observation_id":"e4d30722-0753-4aa8-8669-c5b553d61afc","resolution":{"observed_at":"2026-08-15T14:46:57.470350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.560185Z","title":"Inability of a graph neu- ral network heuristic to outperform greedy algorithms in solving combinatorial optimization problems.Nature Ma- chine Intelligence, 5:24–25,","venue":null,"work_id":"01301854-7e56-45eb-bf1b-89f166815049","year":2022},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":1988,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:56.989126Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:19f0d14b0a404d71d70adb1b35e27afb7337ad067307b12a97b394de0a3727bb","observation_id":"46cfc552-0746-4ed4-bb65-4627ff2bed23","resolution":{"observed_at":"2026-08-15T14:46:57.565676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.526946Z","title":"On the hardness of losing width.Theory of Computing Systems, 54:73–82,","venue":null,"work_id":"7def5dbd-5afb-42a8-86cb-24406822248c","year":2011},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:56.997986Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:b42540a874bebe5c9ca887590609f9ac84752149145fcc85ab0c09d0c70594c2","observation_id":"cfc15c5d-1ff0-49ec-8233-84a120c77473","resolution":{"observed_at":"2026-08-15T14:46:57.531929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.303891Z","title":"Mixed integer linear programming benchmark (serial codes),","venue":null,"work_id":"d9cea214-057d-41bd-9db7-bc7cd735ebc0","year":2010},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.074927Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:ce680025d3bb61e730cd7bd15ea640440ad6ad9765d250c7a6c009637cef21a6","observation_id":"0c97ce40-4be1-4385-b5e6-8a6d7d661389","resolution":{"observed_at":"2026-08-15T14:46:57.309185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.190620Z","title":"Inapproximability of treewidth and related problems.J","venue":null,"work_id":"a8a6cf6e-6295-4ae6-bf6b-cf8dd2585a6f","year":2014},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.111998Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:2d6215f4e9339cda3aa4e52cf684ee2c4d53485d60397756e4b9541d87ae5ad1","observation_id":"941f1194-e63a-47a2-bbc9-30e34254a1d4","resolution":{"observed_at":"2026-08-15T14:46:57.197988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.285745Z","title":"Latest benchmarks of optimization software","venue":null,"work_id":"ca8e6a34-5095-4610-9ac7-d1a96e31d527","year":2017},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.079610Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:cb872e3bda79b0a02970dd1b2ce84ad1e0bf6d3f174b0995259aa5a7f002a281","observation_id":"c7d276d1-5c3c-4e27-8420-c4447bd9d693","resolution":{"observed_at":"2026-08-15T14:46:57.291305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.511384Z","title":"Fomin, Lukasz Kowa- lik, Daniel Lokshtanov, D ´aniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":"e8b040f4-92ba-44e6-9f3e-03c41f0170ea","year":2020},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.002127Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:f0aa2b51ffbd62e749e22a436b9ccd9dec2794ff7625943d0c302feb090f6395","observation_id":"a823244d-b9b2-45d3-8d98-87003fb03b98","resolution":{"observed_at":"2026-08-15T14:46:57.515983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.481153Z","title":"Erdos and Alfr´ed R´enyi","venue":null,"work_id":"43a3cd82-b628-4aed-9f1e-883fc8101769","year":1984},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.011088Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:ca64c5d7759a0851835c1b1cc4e6b0cb1ff707a9d942b74a31eb9c7a8a599e38","observation_id":"583ed2e4-0234-4374-990b-47bda791c5f7","resolution":{"observed_at":"2026-08-15T14:46:57.485670Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.449834Z","title":"Glover, Gary A","venue":null,"work_id":"a8cbad6f-1455-4399-8386-bbc2bcbf9513","year":2019},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.022314Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:c7b89c4832d3e799d973ee5e9e7218504d903fbfe9e9582c4738aa3ca43e7ae4","observation_id":"ff4c03d3-87a8-4649-bfdf-bdc89689a3bf","resolution":{"observed_at":"2026-08-15T14:46:57.454220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.608431Z","title":"Thilikos","venue":null,"work_id":"ead541fa-883c-45f5-af33-37024e3d52c5","year":2020},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:56.973599Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:ff1489fca3966d4ea1af7463c1e11c162c2929f0feff45602482d0abde6dbd0e","observation_id":"8db1b68e-26e3-413f-b0e9-c68179d12c53","resolution":{"observed_at":"2026-08-15T14:46:57.613214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.434093Z","title":"Gurobi Optimizer Reference Manual,","venue":null,"work_id":"bd9adde1-5da8-4cd7-aa33-ead3b1934540","year":2024},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.027020Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:bc623caf2a49c793d795f2dbc698832181c18958344efd9b3eb56c99f04682a6","observation_id":"582ec099-ed06-4a38-b593-ad908467cb47","resolution":{"observed_at":"2026-08-15T14:46:57.438913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.639885Z","title":null,"venue":null,"work_id":"88e64861-408e-4ff1-8e87-65f3a12af44d","year":2022},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:56.963477Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:6313d35fd8ff31f5dc0fdcee2ebff90896de6e8ddb3d84959147e8c4b7afa32c","observation_id":"3d10e58f-5f3b-4e3e-9609-8c32bf5a3918","resolution":{"observed_at":"2026-08-15T14:46:57.644502Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10643","last_updated":"2021-03-07T20:10:53Z","snapshot_observed_at":"2026-08-16T09:05:06.317883Z","submitted_at":"2020-06-18T16:13:36Z","title":"Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10643","snapshot_observed_at":"2026-08-15T14:46:57.041838Z","title":"Erdos goes neural: an unsupervised learning frame- work for combinatorial optimization on graphs.ArXiv, abs/2006.10643,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.041838Z"},"links":{"cited_paper":"/paper/2006.10643","citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:f9e0feb5678803ba64e8739cda25d8b1f073ccf0fbb37f4ef89e7a5ce2b8168e","observation_id":"3250a79d-e3e9-4a77-bcfd-a7db05f6701f","resolution":{"observed_at":"2026-08-15T14:46:57.041838Z","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-15T14:46:57.624431Z","title":"Jdrasil: A modular library for computing tree decompositions","venue":null,"work_id":"9891d667-518a-45fa-a353-ca4d1929ab04","year":2017},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:56.968827Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:ab8379a2fb4086b0d816f1b0e79cf1ee27db81e4bcece9a147376eac3353b0c6","observation_id":"cd20f88f-30f7-4dc1-8219-d44ff5294ed4","resolution":{"observed_at":"2026-08-15T14:46:57.629220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.576971Z","title":"Bodlaender","venue":null,"work_id":"8b9c41ec-80fb-4d47-bf88-c3a088e42f51","year":1988},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:56.983700Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:c0c26a78d8625502893d6e60c1069b8ca66be0adbbb709cc4f914da4a92f48e6","observation_id":"a04ec66f-8eca-415d-9496-9ee412c84111","resolution":{"observed_at":"2026-08-15T14:46:57.581556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-15T14:46:57.418298Z","title":"Benchmarks for current linear and mixed integer optimization solvers.Acta Univer- sitatis Agriculturae et Silviculturae Mendelianae Brunensis, 63:1923–1928,","venue":null,"work_id":"d5e5164c-703e-4ab7-9316-13a8f91f43be","year":2015},"citing_paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-15T14:46:57.031743Z"},"links":{"citing_paper":"/paper/2608.04446"},"observation_digest":"sha256:5e623150f286e06a6fd9331cada401e9eb827a0c3e56f90a3709e2ca787a278e","observation_id":"7336f13c-0e22-436d-8153-d6521a8f2706","resolution":{"observed_at":"2026-08-15T14:46:57.423114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.04446","last_updated":"2026-08-05T04:47:16Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-18T06:00:13.528992Z","submitted_at":"2026-08-05T04:47:16Z","title":"Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":0,"verified_fuzzy":24},"total_outbound_references":31},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2608.04446."}