{"as_of":"2026-08-10T19:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e169f30a2704564f2ec6d278c98aa0f296e9c6a643c0baa9e58648dd3efe3ad9","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:03:42.107820Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2507.09455/citation-record","integrity":"/paper/2507.09455/integrity","json":"/paper/2507.09455/citation-record.json","paper":"/paper/2507.09455"},"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-06T18:03:47.792326Z","title":"PhD thesis, 2007","venue":null,"work_id":"b37233e3-73da-4bf0-b741-18eef0344101","year":2007},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:38.501583Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:15afa3c44f230e9922ad2da888c154b898bb7d9dc0c6e0ad1da3b535e78ada7b","observation_id":"f1836932-d81a-4f2c-ba30-7e7a972a44cb","resolution":{"observed_at":"2026-08-06T18:03:47.867228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:47.655932Z","title":"Hybrid branching","venue":null,"work_id":"62b05ba8-a955-442d-b499-4a5968140bcf","year":2009},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:38.601429Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:b1e3af70b10a2bff70dabf258e43278b3567e9598b40d429d78320930179820b","observation_id":"9bc78fc8-d4ce-45bd-a408-62ce99e06255","resolution":{"observed_at":"2026-08-06T18:03:47.725313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:47.496859Z","title":"Branching rules revisited.Opera- tions Research Letters, 33(1):42–54, 2005","venue":null,"work_id":"77a7161b-4463-4a51-96aa-80ead85495e1","year":2005},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:38.716373Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:e01e171e0a02e0dd13287bae4b80ef2cd2bd5db6b16affc1914f039c104d1564","observation_id":"dbcddc5c-e54b-4eb6-80b9-ce2666fd2821","resolution":{"observed_at":"2026-08-06T18:03:47.571230Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:47.318278Z","title":"A machine learning-based approximation of strong branching.INFORMS Journal on Computing, 29(1):185–195, 2017","venue":null,"work_id":"cc866373-db23-4e3f-b8f0-b7a7bff5338d","year":2017},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:38.800745Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:e40678c62eaf77e02170ceeffa8b6b992e83372ebe1a52afebf8e056f0064c77","observation_id":"f6fbd147-bb1e-4b9b-8e00-9dba9f9a4f2d","resolution":{"observed_at":"2026-08-06T18:03:47.419429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:47.113457Z","title":"Citeseer, 1995","venue":null,"work_id":"900c889b-67b3-4c12-af97-62ff68946d8f","year":1995},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:38.938991Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:b2981b7f7a4078d916d121d3212a137c024b2c453f7d02dfe14c394c757ae043","observation_id":"8e994ff4-12d1-4b6e-aecc-7c92a2bdf59e","resolution":{"observed_at":"2026-08-06T18:03:47.224084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:46.956856Z","title":"Experiments in mixed-integer linear programming","venue":null,"work_id":"f6da3cfc-6945-433a-a9bc-264cd9535ecc","year":1971},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.056163Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:9a2f3f81bed4383e8b29b8051719ba1a84522a9a51b2c5659ed228556c4f6988","observation_id":"9aad50d8-63fe-400a-9b9c-90a5ac73f6c7","resolution":{"observed_at":"2026-08-06T18:03:47.038278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:46.851604Z","title":"Springer, 2016","venue":null,"work_id":"eed1f1ab-2bef-4acb-ae89-936bf3a661e6","year":2016},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.155362Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:af0a70c14a84702761172cbc1d549e13ebc016e3cc12dc899fe29e88eacd22ed","observation_id":"c5780a99-4ce0-4037-b65d-5d6d51342175","resolution":{"observed_at":"2026-08-06T18:03:46.856035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:46.723959Z","title":"PhD thesis, Zuse Institute Berlin (ZIB), 2006","venue":null,"work_id":"9b748fa8-b836-402e-90bd-a79bc196d9ab","year":2006},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.213133Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:e0d245375ac0c39f5e493bfa371a5ffbe7bbc931fac90072e6cd08eee1d99fc1","observation_id":"f2ccb5ad-4d79-474a-b49a-a6ec5470ac93","resolution":{"observed_at":"2026-08-06T18:03:46.818236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:46.504142Z","title":"Measuring the impact of primal heuristics","venue":null,"work_id":"6d43c826-52e8-476c-9814-605cb4fa199b","year":2013},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.295433Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:574ab175ac4be104b941c3426960844453e2ce778edc3089dad8177ed4dbb91e","observation_id":"b60bc34a-101a-471d-85ed-814ab2ccc819","resolution":{"observed_at":"2026-08-06T18:03:46.618136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:46.320910Z","title":"Primal heuristics in integer program- ming","venue":null,"work_id":"9ae663c9-af0e-41be-a939-a81b1ad72ec0","year":1900},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.331551Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:78d8b3fc92df544c279e4d81b93b3bddb5d27282e84cc9b1e67ea6ef155486e2","observation_id":"e9434029-75f2-4af9-9a7a-03e07cd3f620","resolution":{"observed_at":"2026-08-06T18:03:46.420648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:46.176997Z","title":"Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E","venue":null,"work_id":"f338acf9-724a-4f1b-a5d6-c90437c83af5","year":2021},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.335388Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:82f70b2fe073820f69e7e76a83c61ca77a3f4e50d55c612d161f83a97d3f1495","observation_id":"dca0a160-2252-4301-b3f1-69ed491bd5b3","resolution":{"observed_at":"2026-08-06T18:03:46.250292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:45.952258Z","title":"A comparison of heuristics and relaxations for the capacitated plant location problem.European journal of operational research, 50(3):280–297, 1991","venue":null,"work_id":"e9663671-6281-448f-ae1a-52c5402fcdca","year":1991},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.376332Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:565507fad0f1dc654324fc11ff28607f4dd8fb58eb0032423f4a81193c7cdacd","observation_id":"7a1eae71-5abb-445d-a4ee-53d0d66c77ec","resolution":{"observed_at":"2026-08-06T18:03:46.060666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:45.746807Z","title":"Lower bounds on the size of general branch-and-bound trees","venue":null,"work_id":"d4671823-8289-461a-b8a9-ceb85ab1c04e","year":2023},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.424535Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:c11572d698830b49a7acccf943d9ccbb8587c92dae4c70c350aee09ef76adb79","observation_id":"40d61f8a-09ca-49c2-abe4-f89d2e5b16da","resolution":{"observed_at":"2026-08-06T18:03:45.848693Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:45.562599Z","title":"A theoretical and compu- tational analysis of full strong-branching.Mathematical Programming, 205(1):303–336, 2024","venue":null,"work_id":"6bb48a90-66d7-4e2e-a5b2-28db36c43580","year":2024},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.503539Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:75e37c7271917bad8965228f21a1d755edce48d24e8a3ad430591fd7c78bc7e1","observation_id":"9ba58139-3793-43b8-a402-5a3f29349c0e","resolution":{"observed_at":"2026-08-06T18:03:45.612765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:45.449915Z","title":"Backdoor branching","venue":null,"work_id":"a831cad2-7ff0-4fb5-9420-2bbbe89b76fd","year":2011},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.573540Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:bd7d9b5b22da5a0bc569bf78fad135cdf63f70dd8c544734a414a21eefc650b2","observation_id":"67648a06-1211-48df-99bf-4bbdb28ed5aa","resolution":{"observed_at":"2026-08-06T18:03:45.509752Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:45.337734Z","title":"Measuring the impact of branching rules for mixed- integer programming","venue":null,"work_id":"382c0b74-9e67-4791-8382-7c87c546e59a","year":2017},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.664100Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:5f53ceb78a7906684ace7cfa826d8d4893eae1a978fd519d561bca854347a809","observation_id":"f4e81dfa-264c-4ead-b488-8eb231937896","resolution":{"observed_at":"2026-08-06T18:03:45.383573Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:39.765723Z","title":"Exact combinatorial optimization with graph convolutional neural networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.765723Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:8283f8562514ee24e3b1586c032299c1488b65a51807a18a44b3389b82b6756e","observation_id":"bb3931ad-f4a7-4af8-b2f6-0d41bc4fcbab","resolution":{"observed_at":"2026-08-06T18:03:39.765723Z","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-06T18:03:45.241002Z","title":"Information-theoretic approaches to branching in search","venue":null,"work_id":"a0042b15-26d3-46e4-a92b-2b6e926537a2","year":2006},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.848462Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:7519141204d05af532c1997c3aaaa06c516cf47e36c46f18d0511c7c5149f220","observation_id":"1abd9d32-f4c3-4be2-8e4a-64fa4981d074","resolution":{"observed_at":"2026-08-06T18:03:45.267619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:45.115663Z","title":"Lookahead branching for mixed integer programming","venue":null,"work_id":"0fb7efed-7877-4720-8086-1cbb24bb8b90","year":2006},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:39.951577Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:32998e368ead31bd90def5e4a77124f7f704a13af104a5b687ceda97fb50bbca","observation_id":"8348d88e-af35-48cf-bd03-293751483432","resolution":{"observed_at":"2026-08-06T18:03:45.190548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:45.003319Z","title":"Identifying minimally infeasible subsystems of inequalities","venue":null,"work_id":"aeb4aa8e-0df9-49c6-aec3-09d951ac31b5","year":1990},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.039709Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:2ee1d206158e528840cec6fd6c0b4f1220db29d1cf65f8f7336226ffc69bd50a","observation_id":"c84a3fd4-ce0c-40ba-9896-fdac3551301e","resolution":{"observed_at":"2026-08-06T18:03:45.049937Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:44.900283Z","title":"Christophel, Kati Jarck, Thorsten Koch, Jeff Linderoth, Marco Lübbecke, Hans D","venue":null,"work_id":"f88c3551-6bf0-475f-9545-802d8ebd62bd","year":2017},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.181465Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:d58ac9ab52ade0970dd6b72e55023fe02438f4474ac68209fe876a30b861fdfb","observation_id":"a8cfd160-090e-4553-9f25-5d7e7e4e1515","resolution":{"observed_at":"2026-08-06T18:03:44.946984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:44.826421Z","title":"Hybrid models for learning to branch","venue":null,"work_id":"9da28491-d7b5-45ed-998c-8518bd9a32ce","year":2020},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.280796Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:4176349a5d435b5e80b9bb218ee180a75b3814e5e4ae0f0e2e6a3ff4995e28f8","observation_id":"76f19b6e-476b-4028-a127-845dd473641c","resolution":{"observed_at":"2026-08-06T18:03:44.869984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:40.360087Z","title":"Gurobi Optimizer Reference Manual, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.360087Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:363934da3d848dd3e48f34a59f04fd3095cbd718b2d07611936e1e2c9a38a8ab","observation_id":"b0a0b64b-25ab-47ed-9767-361016d43a81","resolution":{"observed_at":"2026-08-06T18:03:40.360087Z","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-06T18:03:44.725824Z","title":"Learning to branch in mixed integer programming","venue":null,"work_id":"c5107dc3-33c9-41de-aa83-fbe8ca7988d6","year":2016},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.439795Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:04572bd3259fc89669db7c73ade27bb290e3f2fa0b43b368f46ec92292bd3d80","observation_id":"b36526b4-908e-46fb-a739-de851a447c2e","resolution":{"observed_at":"2026-08-06T18:03:44.759282Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:44.640128Z","title":"Finding backdoors to integer pro- grams: a monte carlo tree search framework","venue":null,"work_id":"074d96d2-686d-45e2-ae8e-6018cbc8b590","year":2022},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.525121Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:4a297766b96112fa173667f6a016a58c0217d15f58eae0d6e8b66b165ad6b1af","observation_id":"6ccd3abf-c7bb-42bb-8239-e9f00f475888","resolution":{"observed_at":"2026-08-06T18:03:44.688078Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:44.550182Z","title":"Information-based branching schemes for binary linear mixed integer problems.Mathematical Programming Com- putation, 1:249–293, 2009","venue":null,"work_id":"86f160b4-8c61-4785-a178-ad20d18670db","year":2009},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.628056Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:813027e4967587de2f275379b4c58eb7ef1123c7ca1cb31aebb553dbfe9b16d3","observation_id":"590f2e02-ea87-46a1-8a3d-bdb4f853d9a0","resolution":{"observed_at":"2026-08-06T18:03:44.575263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:44.421878Z","title":"Land and Alison G","venue":null,"work_id":"f1a0a917-4915-47a7-9efd-c4f9cf6dd84f","year":1960},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.713739Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:b6ab6e0529c4e2fa31b0c9a4e6fa1d4d6c76d1e51c8f0c7e4ecb0d86d49bd884","observation_id":"d6593080-e686-4a78-adfd-25253ace5001","resolution":{"observed_at":"2026-08-06T18:03:44.488394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:44.220786Z","title":"How important are branching decisions: Fooling mip solvers.Operations Research Letters, 43(3):273–278, 2015","venue":null,"work_id":"7c4d9aba-c007-4aea-b28f-f2b6fc541180","year":2015},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.816476Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:d76c64093bcf028aa775023bc81b6c022f190d42183045a83b36430261690b79","observation_id":"4aeefd85-87d1-46c5-ad1e-cc85055c197a","resolution":{"observed_at":"2026-08-06T18:03:44.296143Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:44.055705Z","title":"Towards a universal test suite for combinatorial auction algorithms","venue":null,"work_id":"09d84ed1-bedf-47bc-af4e-dd2f46d4d419","year":2000},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:40.924008Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:765bd56337e4a7e41f2c88ae8e83b8b9faf1ef1e8cdf627f0ce531af9ba9c0eb","observation_id":"ff46db7d-f593-49cb-80f1-ce92ef4ef471","resolution":{"observed_at":"2026-08-06T18:03:44.135175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:43.917097Z","title":"Look-ahead versus look-back for satisfiability problems","venue":null,"work_id":"cb7aeb04-2190-42dc-bcad-02e761bd28ac","year":1997},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.024503Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:a1145b030cb07e49b9c28da15473adeba4c6a64f52cd39a625f28081dd742e47","observation_id":"181018fa-540a-4b71-9c1f-a3464fee49ad","resolution":{"observed_at":"2026-08-06T18:03:43.971157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:43.737388Z","title":"A computational study of search strategies for mixed integer programming.INFORMS Journal on Computing, 11(2):173–187, 1999","venue":null,"work_id":"9d15ac5a-31ce-4bef-862a-c5544a44fef9","year":1999},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.111167Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:9564b2f77ac682b4dbd0044d40cc89cd3c7706ae8cfa5bae33b7ad6fb9f5fecc","observation_id":"9978ad0b-157c-4d0a-a811-d95f524118a3","resolution":{"observed_at":"2026-08-06T18:03:43.806980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:43.579472Z","title":"Chaff: Engineering an efficient sat solver","venue":null,"work_id":"f1a4688a-8df2-4b47-bf5f-98bb8d9949a6","year":2001},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.239242Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:b5fdd32ce97f7c1bed32e60c681e85d1d90b578074ad5bed008753a6ba81095c","observation_id":"e4f61967-d3d0-4e8f-8322-77ccbcc8897e","resolution":{"observed_at":"2026-08-06T18:03:43.645746Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.13349","last_updated":"2021-07-29T13:41:25Z","snapshot_observed_at":"2026-08-07T23:29:46.974172Z","submitted_at":"2020-12-23T09:33:11Z","title":"Solving Mixed Integer Programs Using Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.13349","snapshot_observed_at":"2026-08-06T18:03:41.339279Z","title":"Solving mixed integer programs using neural networks.arXiv preprint arXiv:2012.13349, 2020","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.339279Z"},"links":{"cited_paper":"/paper/2012.13349","citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:cbe5e15b74785dc5eb479190bed2fa33292e12daf5d5f93f985cb8dbbba2372d","observation_id":"410e42cb-2d44-4b53-971e-3f9515c28250","resolution":{"observed_at":"2026-08-06T18:03:41.339279Z","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-06T18:03:43.413740Z","title":"Integer and Combinatorial Optimization","venue":null,"work_id":"02908f47-09ba-4fbe-93f4-02a0b1879710","year":1988},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.431643Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:eccfaf904bde3229caa0f8713461c9adee4dad142a9cba5cc2f08698c42e0a50","observation_id":"bb147395-e349-4b27-9b53-5039dfdfe358","resolution":{"observed_at":"2026-08-06T18:03:43.464443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:43.286621Z","title":"Computational study of a chance constrained portfolio selection problem.Journal of Optimization Theory and Applica- tions, 142(2):399–416, 2009","venue":null,"work_id":"e4fa90af-ff30-48bd-86b5-72a82fc5a4ed","year":2009},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.503659Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:14317a02cfebfa1a8fd0168a8bc0a809b9cf73d4b75d65aca086df9f88a5eeed","observation_id":"1add3135-917b-4d0b-b934-5ecadf14db8a","resolution":{"observed_at":"2026-08-06T18:03:43.349124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:43.073072Z","title":"Active-constraint variable ordering for faster feasibility of mixed integer linear programs.Mathematical Programming, 110:445–474, 2007","venue":null,"work_id":"171ddd94-0be9-405f-b751-b2c5fa6f258b","year":2007},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.562787Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:989799fd7887595b028e68381c5e00e51e6dbaa2026d2bf097413d5f741cec91","observation_id":"01e239ee-2c80-4f22-ae75-bb3d98de779d","resolution":{"observed_at":"2026-08-06T18:03:43.227058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:42.938373Z","title":"Ecole: A gym-like library for machine learning in combinatorial optimization solvers","venue":null,"work_id":"e10ca706-d601-4af4-bbf9-bb3f76592f46","year":2020},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.642691Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:1a34b588fdc29d21e8d34b74784d22ef58b24568fa87baae5cd2b293b4dd77fd","observation_id":"957fc1ee-802c-4b2b-80b7-fe173620824d","resolution":{"observed_at":"2026-08-06T18:03:42.999875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:42.759120Z","title":"Covering linear program- ming with violations.INFORMS Journal on Computing, 26(3):531–546, 2014","venue":null,"work_id":"a86576d7-f9c0-4379-8bd5-e796ecb6ae3e","year":2014},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.745681Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:d173bbdbcbd9a12c4de262e31b03f224e15f822b6afbdb01eff1b49a061e159f","observation_id":"c873cefe-2ccc-4f6a-bd2d-5dec966f9621","resolution":{"observed_at":"2026-08-06T18:03:42.850257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:42.615950Z","title":"Capacitated lot-sizing with extensions: a review","venue":null,"work_id":"4f6bef54-3586-426f-8490-20118738c150","year":2008},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.855954Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:cef3f4018c8fb6942b11bb69290787300601381653bf9194b377b2b0a0942c9d","observation_id":"d73d4540-fd27-4f76-99e0-5d779d71cac8","resolution":{"observed_at":"2026-08-06T18:03:42.684612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:42.463515Z","title":"Non-monotonicity of branching rules with respect to linear relaxations.INFORMS Journal on Computing, 2025","venue":null,"work_id":"5dbe0e90-a607-4ac8-98c2-fea600f692d5","year":2025},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:41.924089Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:f5845554268d22ebb958b44f8ac9e1d9b22cb6c9a6f926cc14a625d41319fbfb","observation_id":"8a0bdd04-4b22-489c-a823-20510bd3ef9c","resolution":{"observed_at":"2026-08-06T18:03:42.538411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:42.317351Z","title":"Learning generalized strong branching for set covering, set packing, and 0–1 knapsack problems.European Journal of Operational Research, 301(3):828–840, 2022","venue":null,"work_id":"6f161887-35db-4391-8d48-f1240c6e329f","year":2022},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:42.024823Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:4fc6fd32b35e371cae3ebb897a1fdfedf814f7fb8cb88d7ec8ba2fc013ba6f5f","observation_id":"2eca4db3-c60d-4acb-962d-27fc889cc2c8","resolution":{"observed_at":"2026-08-06T18:03:42.386692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T18:03:42.199292Z","title":"arbitrary relationships","venue":null,"work_id":"ca268558-6367-4b96-8997-0fde3d77d79e","year":2021},"citing_paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T18:03:42.107820Z"},"links":{"citing_paper":"/paper/2507.09455"},"observation_digest":"sha256:dd3af6c65f486add4e3728ca416c70c0edccd7cbbbb55a5f05c9cf6a3f07fc90","observation_id":"94c02135-a4e2-415d-b46e-95ebd91ccf5a","resolution":{"observed_at":"2026-08-06T18:03:42.261324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.09455","last_updated":"2025-07-13T02:45:53Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T13:30:50.809093Z","submitted_at":"2025-07-13T02:45:53Z","title":"Improving Full Strong Branching Decisions by Incorporating Additional Information"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":39},"total_outbound_references":42},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2507.09455."}