{"as_of":"2026-08-18T22:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:37ae45b7b6f57fbbc66fd42d62d7a4a7acc3948a06fd7f190b1b0c61762b15e8","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T04:36:35.448951Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.09222/citation-record","integrity":"/paper/2607.09222/integrity","json":"/paper/2607.09222/citation-record.json","paper":"/paper/2607.09222"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:36:35.448951Z","title":"Extended formulations from communication protocols in output-efficient time","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:deed0d744f5c4bccfd8d2f79c3f04b3083d77db98447b809624e2e95ccce270d","observation_id":"3f9ea0b1-db7d-438a-b697-beb95341f32f","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"A comprehensive analysis of polyhedral lift-and-project methods","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:eaa2958fea9039a761f1d8f777f4e80d4640b15df86a05c416ae83f8ace62bb6","observation_id":"42f4d0f2-4f89-47f9-99d9-7a47bc4bbe4d","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Mixed 0-1 programming by lift-and- project in a branch-and-cut framework","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:58248528ec04bb32641a84dc7c872884405add05dda1af39b6344b006a324744","observation_id":"98285ab9-b0f2-4dcf-a524-b06aba5f08cd","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"No Small Linear Pro- gram Approximates Vertex Cover within a Factor2 − 𝜀","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:1d5b83dddcf1192c63bb3665c29f538a9f5bb18199445750a9e384f8c182c62a","observation_id":"210c3fe5-c4e9-46fb-89f2-4ff9a7d822b3","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Approximate fixed-rank closures of covering prob- lems","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:fdbcedf23f902affa3020440f07b7f58672fe54ee00c5a24ee50b8083e14bd4b","observation_id":"13bfaf1e-cbc9-454e-88f9-304311e4d37c","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"On the Chvátal Rank of Polytopes in the 0/1 Cube","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:43bbb815f56fa1d8867882595bf1b5c2c6ee77ec550768699a547c5110695a49","observation_id":"ebd5f90f-c437-4470-ac98-ffa6b5dbb320","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Primal separation and approximation for the 0,1/2- closure","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:8badf7a0ccf95bf971a9d9623c72e6abbb504452572e5f94208bf426e6b2e529","observation_id":"74d46358-612c-4c44-92ec-073c501c764b","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"On linear and semidefinite programming relaxations for hypergraph matching","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:89d81a929ae7f51cf79276bfafac5cfedfebf8043b979154496e924a541fd770","observation_id":"b4116afe-372f-4c0e-bdc5-38c8286cfb31","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Edmonds polytopes and a hierarchy of combinatorial problems","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:3f660760832a4ecc3014e4aea71e56591e90e37783a3c537003d78c76e3f613a","observation_id":"4ded3a49-26b1-452c-bacf-cace01418381","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"On Cutting-Plane Proofs in Combi- natorial Optimization","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:76c996c15c1fc9d692742d087c723eee284cdf9f554c7b6e7dd8f308c5474588","observation_id":"04028ad8-edb4-439a-bff5-55cec87193cf","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Integer Programming","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:24a9413ab5a6a37e0aed1691da3a6ddf97b1881e79ee2fb8197fef9ee75a72a9","observation_id":"831dff76-280a-4ac0-9fa9-eba8f89e2b91","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Cunningham, William R","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:325e472b67dd1e5628158b81d768f943defc87a5da1acd6f9c1fcbf626432f47","observation_id":"0b5d19cc-05da-4323-af1d-7e17a61b2686","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"On the rational polytopes with Chvátal rank 1","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:8364078741f7eba01d5b763248a557eb4c250dfab1411e24170942381cc94335","observation_id":"3d58487d-d0b7-482f-ae36-c56a9b66b9ce","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"When the Gomory–Chvátal closure coincides with the integer hull","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:630736ce2e9a07815c28e37fe5f2d2d541c4080ac81f73608c9045932bdb00c2","observation_id":"06e99ee2-dc64-43c0-8a04-020914fbe314","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Improved approximation for 3-dimensional matching via bounded pathwidth local search","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:e9eaa07eebe2e058f53f51f50de492e1cff5c1ddcfe1ac9e35d1e65fa8f2d306","observation_id":"863ca5d4-1275-4e02-87ec-ca8421f499d0","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Decomposition principle for linear programs","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:d4ce34245779f1add90da2a57f642d7982e44c71789c8696bcb9a3f4777e48dc","observation_id":"a43dfbc9-25f0-4371-8a72-004ddc6a8674","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Maximum matching and a polyhedron with 0,1-vertices","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:09a1a6dda4686df95e20208e90aeb7f6aa6b384ad79696f5f4b08761e357893b","observation_id":"fe0d472e-adc1-40fe-bc70-6eda46958fe7","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"On the membership problem for the elementary closure of a polyhe- dron","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:03a30ad7d80b09394514e386477ea63c0e344f18e8c37fbd96a32cf5e182aa49","observation_id":"d607a2d2-3e56-41db-8f46-d96085f05155","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:5924ccf1bd3df2e4603f4074a4941d10e13d449333ede71015940b1c380a9652","observation_id":"aec8871c-15cd-4983-9bcb-4ebe9f6a6407","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Strengthening convex relaxations of 0/1- sets using Boolean formulas","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:94838554b26404f8937a0f3e109e98f66411313746742acfdf81e17f6d21008e","observation_id":"67a94ea8-7e77-4100-8d0c-840614b96101","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Approximating the k-Set Packing Problem by Local Improve- ments","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:f722cf151dfecb0ea54cc5dc6f32c76a5712d2ae728a97b9f0e412916c137fd0","observation_id":"824c9583-ce2b-42aa-9e23-0307e7b95131","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Faces of an integer polyhedron","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:4485fc1c9951be30e72caf930e6bad12a9dd71ef94d3dcd64fe7fe949144658d","observation_id":"a51b0d98-ab26-4078-9c02-f407db39c89f","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Outline of an algorithm for integer solutions to linear programs","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:fc0008e5dd8109f20919d4f944d1b24191f650907d0c53b3da175ca4ef2f99f1","observation_id":"e15314bb-e886-4fc8-bd47-c1ae1951e533","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Randomized Communi- cation versus Partition Number","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:770a347b224af46c67b63f7edd6c29307c26687de89234bec2204ad5340e8f39","observation_id":"67c12943-29d8-484c-ae02-ca5f294a4d62","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Deterministic Communication vs. Par- tition Number","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:6b62188908fd14969e24a50574fc9687fb36d904297fb8b67bbe43ec6d042958","observation_id":"285c14a1-0375-4b67-b84c-b6a5439c16f5","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:07ed6fbca30e1c44fbe578832dbacf013da038ebb6dd905ad3de8e7f92402083","observation_id":"9af5a442-7caa-420f-9043-82b1a762f9c2","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Integrality Gaps of Linear and Semi- Definite Programming Relaxations for Knapsack","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:f46b5ccef45a86ccd3997405176758a9821749788ef5da0c7428f22f6f0be078","observation_id":"cc15241c-13cf-4bb1-b4be-9df0b87130a3","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:c075684be921cfcf8f50d5db05ae2624d3e27bf50c74f34d7e3eec0662b93ee1","observation_id":"159c2c48-3789-488d-a7cc-48d42dd84e56","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"An explicit exact SDP relaxation for nonlinear 0-1 programs","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:bc7834467ebd967e2ce479f95bc937e47e25844332377995cba8b23cf078d84e","observation_id":"e8ac2933-1bea-4868-8d57-e048c52f5cef","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre re- laxations for 0-1 programming","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:8c4df7503ea051f3207bd4c99dd67f44e419912f5edabf3f31d180e7f14cece9","observation_id":"4f938b1c-7ef4-40fc-9730-1ec32bfbb92b","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Asymptotically Optimal Hardness for k-set packing and k-Matroid Intersection","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:7ac64600cc8dd8fd9d9a61f7a9dcef13ac32378c8f346a370917055c2c7d17ec","observation_id":"02c5d207-1d0d-4a84-9c0f-e9258c16f99b","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"On the Shannon capacity of a graph","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:05f62f86868e5596204afba8f058e25f1a41bb327e73b2dff82ffc1cef21a04e","observation_id":"01c39384-30ec-4108-b47a-1975ac6f7fde","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Matrix cones, projection representations, and stable set polyhedra","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:1c3742172e522ab5b3ceba007f698ac250e401be216dbec44619e91c95e7fee0","observation_id":"e9fb6f7e-424c-43b3-8584-eb293b29b41f","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"High Degree Sum of Squares Proofs, Bienstock-Zuckerberg hierarchy and Chvátal-Gomory cuts","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:c8290b7f267f9073d56d28713b3343f073ccc5f7d5502a7248d4d51ddac47244","observation_id":"071dacaa-ce50-4a4f-97a3-0f07c9b3ed17","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Sherali-Adams relaxations of the matching polytope","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:5b9a59f9488ffd050f80a5509d75618da09aef1a7db393e57ba377b9d72f22d3","observation_id":"66e32a34-eb2d-4037-b816-c47ec7cbbd25","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Nemhauser and Laurence A","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:382b17757ce5b55d00e363dad804e70a9f6e2ad7fd67b6c89e33f3ab70d36f34","observation_id":"3ea8e80e-a883-4dd4-94af-255bda446be0","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Communication complexity: and applications","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:678866f3f393460c9885db8e37ffc4d75518c3bca0fd5425c157954df26d7db0","observation_id":"36c870bf-83d7-47c2-a398-8c89e3c4978e","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"The matching polytope has exponential extension complexity","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:a94af2dd3ca75902353d3bfa0945ba1738f1b2b170c0dbf039ad5b579b09ab3b","observation_id":"2c133e09-4cc5-4da6-b35c-d04377ca19cf","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"0/1 polytopes with quadratic Chvátal rank","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:16ebed79534f51e9365aad115603bd2529e2a59c7c11ee3459f0e71992065fcb","observation_id":"f4a00886-6f6a-4473-a7a0-b2f91d2e9dae","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Combinatorial optimization","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:9f9ec22e23779c70d262fa5818acd7e5474b00ef146cf0d2f4b47820b04d2043","observation_id":"f4f6865b-1cb9-4e0e-ba1a-f2a83173d63f","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"On cutting planes","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:0b2f90996794e37580ca5c4c582e61961a50703d21af20996248319fbd428353","observation_id":"7e546637-4de3-4ed9-a300-248d5d3b45e4","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Theory of Linear and Integer Programming","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:117bdbca7ce44881f70ffe487751a19e3204453ecd5e94eca78d44c08e71f372","observation_id":"15c03d25-a751-4116-b550-61617dd85c1d","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:3fcee1ce2394bd79219e230fc4d4a65a499763352122af118cc898cd9984dad3","observation_id":"30a7f1f1-af1f-4028-ba76-7cb029a22304","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Improving Integrality Gaps via Chvátal-Gomory Round- ing","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:8f4ea5b0495685ef0ca6a5307e38e5542a4f107b7c64b521ff210760d2dd18c2","observation_id":"d45f933d-151a-4b4c-9d85-de95fa9b9392","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Lower bounds for approximating the matching polytope","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:0b26c9663930864761f0879aae5d644a633e8287494f54094388f6846f69785a","observation_id":"4780ada7-6c44-41b6-bfcf-e974080c09e9","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Integer programming","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:fc688cb09a5417e6b1f010226f94531b3c2db3b0c7236b9395130f37799e6ab0","observation_id":"662f88c7-cdc0-419e-8388-4c0d27df9ced","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Expressing combinatorial optimization problems by linear programs","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:dc589f74811c716f8ed60e312732d83d8867e583f9a6fd91bc71e770cd848b34","observation_id":"7c27417a-e24b-47f9-8fc9-a0fe7a79050f","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","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-07-13T04:36:35.448951Z","title":"Expressing combinatorial optimization problems by linear programs","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-13T04:36:35.448951Z"},"links":{"citing_paper":"/paper/2607.09222"},"observation_digest":"sha256:697d10b479111d58fdab4155f87b3b2f14fc3118c8e7625ebe4756fb9498d483","observation_id":"0ad9c41a-c51c-4a07-9cca-c9bcfc0bd6d1","resolution":{"observed_at":"2026-07-13T04:36:35.448951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09222","last_updated":"2026-07-10T09:13:00Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T16:23:20.372950Z","submitted_at":"2026-07-10T09:13:00Z","title":"Polyhedral extended formulations that approximate the Gomory closure for packing problems"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":47,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":48},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 48 of 48 outbound references and 0 inbound Pith citation observations for arXiv:2607.09222."}