{"as_of":"2026-08-07T05:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9735f58e8731e5524a35b55a5762559c4b6f859827f6e932d243e93ace3c9205","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-08T09:20:51.127674Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2607.06343/citation-record","integrity":"/paper/2607.06343/integrity","json":"/paper/2607.06343/citation-record.json","paper":"/paper/2607.06343"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T09:24:49.115062Z","title":"Mixed integer programming: Analyzing 12 years of progress","venue":null,"work_id":"9ddefcd1-6db3-4c84-8fc9-356a4b8e3f9f","year":2013},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:8f82488d5b057203b5c8968a5e9d5432c4890830499e26fced4970e2f85b86e4","observation_id":"14f6959d-3644-498d-8e61-fb4924985c71","resolution":{"observed_at":"2026-07-08T09:24:49.117137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.121829Z","title":"Further results on an abstract model for branching and its application to mixed integer programming.Mathematical Programming, 190(1):811–841, 2021","venue":null,"work_id":"8488fb55-09bf-4ffc-bd96-5a005ef70fb9","year":2021},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:0cbe08c3bdb85a00042c7aed2144f36e487f0cddd79e2409de40bf5a6de5164e","observation_id":"ae2b3c28-3ce7-4bad-8e9d-a3a85e12b577","resolution":{"observed_at":"2026-07-08T09:24:49.123086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.119934Z","title":"On the enumer- ative nature of Gomory’s dual cutting plane method.Mathematical Programming, 125(2):325–351, 2010","venue":null,"work_id":"65842159-b48c-4c8a-9039-2e5b9f60b250","year":2010},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:85327aa3b24b24f870b3a48ebdfe8dda0644fa65448433e4e9376aba7b16a8aa","observation_id":"497c6926-c008-447c-b452-0cd4f2a042c5","resolution":{"observed_at":"2026-07-08T09:24:49.121270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.109271Z","title":"Complexity of branch-and-bound and cutting planes in mixed-integer optimization—II.Combinatorica, 42(Suppl 1):971–996, 2022","venue":null,"work_id":"0f5af9f1-8b30-48e5-8f54-8d1506d394fa","year":2022},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:b37f86e3cea84f2cc211f695362326f38cc14bd5766022899d3f40a333535496","observation_id":"254f3645-5da6-428b-96aa-8ac5b4461984","resolution":{"observed_at":"2026-07-08T09:24:49.110630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.111211Z","title":"Complexity of branch-and-bound and cutting planes in mixed-integer optimization.Mathematical Programming, 198(1):787–810, 2023","venue":null,"work_id":"75b3d089-c027-4c6d-b7bc-4517fc9af2cf","year":2023},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:72e90f5d8087296858171496e62f48d84711e7815f02eb1a421c9b648b6cf3af","observation_id":"4e960b19-d451-458a-8e93-6c989e4d65d4","resolution":{"observed_at":"2026-07-08T09:24:49.112663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.113248Z","title":"Learning to use local cuts.Mathematical Programming Computation, 17(3):437–450, 2025","venue":null,"work_id":"221ddd77-3fe6-487d-82bb-c686e2d47f2b","year":2025},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:d3edd620c5d71d4c95b066c3a3d1bdeba206cefaa058279994033223ac98a19f","observation_id":"72758dac-3e05-44a0-8db8-b34b966597fa","resolution":{"observed_at":"2026-07-08T09:24:49.114491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.117719Z","title":"Generalizationguaranteesforlearning score-based branch-and-cut policies in integer programming.Advances in Neural Information Processing Systems, 38:118669–118699, 2026","venue":null,"work_id":"29edec02-9672-4f3d-9a19-8f104bd28129","year":2026},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:9dc9e3edeb00566d52d82e8d187f6b8df037371928f8070529246be45217dcc1","observation_id":"64c06a99-9b67-4832-9e00-f58a4c5e245b","resolution":{"observed_at":"2026-07-08T09:24:49.119347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.123697Z","title":"On the complexity of branching proofs","venue":null,"work_id":"6a07a60c-7fe9-4634-ab90-3679f1d21cee","year":2020},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:a036bca653988d6c8bf22ffafd2acb7294492e416bb77f9d244dc4c76fb2dd1e","observation_id":"ec3f2a50-8416-48f6-a814-1e7667da6381","resolution":{"observed_at":"2026-07-08T09:24:49.124817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.103635Z","title":"Lower bounds on the size of general branch-and-bound trees.Mathematical Programming, 198(1):539–559, 2023","venue":null,"work_id":"a0a77b6e-3d8b-4034-a48d-dc0d97ed11d2","year":2023},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:1af737bd801cfa4e5ace54bb7c4956079d588d6e05440b5a1979f098b3ebad16","observation_id":"5a1b7c80-8f42-42dc-8b60-b15803b3451d","resolution":{"observed_at":"2026-07-08T09:24:49.105026Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.101444Z","title":"A theoretical and computational analysis of full strong-branching.Mathe- matical Programming, 205(1):303–336, 2024","venue":null,"work_id":"0e31e4bc-a1c1-4226-9bf4-86d5d8f947fc","year":2024},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:c32ed5951b586ea33deb4859d1543e102a816d617d51219e44103c5173d102c1","observation_id":"63b21a2d-1b26-4045-b5e7-e3d91ca229d2","resolution":{"observed_at":"2026-07-08T09:24:49.103004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.107418Z","title":"Cutting plane generation through sparse principal component analysis","venue":null,"work_id":"706fa8cd-ace2-4a9d-af3f-fb8a78411062","year":2022},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:952e1d1aea214b6dfd5cc2cb05423f397933d89ca9afd80c46259f0a92650700","observation_id":"840d946f-9c03-4768-ac7a-5915f61e4cf8","resolution":{"observed_at":"2026-07-08T09:24:49.108632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.097681Z","title":"Theoretical challenges towards cutting-plane selection.Mathematical Programming, 170(1):237–266, 2018","venue":null,"work_id":"c0202a96-4336-4089-b4ed-135f053940db","year":2018},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:d6c0baa82e2b9f9833090cef1fb76528f9471dbb834868605d5d7f8950bb063a","observation_id":"2642471d-5865-4094-942c-844aee3eaf5b","resolution":{"observed_at":"2026-07-08T09:24:49.098939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.091753Z","title":null,"venue":null,"work_id":"2c49b2d6-6005-4c63-8286-7b2a9e932428","year":1958},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:e0b515738b8494917b7ddb8a97a713a122a759be7316df46e6f258a8f4d375a5","observation_id":"1dd664ba-c323-4f55-aa7a-0f813d182f06","resolution":{"observed_at":"2026-07-08T09:24:49.092856Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.093399Z","title":"The strength of root cuts in an extended abstract branch-and-cut model","venue":null,"work_id":"7380d9be-8424-4418-bed3-a9c55f54cd6d","year":2026},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:5e62f3efe8f452c9322c872c864d4694af6b31ab355adb4d70219efc02a66ea3","observation_id":"1afbfc37-6e4c-4b30-b802-c0df1626fa29","resolution":{"observed_at":"2026-07-08T09:24:49.094875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.095483Z","title":"Liebling, Denis Naddef, George L","venue":null,"work_id":"70ea732c-8e23-46a5-a286-98c8097194e0","year":1958},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:545158f8878eee7b69059620ba4da7639a5afbd31e59dbb26abca36de64b2bc7","observation_id":"ce6d3619-a250-404c-8a91-fbf294791dca","resolution":{"observed_at":"2026-07-08T09:24:49.096788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.099487Z","title":"An abstract model for branch and cut.Mathematical Programming, 206(1):175–202, 2024","venue":null,"work_id":"53f9cbc6-0533-4a84-9d2d-d76039600928","year":2024},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:d63e09dc660c21ef93a701325c2c7117ad88118adf2531b501f176cbc93f7e38","observation_id":"75fa5e8f-26fe-4c6d-8e30-f21bccb2c9ce","resolution":{"observed_at":"2026-07-08T09:24:49.100868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.105678Z","title":null,"venue":null,"work_id":"06d602af-872b-4aa3-8daa-087c24f05cfc","year":1960},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:30697b2cc594360308fb99a99b1aa5b712c643c8e5acafc63e2a83dd34f9f813","observation_id":"f0865608-5da4-4e06-8284-4f96f801140d","resolution":{"observed_at":"2026-07-08T09:24:49.106856Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.087799Z","title":"An abstract model for branch- ing and its application to mixed integer programming.Mathematical Programming, 166(1):369–405, 2017","venue":null,"work_id":"e716e93b-48fd-4aca-8ab5-a311ae7b069d","year":2017},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:66b2fd44ed68d0f5ed32574fd173d8019422185ce60427c76395e14af8513a5c","observation_id":"71dc87f3-62a4-4f8a-8a9f-262af24f2c09","resolution":{"observed_at":"2026-07-08T09:24:49.089227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.089856Z","title":"Non-monotonicity of branching rules with respect to linear relaxations.INFORMS Journal on Computing, 38(1):53–66, 2026","venue":null,"work_id":"33a4a1e7-7835-469d-81f5-f39590645257","year":2026},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:2386aaaa50a4a175920fbc78e734dae90927ca231659999c883dd00aa570baa8","observation_id":"e1448475-f30d-42b6-9837-acd739f10e20","resolution":{"observed_at":"2026-07-08T09:24:49.091127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-07-08T09:24:49.085836Z","title":"Lexicography and degeneracy: can a pure cutting plane algorithm work?Mathematical Programming, 130(1):153–176, 2011","venue":null,"work_id":"7bf21bea-b614-48f8-b120-0ca6cbdadafd","year":2011},"citing_paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-08T09:20:51.127674Z"},"links":{"citing_paper":"/paper/2607.06343"},"observation_digest":"sha256:9209e508521ac6a6e6d35dc3090f5f168dd0e4cf013136b760f43dbfa040e08b","observation_id":"bebdad51-bdb7-4f9a-90a0-0fcedee24218","resolution":{"observed_at":"2026-07-08T09:24:49.087248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.06343","last_updated":"2026-07-07T14:40:09Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-30T13:00:29.023828Z","submitted_at":"2026-07-07T14:40:09Z","title":"Sharp Logarithmic Thresholds for Cut Schedules in an Abstract Branch-and-Cut Model"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":18},"total_outbound_references":20},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2607.06343."}