{"as_of":"2026-08-11T13:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de748f662cba12acca72960d55480d3c3b4f5dc5fb9f9526d0b9133acff3b927","coverage":[{"denominator":55,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":55,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T21:57:10.132196Z","state":"measured"},{"denominator":55,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":55,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2501.03390/citation-record","integrity":"/paper/2501.03390/integrity","json":"/paper/2501.03390/citation-record.json","paper":"/paper/2501.03390"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:09.757483Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.757483Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:bfc80730c90e4082680164923fe4070aba4fcb41e8ef34cde94d98c069de7cf8","observation_id":"aef5032f-34b8-4282-b941-0f8732212ebe","resolution":{"observed_at":"2026-08-10T21:57:09.757483Z","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-10T21:57:12.101736Z","title":"Constraint Integer Programming","venue":null,"work_id":"c5fb55c3-1f6b-4469-bb8c-b351b55dc697","year":2007},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.765822Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:1dce0b56e01a339939f8f4d18f726de46ce2df87639a429dd0d3fdd960f7a24c","observation_id":"50b3f913-7eb1-4b93-80bb-69ba805620be","resolution":{"observed_at":"2026-08-10T21:57:12.109790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.disopt.2006.10.006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.745940Z","title":"Conflict analysis in mixed integer programming","venue":null,"work_id":"9dd9a59b-4eee-4b51-8a33-4c218c6035ba","year":2007},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.773356Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:05888ca1c96544d521f995f3d1f11070a39d64c4529e1d1778b8cee767810d7c","observation_id":"812ec4a0-4d54-4f09-8e64-151ff4741a0b","resolution":{"observed_at":"2026-08-10T21:57:10.755072Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/mnsc.32.10.1274","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.719940Z","title":"A tight linearization and an algor ithm for zero-one quadratic programming problems","venue":null,"work_id":"ece87dfc-03d0-4ab9-8882-94a827854d3d","year":1986},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.780080Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:674d33db32b171b1d59b3171f484f75c5cd5d46587fe0f81a6fa85af184e5e2c","observation_id":"b0d70a74-0dec-4d36-8e1b-f946a651c062","resolution":{"observed_at":"2026-08-10T21:57:10.727508Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:12.074829Z","title":"Linearization strategies for a class of zero- one mixed integer programming problems","venue":null,"work_id":"5a0f8760-98bf-4d85-aa71-b09f763594f1","year":null},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.788424Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:b4124a6f22ef6679e87d22f2df8476e6d49eb91b766cb225a3864fa0e9dfdaba","observation_id":"2973aeeb-087d-486e-a70c-095c89fc1307","resolution":{"observed_at":"2026-08-10T21:57:12.082941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:12.048575Z","title":"Mixed-integer bilinear program ming problems","venue":null,"work_id":"7ebe01b5-991a-4fe8-b065-19b593c23065","year":1993},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.801950Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:a34116ce69894d850ad5111d7db815915528013b8b44a3e64017f52d946a035a","observation_id":"fc761fa7-b264-46fc-a98f-d2d477e1f211","resolution":{"observed_at":"2026-08-10T21:57:12.058524Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-019-01457-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.660087Z","title":"Orbitop al fixing for the full (sub-)orbitope and application to the unit commitment problem","venue":null,"work_id":"224e238b-c715-4e2c-b157-d2cc66dee1eb","year":2021},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.809018Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:2d414efcccd26daf005241c5e271c143c874ecfc0406165b61e5284832ccd8c7","observation_id":"42f45f00-9a70-4f1b-89d0-8520197653b5","resolution":{"observed_at":"2026-08-10T21:57:10.669716Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:12.017952Z","title":null,"venue":null,"work_id":"69a1702d-33f7-4719-9c51-a1991b18ec82","year":2008},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.817451Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:71cb8805603a1bda09a8f800c814eda2d9e824a2f0f4f32cfba17edf67150dea","observation_id":"53e2e658-4c99-42c0-8ddf-b2b4662a56ac","resolution":{"observed_at":"2026-08-10T21:57:12.028567Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-024-02104-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.627382Z","title":"E fficient separation of RLT cuts for implicit and explicit bilinear terms","venue":null,"work_id":"a8220310-6f74-41aa-884d-cc5d97a6719c","year":2024},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.824784Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:03c7dc65832b7a9e1722397a2c941d0f45a9bbeaa97dde42f50b56fb17e7ff48","observation_id":"eee0d183-b6a4-4779-a1e6-d0f72505c9e2","resolution":{"observed_at":"2026-08-10T21:57:10.635307Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.984176Z","title":"Handbook of Satisfiability , volume 185 of Frontiers in Artificial Intelligence and Applica- tions","venue":null,"work_id":"f7edf64e-08fa-4700-b835-ab8eabd320b1","year":2009},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.831098Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:023f4c07b9852dcda89a2679c812ab7d08f54bf4ebffdc7d1ff960edf922e753","observation_id":"d867b770-1911-49bb-809b-3deee84ebed0","resolution":{"observed_at":"2026-08-10T21:57:11.991765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.949608Z","title":"Pfetsch, Franziska Schl¨ osser, Felipe Serrano , Yuji Shinano, Mark Turner, Stefan Vigerske, Dieter Weninger, and Lixing Xu","venue":null,"work_id":"13291738-de17-4b77-a29e-440bbfd0acbb","year":2024},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.838041Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:c6fb256779bb8ae227870b7bf464ecef7fe5a75c1085fb18e06640ecb18d12b4","observation_id":"10761001-9916-4f54-8e55-b4b8b228c434","resolution":{"observed_at":"2026-08-10T21:57:11.960925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2004.84280","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:11.434753Z","title":"Chai and A","venue":null,"work_id":"2721931f-4564-4921-b2df-1eb430c9e857","year":2005},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.844139Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:db30b06769a00e8aeddc81d95e464f2815abe01e0134b639e55e571c80d1909c","observation_id":"eb0c5417-b438-477a-b5f9-cc3e5e16df13","resolution":{"observed_at":"2026-08-10T21:57:11.446953Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:09.850900Z","title":"ParLS-PBO: A P arallel Local Search Solver for Pseudo Boolean Optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.850900Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:cc9cfc25a580eea57288206c5974349093df0aa7e6a66f4194a5956f24f4ec97","observation_id":"1e06dd73-8b84-49ba-bdee-82c2ca8f0c11","resolution":{"observed_at":"2026-08-10T21:57:09.850900Z","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":"10.1016/j.disopt.2017.02.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.584460Z","title":"A class of valid inequ alities for multilinear 0–1 optimization problems","venue":null,"work_id":"a6b4b539-eebb-4569-9d79-86202a38e47f","year":2017},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.864464Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:3afa87b8619937aa5d63714a37f0d3a921840338296ca92367346fb2d4775630","observation_id":"83223f8f-22c2-4ace-807f-6cc2bea29141","resolution":{"observed_at":"2026-08-10T21:57:10.590999Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/ijoo.2019","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.563935Z","title":"Chv´ atal rank in binary poly nomial optimization","venue":null,"work_id":"f6504f58-6c92-4ac5-9997-f5b5346695c6","year":2021},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.871948Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:2eee0288fa9e45bc8a5ffccbc20c4d79b1d7084b8fa8422fa3b9fa52a83144c0","observation_id":"c7c2d72f-d288-480a-991d-f23284e2e7f0","resolution":{"observed_at":"2026-08-10T21:57:10.570162Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:09.880075Z","title":"A Polyhedral Study of Binar y Polynomial Programs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.880075Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:5db3af37bd3d225cbcd4e81cafd4843fb2930cfad498d48a8f80f28ac17888b6","observation_id":"b825e75e-6235-468c-94bd-8adb8022edd2","resolution":{"observed_at":"2026-08-10T21:57:09.880075Z","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-10T21:57:09.885896Z","title":"The multilinear polytope for a cyclic hypergraphs","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.885896Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:db1cf666bf94b41e2d4680d205137f7c0d704c3f6e2f0ea8cd898ed82aa9e39f","observation_id":"f8791c87-dbf7-4fca-92ee-3ac33d26ba59","resolution":{"observed_at":"2026-08-10T21:57:09.885896Z","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-10T21:57:11.914881Z","title":"Simple odd β-cycle inequalities for binary polynomial optimization","venue":null,"work_id":"b58b79fb-3350-4415-9215-30ac2d9e6aad","year":2022},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.892691Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:a632ec09637bf9dd0e9f4ea32e588ff5225118b102853fde4d216e2b1daeb18c","observation_id":"3d03a2b3-58bf-4b2d-8295-e85ecd5b829e","resolution":{"observed_at":"2026-08-10T21:57:11.922972Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:09.899009Z","title":"Sahinidis","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.899009Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:0ff1afbabf3de76c8f342605ea983ad4bd9e21d4b821c2468f0bb5f33583e29b","observation_id":"9e59dbbe-e139-45e1-8604-69a1de11677d","resolution":{"observed_at":"2026-08-10T21:57:09.899009Z","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.1609/aaai.v35i5.16492","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.496450Z","title":"Cutting to the core of pseudo-Boolean optimization: Com bining core- guided search with cutting planes reasoning","venue":null,"work_id":"e4a06d51-8a84-4509-a504-2d2f10a9f297","year":2021},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.904928Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:2e8fe41efc27481e1a36ab5f19c92d8ce147c8cf8dfc5a990e58ee6106d8593d","observation_id":"5842dde0-f5ff-474e-bc4a-0b6b8c12a997","resolution":{"observed_at":"2026-08-10T21:57:10.504113Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.884438Z","title":"Dixon and Matthew L","venue":null,"work_id":"ce45b9a1-03da-4b89-a845-5a433cf24785","year":2002},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.911109Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:c587411a30a5c7ded6e249b0e0abe94bb8ec2ca9cf16eb4ba27c319ca58de28e","observation_id":"383d4ed5-c8b1-4f0c-aeb6-d290f768b834","resolution":{"observed_at":"2026-08-10T21:57:11.898965Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.851025Z","title":"A unified framewor k for sym- metry handling","venue":null,"work_id":"82cb48cd-48f3-4029-8c00-25027b4c6bcc","year":2024},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.917086Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:c5a55a8e28d79fd6a1299644bf30c03fcc1656a2d5a3ca9f7c3d186afeb061c8","observation_id":"9be3e306-993b-46c5-b7b1-9609bca0198d","resolution":{"observed_at":"2026-08-10T21:57:11.859241Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:09.923604Z","title":"Translating pseudo-boolean constraints into SAT","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.923604Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:54e07b8d4558d25f77d7afad9b054265343de95760e97b305ef67821cdd3b33d","observation_id":"21d25293-2b5f-4ca8-8d9a-aef4684fcb0c","resolution":{"observed_at":"2026-08-10T21:57:09.923604Z","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-10T21:57:09.929302Z","title":"Divide and conquer: Toward s faster pseudo- Boolean solving","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.929302Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:2801d640cc99f74d905d96ed1fab3bc26e2a9cf10ef130535c8ad9ec419da8f8","observation_id":"ef6ab818-c22a-41ed-b162-8935bd98b8ab","resolution":{"observed_at":"2026-08-10T21:57:09.929302Z","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.3233/978-1-58603-929-5-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.428422Z","title":"A history of satisfiability","venue":null,"work_id":"11750e1c-eb45-4284-8497-62de6c93b012","year":2009},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.935247Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:63ba4132d98301929db4ab938fefde4ff0fc50a46855a3a1705f3e01fe6d7165","observation_id":"0cec61d3-d373-41a0-9ee5-18b7d10de11e","resolution":{"observed_at":"2026-08-10T21:57:10.436037Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.822124Z","title":"Pfetsch, Christia n Puchert, Daniel Rehfeldt, Franziska Schl¨ osser, Felipe Serrano, Yuji Shina no, Jan Merlin Viernickel, Stefan Vigerske, Dieter Weninger, Jonas T","venue":null,"work_id":"a2b90247-6561-422b-b376-8a7007f05ebd","year":2017},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.940768Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:eac1fc485723f7e2a8968c01986c26781e427aa933f10a9cceebbb40dbf23e87","observation_id":"41b317aa-51c5-4cdc-ad73-113d808c96db","resolution":{"observed_at":"2026-08-10T21:57:11.830743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2022.0171","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:11.219724Z","title":"PaPILO : A parallel pre- solving library for integer and linear programming with multiprecision su pport","venue":null,"work_id":"db87c7de-a5ef-4dd7-b3c9-44cda42d3a37","year":2023},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.948943Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:942976b08f6e4586753bb8dd59d838cc95d274dff45df85b49ad2ec4da8a0b70","observation_id":"1ec64ab4-e08e-4e04-b335-456ef9adedae","resolution":{"observed_at":"2026-08-10T21:57:11.232826Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.793861Z","title":"GNU MP: The GNU Multiple Precision Arithmetic Library , 6.3.0 edition, 2023","venue":null,"work_id":"bf641a55-ab05-48ce-87b1-6dc5feacd834","year":2023},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.955949Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:c2200e52e4c05d3902628da6cc6b4984f4080d13f1bb329730b726a401ee0c5a","observation_id":"fcb3c221-3270-460e-befe-0c0feefbc3db","resolution":{"observed_at":"2026-08-10T21:57:11.801584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.761298Z","title":"Hemery and C","venue":null,"work_id":"a054374f-e661-4226-b0d0-a975f579f3a7","year":2006},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.964752Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:28833141dcab4789b7b00c65fba39a4bda3a471954630b0badc2af8e4aa05e25","observation_id":"be2ebc63-e6b1-4ff8-845e-88feac7d0f6f","resolution":{"observed_at":"2026-08-10T21:57:11.772076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.735121Z","title":"Detecting and handling reflection symmetr ies in mixed- integer (nonlinear) programming","venue":null,"work_id":"2c788052-d218-4fc1-98d6-7db39cf8cff4","year":2024},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.971091Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:84419f0704892f875b34e2eec68da47744843da0651f608a0060a214230102ef","observation_id":"1c0c2f62-1875-48cf-ae05-3c242e30d73a","resolution":{"observed_at":"2026-08-10T21:57:11.744658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.704829Z","title":"Generalized resolution for 0–1 linear inequalities","venue":null,"work_id":"460fd945-bfb7-405d-ad59-c90c42ad5823","year":1992},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.977865Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:def051f6a380ccfa3caa5d00e1cc5b261f464f4a839d1b72e86767bea34c94c6","observation_id":"91e18131-18f9-4d61-a987-10d684c00ef9","resolution":{"observed_at":"2026-08-10T21:57:11.713265Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:09.984685Z","title":"Generaliz ed totalizer encoding for pseudo-Boolean constraints","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.984685Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:986bbdbc6443a36cf85c7e6623d6af2836047478beee6b66b25295955a5f1b1d","observation_id":"52e74955-b52d-49fb-8095-8c8b3ff27e5b","resolution":{"observed_at":"2026-08-10T21:57:09.984685Z","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-10T21:57:11.683511Z","title":"bliss: A tool for computing au tomorphism groups and canonical labelings of graphs","venue":null,"work_id":"ccb438d2-579f-4380-974e-1b9a0907c0cc","year":2012},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.991391Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:754d00bdb1fa04e2e7bbf8ff1dcb85a40921e1dca72ea278ae6338558a5b5eda","observation_id":"8c5d4501-b552-48a4-b39c-9cd34aa72319","resolution":{"observed_at":"2026-08-10T21:57:11.690047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.659176Z","title":null,"venue":null,"work_id":"a2607d12-f75f-4b1d-a5a4-2f966fbc0373","year":2008},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.997483Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:59b8c9865f5775c99c974212631119fe3a965415709555b9f6253d565fa4c468","observation_id":"e925a4ec-9aee-4f77-8368-0cb6c03bfe70","resolution":{"observed_at":"2026-08-10T21:57:11.665488Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.disopt.2011.07.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.384769Z","title":null,"venue":null,"work_id":"8c60456c-b89f-4158-a5f1-81c90431ffd9","year":2011},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.004250Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:9d01fd846ec4dc0e89a21c1ff4af58138fe7a8dca7e40179b31bb266b57bafc9","observation_id":"c3a41f19-2d2d-47f7-87f5-9c1903a0ec64","resolution":{"observed_at":"2026-08-10T21:57:10.392213Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.633322Z","title":"The Sat4j library, release 2.2","venue":null,"work_id":"67ba25f1-d6d8-4fd2-b7f0-5bbdd2037ae1","year":2010},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.010061Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:d8a73e7acffca8fe1bafb1bc901bce588e12e74b371a8c480e66f85d0878382d","observation_id":"2e0d99dc-d759-4015-a1e5-8fabba19d7bc","resolution":{"observed_at":"2026-08-10T21:57:11.639286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:10.015956Z","title":"Feasibility Jump: an LP -free Lagrangian MIP heuristic","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.015956Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:6d6c54ea8627e65050045428fb574092cd96271c195b70d38b173e2a2697a3cf","observation_id":"0eed2cea-1312-484a-a224-f1575730b669","resolution":{"observed_at":"2026-08-10T21:57:10.015956Z","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-10T21:57:10.023909Z","title":"Symmetry in integer linear programming","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.023909Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:f1e87ce514e73bb4cc452ca33470d24a2ee4141d2660bb687f179c92728a39ab","observation_id":"de274716-e38b-4d75-a4b3-6add4f0995a5","resolution":{"observed_at":"2026-08-10T21:57:10.023909Z","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-10T21:57:10.029597Z","title":"Marques-Silva and K.A","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.029597Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:4052e169fa9b41d2947da61be2c913ccb68cd9ee4023df44ee82b2226b5a23d7","observation_id":"3f505a62-89f6-413e-a187-fe7da2ea1b90","resolution":{"observed_at":"2026-08-10T21:57:10.029597Z","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-10T21:57:10.035916Z","title":"Open-WBO : A modular MaxSAT solver,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.035916Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:ca1d5da25698bf7b9c7c68bf9aa0c006d98cfc0b21c9d0eaa201d34f258b2210","observation_id":"74ba536f-dcd6-4f29-8104-fa13e6229a0b","resolution":{"observed_at":"2026-08-10T21:57:10.035916Z","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-10T21:57:10.041383Z","title":"McKay and Adolfo Piperno","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.041383Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:824fd446bff82d3e5d714d2604c38472d8d95a5913dec45d09e7aad4479f4bd8","observation_id":"06062532-36a4-4777-a43c-7dc5eead4f41","resolution":{"observed_at":"2026-08-10T21:57:10.041383Z","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.4230/lipics.cp.2023","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.255008Z","title":"Improving conflict analysis in MIP solvers by pseudo-Boolean reasoning","venue":null,"work_id":"f9dda423-2d8d-4cd3-94f4-4d8e19794239","year":2023},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.047187Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:0b4474ea0b42f8499dc8fc2932a986a00834727ade5b7e4d09f712b17a808a42","observation_id":"37fd2a5e-e4df-4922-a6af-9e8f8ec9acf7","resolution":{"observed_at":"2026-08-10T21:57:10.262631Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:10.054297Z","title":"Cut-based conflict analysis in mixed integer programming, 2 024","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.054297Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:285191997f0f7ec16087399e81a4881aa700d9d985276538639561103b3fb64a","observation_id":"8de01d0f-f8d7-44e5-84b1-8870124935ab","resolution":{"observed_at":"2026-08-10T21:57:10.054297Z","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-10T21:57:10.062328Z","title":"Orbital branching","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.062328Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:2fd1b43cdb8acae51d25ddcd9e54793b054e6c7b71fb2fd8a82dc9e46d3398a1","observation_id":"8a5e7228-38e6-4b74-847d-f0212360afed","resolution":{"observed_at":"2026-08-10T21:57:10.062328Z","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-10T21:57:11.607769Z","title":"Pseudo-Boolean competition 2009, 2009","venue":null,"work_id":"0a5867ce-f978-419c-b7b2-f85c7926be79","year":2009},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.069730Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:527d92d1676386e088256f73c7510f2baf0fb15a4e0d54964283a08c1e933337","observation_id":"412f2930-a28b-479e-860c-29d0683d2802","resolution":{"observed_at":"2026-08-10T21:57:11.616302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.576886Z","title":"Pseudo-Boolean competition 2010, 2010","venue":null,"work_id":"70be6c97-0e2f-428f-977e-7530436baf99","year":2010},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.076910Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:1082d7cc847e9d6225963de9bfed458ced60198e6aa6604f28357bc87c6c15ee","observation_id":"0b8171ce-ff29-4a35-9f23-2b8e0ba66a53","resolution":{"observed_at":"2026-08-10T21:57:11.585981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.545665Z","title":"Pseudo-Boolean competition 2011, 2011","venue":null,"work_id":"8ca70a00-e310-4335-95b8-62ebb35baa9f","year":2011},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.083729Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:2a2c3a24eeceef9e494d9e50704a9c21338fc3119ccdd10030e052e54ff2d619","observation_id":"5c046ac0-d979-4f96-858c-e26ced71121a","resolution":{"observed_at":"2026-08-10T21:57:11.552314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.513657Z","title":"Pseudo-Boolean competition 2012, 2012","venue":null,"work_id":"e7573062-b200-4d6b-bb1d-a3cecfb757c4","year":2012},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.090789Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:157715cb10bb8af6cefab15a208d769a14a2a119399c4a1d823d34230739aaa1","observation_id":"e6114902-3cab-445b-9b42-bc081358ec26","resolution":{"observed_at":"2026-08-10T21:57:11.519883Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:11.488182Z","title":"Pseudo-Boolean competition 2024, 2024","venue":null,"work_id":"194bc0ec-33ac-4945-9c0e-bd749111296f","year":2024},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.097208Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:d3bcb62643ed85ac40cbf46965ccfc7cc2c904f6dbaf54bd3498c9d11704a905","observation_id":"44e438ba-eb21-45ed-8e46-b30ef764c481","resolution":{"observed_at":"2026-08-10T21:57:11.494884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1587/transinf.2014fop0007","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.212079Z","title":"Construction of an RO BDD for a PB-constraint in band form and related techniques for PB-solver s","venue":null,"work_id":"a90a87b0-fc35-4e86-9165-92564278621e","year":2015},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.104985Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:a9afe56d374d0acdf8e8425658cf1ee7f8deae13248e11f49cab4991cca0cc70","observation_id":"25948e69-38b8-45bc-a51f-f5387b786d90","resolution":{"observed_at":"2026-08-10T21:57:10.218741Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/sat190020","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.184823Z","title":"Pueblo: A hybrid pseudo-Boo lean SAT solver","venue":null,"work_id":"99e29638-81d6-4b60-a354-137a2fc51a98","year":2006},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.112010Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:43e2bf7bab9206db1e35481ee9517cedf441cb36f1337f9e38108b7390eda60f","observation_id":"205420e2-082a-435b-a5ac-14347e5601e1","resolution":{"observed_at":"2026-08-10T21:57:10.195170Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T21:57:10.118934Z","title":"FiberSCIP—a shared memory parallelization of SCIP","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.118934Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:582400f72a0fd401f54c376b945716c34dee3c06815ff5ee5cba903cadbb7c10","observation_id":"48d38fd0-8cc0-4349-8c08-c517250ada67","resolution":{"observed_at":"2026-08-10T21:57:10.118934Z","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-10T21:57:10.126475Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.126475Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:1bbfea9a39b2e2852dc59b544a9da196c5cc5f5b44e4cc8cf9d6adcc6390f5a4","observation_id":"682097af-3c2e-421a-ae59-56bd23874f7f","resolution":{"observed_at":"2026-08-10T21:57:10.126475Z","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-10T21:57:11.463837Z","title":"Computational a spects of infeasibility analysis in mixed integer programming","venue":null,"work_id":"2232392e-e77a-4407-bcb5-eb21b8e3fc56","year":2021},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:10.132196Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:e9f22e725e5c493dd698dab225cba84b2fcc3d757debcd76707ced4632ff7628","observation_id":"ff5e2506-a0a5-4764-b19f-81b2977b2602","resolution":{"observed_at":"2026-08-10T21:57:11.472034Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/opre.38.2.217","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T21:57:10.687388Z","title":null,"venue":null,"work_id":"71303368-aad2-432f-8ba7-6ae0a6315691","year":null},"citing_paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP","version":2},"reference_index":1990,"source":"pdf_text","source_observed_at":"2026-08-10T21:57:09.795218Z"},"links":{"citing_paper":"/paper/2501.03390"},"observation_digest":"sha256:9e3edbd50cb4e7023be3b6f8fcc32dc75b567c75e910ee3bf65fdc8bf8bbd370","observation_id":"318b8d75-62a4-49e5-90b8-6437111ec1c4","resolution":{"observed_at":"2026-08-10T21:57:10.699046Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.03390","last_updated":"2025-01-08T12:20:18Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T21:51:03.894863Z","submitted_at":"2025-01-06T21:15:03Z","title":"State-of-the-art Methods for Pseudo-Boolean Solving with SCIP"},"reference_resolution":{"displayed":55,"state_counts":{"malformed_identifier":9,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":15,"verified_exact":14,"verified_fuzzy":16},"total_outbound_references":55},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 55 of 55 outbound references and 0 inbound Pith citation observations for arXiv:2501.03390."}