{"as_of":"2026-08-10T05:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e605f02ad3c6ea4e52e33d89d4f9d61bcb25b33b7fc3edef4f9ccdc0d49cd3e","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T09:01:13.664744Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2601.15252/citation-record","integrity":"/paper/2601.15252/integrity","json":"/paper/2601.15252/citation-record.json","paper":"/paper/2601.15252"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:07.791401Z","title":"Symmetry-breaking constraints for packing identical rectangles within polyhedra","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:07.791401Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:8e3e87a332c471dc286da0303eb2e6a0a5a31f210478772b47bc2c0ef6c97f45","observation_id":"058b0ad3-6c98-48d7-aaaf-e1db68be69bd","resolution":{"observed_at":"2026-08-03T09:01:07.791401Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:07.866667Z","title":"Disjunctive programming: Properties of the convex hull of feasible points","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:07.866667Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:d2b492d7e0a5ebf8af43e61e8e2ecbd426f2824007a76908a7db0c7a536c33a1","observation_id":"ffe904ab-d1da-46e8-9e47-cdec4710400c","resolution":{"observed_at":"2026-08-03T09:01:07.866667Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17702","last_updated":"2024-11-22T10:34:25Z","snapshot_observed_at":"2026-08-09T15:59:40.427485Z","submitted_at":"2024-02-27T17:27:47Z","title":"The SCIP Optimization Suite 9.0","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17702","snapshot_observed_at":"2026-08-03T09:01:07.964672Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:07.964672Z"},"links":{"cited_paper":"/paper/2402.17702","citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:f57ad8d3997e4f934c01e032619dd8f5ca8d9712ecdf42d24edd85c1ac48f900","observation_id":"b1934216-173c-4798-aeb5-91c78e86acab","resolution":{"observed_at":"2026-08-03T09:01:07.964672Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2004.11.016","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces","venue":"European Journal of Operational Research","work_id":"ca1ebce6-cc3f-4e4c-9f4f-7508ef90eec7","year":2006},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.026207Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:a25b242365fac9371d9779f6c10933bbb2ed84ecc3f4c934ca8fb91982bed4c0","observation_id":"dde6e9cc-a611-45df-8802-0f6843cc2a5a","resolution":{"observed_at":"2026-08-03T09:03:55.724741Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0305-0548(03)00246-6","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An epsilon-accurate model for optimal unequal-area block layout design","venue":"Computers & Operations Research","work_id":"9ec4b977-0d35-4dab-aefa-8c23c90ad99d","year":2005},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.108357Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:5717cebeff0fa3d0b6e2bc6f6641f428e2514938f84f16fe131e1aa1cf3ce736","observation_id":"0bf9389d-79f3-4769-a3b3-fa24c3bab702","resolution":{"observed_at":"2026-08-03T09:03:55.354830Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:08.174039Z","title":"Atomic Decomposition by BasisPursuit","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.174039Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:b132d9be96d9df1f15b2a82e50233ca7ca50100989d957bc7061e0417a1d5a79","observation_id":"79914782-a955-4132-a78e-b1b3915b14b0","resolution":{"observed_at":"2026-08-03T09:01:08.174039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-59250-3_13","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Verifying integer programming results","venue":"Lecture notes in computer science","work_id":"83992bfb-2aff-449c-91a7-9e28014fd65a","year":2017},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.236437Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:b31c4ba419e48c6df1659315d868639af2d9290a3f4f80f605ee5e047a0fa077","observation_id":"19092f8b-e5c0-48d7-998d-f0febc80ca7f","resolution":{"observed_at":"2026-08-03T09:03:55.011022Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:08.292827Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.292827Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:be6b4c7c9f3548ef761b390bbea0c60f5378e1a0583b64091b422ca517377021","observation_id":"2abc97bf-b99e-4b8c-892f-35e31514fd91","resolution":{"observed_at":"2026-08-03T09:01:08.292827Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:08.348515Z","title":"A computational status update for exact rational mixed integer programming","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.348515Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:d622849b3d98933821c8c55968097c7c8ed70bcad5bb0821df3e0f81f99ce4b4","observation_id":"257d295b-a42c-4655-b1b0-a14fb857b1a5","resolution":{"observed_at":"2026-08-03T09:01:08.348515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3485630","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture","venue":"ACM Transactions on Mathematical Software","work_id":"bd1a4baf-fb2f-4d6a-93bc-1e99a0468148","year":2022},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.390532Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:e95f9dfee3a40a3f356a4315618ca9679a36170cd3c7c1ff80e444475250f66a","observation_id":"5bbde202-f058-40e4-baab-ae70665cac82","resolution":{"observed_at":"2026-08-03T09:03:54.774757Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:08.453648Z","title":"A survey on the cutting and packing problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.453648Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:8638b5db91420c7f6dc9fc6ae0074eed4923f05105595ceb9afdac206bed9f1b","observation_id":"71a2eee3-fa58-4d8c-a1ca-f983c2096a8c","resolution":{"observed_at":"2026-08-03T09:01:08.453648Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:08.542867Z","title":"An Exact Formulation for Multi-Workshop Facility Layout Problem with Clearance Bounds","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.542867Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:fb30af0025efdd3bc132b66f208d4cf8ea72b6a79da89551e7eac2a0e9c856fa","observation_id":"d3975dc9-ad86-4b00-958e-8dcfe5abd0f1","resolution":{"observed_at":"2026-08-03T09:01:08.542867Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:08.694937Z","title":"A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.694937Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:a21e701cc2f59a3cc3439e226b8605ed50cebdab766289432b1903566511d07d","observation_id":"1681c5cb-136d-4496-b66d-b631b55a2ec2","resolution":{"observed_at":"2026-08-03T09:01:08.694937Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:08.789969Z","title":"Fixed and flexible shape facility layout problems using biogeography-based optimisation algorithm","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.789969Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:4f2dccfada0cc5fe0d436e82b3d671b4199515b5c7286ac9eabf0b8ece1a3c2c","observation_id":"8b758aa5-1fcf-4d2c-ad25-8b066a1a1935","resolution":{"observed_at":"2026-08-03T09:01:08.789969Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:08.852508Z","title":"Unequal-area, fixed-shape facility layout problems using the firefly algorithm","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.852508Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:9ed8ba5da597ddc72c2cd9f7b4925e6221dd94d98b550b4cc97e5efb5a25a1ea","observation_id":"a391cd22-d633-4e2e-8677-e3a6d71b6ba0","resolution":{"observed_at":"2026-08-03T09:01:08.852508Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0121015","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Modelling with integer variables","venue":"Mathematical programming studies","work_id":"7dbb1971-9b17-4f43-a55e-3f5d3b8488b2","year":1984},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.916861Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:1fcafaec7c5ad0a44ac0f4dc7ba683b76d990e34ee8aa28d97bd9f8a90418945","observation_id":"061cf41e-42a1-4a3d-8620-e32ab362453f","resolution":{"observed_at":"2026-08-03T09:03:54.284752Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10107-010-0417-z","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On verifiable sufficient conditions for sparse signal recovery via L1 minimization","venue":"Mathematical Programming","work_id":"9702b720-5a1c-4e9d-a517-46f71e48d959","year":2011},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:08.991734Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:5ab2ab9837595b760307f8c9fe0cb0c564789fffa97919e142fe6c26da97fd35","observation_id":"f5d3f398-d5ee-47a4-a666-bf18adf36e49","resolution":{"observed_at":"2026-08-03T09:03:54.001859Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:09.057815Z","title":"A biased random-key genetic algorithm using dotted board model for solving two-dimensional irregular strip packing problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.057815Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:b834a1a2c2c5ef1511442a01c2a2d0bf119455787e6ab7a3ae44c7085e3a372f","observation_id":"efe35fde-6b81-4528-86a2-b77d36221b82","resolution":{"observed_at":"2026-08-03T09:01:09.057815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:09.131058Z","title":"Construction heuristics for the single row layout problem with machine-spanning clearances","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.131058Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:ea793bd34d767604f436c11e514a149e2bcba941b325e7bd44f5b6e2d17683ea","observation_id":"adc59695-1faf-490f-a33c-9af50afd0506","resolution":{"observed_at":"2026-08-03T09:01:09.131058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-04651-4_46","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Integer-Programming Bounds on Pebbling Numbers of Cartesian-ProductGraphs","venue":"Lecture notes in computer science","work_id":"2e9fdd57-ab12-4e54-90f1-019486b2d03f","year":2018},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.329089Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:fd9f6545245f7f0d74faa2eb1b6da48b29267b218e37b61f4362e685fed06ce5","observation_id":"6f080049-4615-40a3-a584-90d710643a1c","resolution":{"observed_at":"2026-08-03T09:03:53.649865Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-49988-4_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Using Integer Programming to Search for Counterexamples: A Case Study","venue":"Lecture notes in computer science","work_id":"ec4ecfbc-4dd2-4395-a07f-f3686cdb654f","year":2020},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.419784Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:efae19816fa4f57623be70cf29315e5f3f9cfceeab6caf1f08e13fb2646c91ec","observation_id":"8047edf6-3f16-4f4a-aa9f-fda50290b85b","resolution":{"observed_at":"2026-08-03T09:03:53.052765Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1177/1687814016652080","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Visual nesting system for irregular cutting-stock problem based on rubber band packing algorithm","venue":"Advances in Mechanical Engineering","work_id":"718c56f7-bb22-4eb5-8a2a-9cb31ddb6a3c","year":2016},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.468158Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:29f3eea3d01d14b12bfb3a4cc384fb30c01d2eaed6e7a0eb696bb151aefaf989","observation_id":"0cb521f5-865a-4213-a0b0-8d2bf70e4407","resolution":{"observed_at":"2026-08-03T09:03:52.815863Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:09.547070Z","title":"Two-dimensional packing problems: A survey","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.547070Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:c6d4a92fcc8d0a0e0b1336c73a780709461a0531ae483f1389b33474b46eec6c","observation_id":"3ab4097a-48db-4840-b396-7d35ea37781c","resolution":{"observed_at":"2026-08-03T09:01:09.547070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:09.715708Z","title":"An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.715708Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:e3b8ba8bbf02506957808760cee85d0328a3a96af964a87b1fdf62a27141ebdc","observation_id":"c8845625-c282-46c4-9885-4f4464b07865","resolution":{"observed_at":"2026-08-03T09:01:09.715708Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.orl.2006.10.007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Applying the sequence-pair represen- tation to optimal facility layout designs","venue":"Operations Research Letters","work_id":"e15b2ae8-4bfa-4624-9e0d-f937a272fdba","year":2007},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.779074Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:56aa269f5d47b33e0004f70cd697c0e46aef5b3d511612392c5fd56d3431fb4e","observation_id":"e546a4ba-a154-4e36-afd4-131a5d1b84a5","resolution":{"observed_at":"2026-08-03T09:03:52.134162Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.eswa.2017.03","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:03:51.839093Z","title":"A biased random key genetic algorithm for open dimension nesting problems using no-fit raster","venue":null,"work_id":"309c60dc-fc4d-4cbb-b64b-c2e76651aaf8","year":2017},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.833699Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:d87d7c8afb36466eae5bee41671f68f84d420e6fc39aa6b778707b087e1d5620","observation_id":"a1784e18-9f31-4915-87e6-29cbd7fd4349","resolution":{"observed_at":"2026-08-03T09:03:51.904429Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:09.907746Z","title":"On the degree of Boolean functions as real polynomials","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.907746Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:73950c9e6737915b10ce9911436e3765a28a02f7fd8d89b723713c4bcda9a886","observation_id":"96733a95-fa63-4bb4-818e-ae4821908cdd","resolution":{"observed_at":"2026-08-03T09:01:09.907746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:09.991867Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:09.991867Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:f58695cb078def17a284eba7c3866fae74e48800c75dbc62f80b9f8236b48560","observation_id":"06a8a4a5-46da-4bfa-a206-bb4898dfd115","resolution":{"observed_at":"2026-08-03T09:01:09.991867Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4613-1379-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Locally Ideal LP Formulations I","venue":"International series in management science/operations research/International series in operations research & management science","work_id":"1ce913cc-ffed-46be-9635-1c534aa501eb","year":1996},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:10.074918Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:9f2f38a1d2b0c877b189c4bdc7308623b6bddd64255b07868ea5650bc005d8ad","observation_id":"efd90179-851b-4c51-8288-f602081cd3a0","resolution":{"observed_at":"2026-08-03T09:03:51.540279Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:10.162122Z","title":"SOLVING IRREGULAR STRIP PACKING PROBLEMS WITH FREE ROTATIONS USING SEPARATION LINES","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:10.162122Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:8682ec36946835e94ccb109654e47d95957532607e87888fede29c03f35ec873","observation_id":"b1788452-2a5e-4bff-88c8-a13cd8d5a579","resolution":{"observed_at":"2026-08-03T09:01:10.162122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1090/mcom/3461","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cutting planes for families implying Frankl’s conjecture","venue":"Mathematics of Computation","work_id":"1b001cd6-d68f-4bd4-9ff3-98073ce01bf0","year":2020},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:10.188544Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:267bd8570ec39dfaa37d2373e883dd9e4762ca56ffed28fb145b9e8ed0a127f0","observation_id":"c2f2da8b-b8ed-4701-a8a3-92dd7f43888e","resolution":{"observed_at":"2026-08-03T09:03:51.356622Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.cor.2016.11.006","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A clique covering MIP model for the irregular strip packing problem","venue":"Computers & Operations Research","work_id":"c4e55228-1da5-4ed1-b354-bcd5211161c4","year":2017},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:10.278074Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:7c65f7dc7c7ca55cbfbddaa1974198daa92a7381c01139bb89ca2e7d7f52b1f7","observation_id":"c014bd56-a9d7-47ac-af6b-ed1369c45737","resolution":{"observed_at":"2026-08-03T09:03:50.827767Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.asoc.2017.09.003","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Solving an extended multi-row facility layout problem with fuzzy clearances using GA","venue":"Applied Soft Computing","work_id":"43a5529b-50ae-40ea-a4a4-63fd8fc58940","year":2017},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:10.423664Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:be7bdd5700c608c35109307216c9c102e2f340f630287f4f7c42575d14170672","observation_id":"5fd5fbe5-384e-4327-ae2d-fe7272809eb2","resolution":{"observed_at":"2026-08-03T09:03:50.634016Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ifacol.2018.08.297","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A study in pairwise clustering for bi-dimensional irregular strip packing using the dotted board model","venue":"IFAC-PapersOnLine","work_id":"0c340707-2e0c-4808-ab35-b1edaa670f34","year":2018},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:10.578363Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:e500d360f8a967493565815d7e63825ff743490cbde9ce5712dea42885f55eeb","observation_id":"ad1069d3-be51-4d33-a13c-54a48945315d","resolution":{"observed_at":"2026-08-03T09:03:50.349546Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:10.686719Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:10.686719Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:773e317480365b697a10695324eee44fcc451384699ea95e230527c7b5f1fb17","observation_id":"2eb1e726-1df0-41ab-8fc1-a32768799175","resolution":{"observed_at":"2026-08-03T09:01:10.686719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1287/opre.51.4.629.16096","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Enhanced Model Formu- lations for Optimal Facility Layout","venue":"Operations Research","work_id":"c8b34f93-62fa-4881-a7f3-cec951ae99a7","year":2003},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:10.794886Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:69bf2c855def73720a11845208de0155c2f32352955bee5192323200101ad2ca","observation_id":"26667237-6b59-4bf1-b0da-114736b53905","resolution":{"observed_at":"2026-08-03T09:03:50.094648Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2014","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:03:49.734844Z","title":"2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems","venue":null,"work_id":"a0342ddb-e12c-40f5-92c3-c3e4f56ab7fd","year":2014},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:10.937491Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:61e90a45c44218cf7ff958d5b1174d24625107053f640f19f15c5c8d39f6b92f","observation_id":"67109192-92cc-49da-9539-6dd4cde44950","resolution":{"observed_at":"2026-08-03T09:03:49.862476Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1057/jors.2015.94","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear op- timization","venue":"Journal of the Operational Research Society","work_id":"ae12430e-ee61-4ad4-aa30-fa99c90bb6c6","year":2016},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:11.099747Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:aa86ffb346d40e8c257bdabdf1cf1d117cc1195db54d77fd4c29259d37c32f65","observation_id":"3ba995d6-ae59-4a1d-a493-e8243fd5776f","resolution":{"observed_at":"2026-08-03T09:03:49.595892Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s10589-019-00114-9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Computing the spark: mixed-integer programming for the (vector) matroid girth problem","venue":"Computational Optimization and Applications","work_id":"f3b1c082-fbe7-4a1b-aa10-405452c3f19c","year":2019},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:11.211534Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:ff5baebd350a661b757d2b0044da98fef707cd1ace1f331c9629fb92d3322be1","observation_id":"98e93f17-3261-4609-9a39-2d4300eeeb08","resolution":{"observed_at":"2026-08-03T09:03:49.359500Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:11.322765Z","title":"The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:11.322765Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:3e3723d9f34b69c1f862c0455a25cfe20250dcf4efaba5d53e253ba29bc32fc7","observation_id":"076dc1b3-9c79-468c-ac02-aab6354c0e57","resolution":{"observed_at":"2026-08-03T09:01:11.322765Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:11.479084Z","title":"Zoning Constrained Machine Layout Problem with Mutual Clearances","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:11.479084Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:d7e4bec06e5f30611a35bad2052c5a4afce547b7fe47452f681d60e875a789af","observation_id":"c4e7a95e-6474-44b1-913a-ff63dc5ceeeb","resolution":{"observed_at":"2026-08-03T09:01:11.479084Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:11.623815Z","title":"Embedding formulations and complexity for unions of polyhedra","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:11.623815Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:7df73a99c89e0b7e5aba5a8da43534a53e22848f4fe68cf687a13a1cb2925542","observation_id":"d806d0b3-796b-4160-a324-8c19e3c8d307","resolution":{"observed_at":"2026-08-03T09:01:11.623815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/130915303","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mixed Integer Linear Programming Formulation Techniques","venue":"SIAM Review","work_id":"7a7f4493-d256-4754-bd8d-b2455cf59050","year":2015},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:11.913059Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:644c425cf6c4c83f87ff73edb954df18975a14bac7e18c1fdd55962707f6fec6","observation_id":"c91f6d51-58d6-4cbe-b679-3fc75653fe4f","resolution":{"observed_at":"2026-08-03T09:03:49.142525Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-03T09:01:12.110108Z","title":"Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:12.110108Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:34827f63b20911f1ea4bd17ba7f66a924ffbdd5cec1e0b233e9151892b70d5a2","observation_id":"6b4a7ba8-f0d3-490a-b063-905351d7b3c4","resolution":{"observed_at":"2026-08-03T09:01:12.110108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:12.244123Z","title":"Wolsey.Integer Programming","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:12.244123Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:6a789386a8f03661087724ac8709abe707130a5429f235d6b93f1fd83e9d0a2e","observation_id":"b652c1ca-8ffb-40dd-ae7a-69d656beee59","resolution":{"observed_at":"2026-08-03T09:01:12.244123Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:12.397130Z","title":"A hybrid multiobjective GRASP for a multi-row facility layout problem with extra clearances","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:12.397130Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:f3fb69cf5bcbd8432bd23f7f674065b012ebc5792e1febc81ddc2181a839b81e","observation_id":"aafa1657-77a5-46cd-a665-cbf7008a38ba","resolution":{"observed_at":"2026-08-03T09:01:12.397130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:12.604851Z","title":"A tabu search heuristic for the single row layoutproblemwithsharedclearances","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:12.604851Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:0a2c7285d2417698d32cafa695a5229580cb4aa05b29f2e169db03e9d43908d7","observation_id":"5d01c127-de73-4b54-a3e7-e7890888929d","resolution":{"observed_at":"2026-08-03T09:01:12.604851Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:12.714769Z","title":"Sharing clearances to improve machine layout","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:12.714769Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:3f2a720a24eb9ac721f96e11b56eea9862679fd6f4afcf680582c56f6c94d747","observation_id":"6ac361dd-f6bb-4f09-8266-65e81f9f0e09","resolution":{"observed_at":"2026-08-03T09:01:12.714769Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:12.846043Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:12.846043Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:7fd1f44d34ae34ad402525bb35f3ae3f9c3f1cb6d13133cd26f853e612def541","observation_id":"1bb96bdc-6bca-4828-9a58-32d629c3e1ce","resolution":{"observed_at":"2026-08-03T09:01:12.846043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:13.070211Z","title":"We have already shown that this is a contradiction","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:13.070211Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:ecaabbf48ce2d98231c123d66bf600cad6862b612dc3d483cea9c6ee5b7b8961","observation_id":"661c7482-d590-4d45-87da-33e6f37f3356","resolution":{"observed_at":"2026-08-03T09:01:13.070211Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:13.130244Z","title":"However, (SU.d) is linearly dependent with a tight (16g) in the directionˆtand tight (16h) and (16i) in the direction ofˆs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:13.130244Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:d80f9c6dff755f1ddf5ebe1da6a8ae12cd239ad57dbd99a5e08d1a0c9d9f6fa5","observation_id":"59c76feb-b228-46dc-ab76-47f55cfcaeb4","resolution":{"observed_at":"2026-08-03T09:01:13.130244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:13.222953Z","title":"But the projected system (16) has only four variables and cannot support five or more linearly independent, tight constraints","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:13.222953Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:ccde73e011ddee434afc0aa8bd24a721ec05b7bda921d025f96f9a8cef137539","observation_id":"e0f06135-dbaf-4e07-8491-aa8b59de0d55","resolution":{"observed_at":"2026-08-03T09:01:13.222953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:13.291940Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:13.291940Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:295f59528168f2cd04c875edc1e39d1693a6a1dd7eb59e666f07fed4f92b8a42","observation_id":"3cb8def3-c737-4177-8844-9f6c9377c84d","resolution":{"observed_at":"2026-08-03T09:01:13.291940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:13.415479Z","title":"Thus, SB-L is not generally pairwise-ideal","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:13.415479Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:66457ea801dfeab9696722cb2084451efce7140afeda347f5dbb3bb95fe4f89d","observation_id":"fbbbf49a-421a-47cf-b6f8-e92018567e6a","resolution":{"observed_at":"2026-08-03T09:01:13.415479Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:13.535583Z","title":"Thus,N Uis not generally pairwise-ideal","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:13.535583Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:c69121371c9070c36376ece7129c9b7f63a456734d3d870fe2d6be4564486c28","observation_id":"12b7aec5-2ea3-4f5f-908b-97251a86e354","resolution":{"observed_at":"2026-08-03T09:01:13.535583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T09:01:13.664744Z","title":"SeeCounterexampleSU.nbin our repository (footnote 2) for complete evidence","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-03T09:01:13.664744Z"},"links":{"citing_paper":"/paper/2601.15252"},"observation_digest":"sha256:df3d7f158c2bd5536eabd9ef943ef3e816e14f3114726e8cfa7a02898f1acb68","observation_id":"c66f1e4a-5d56-4106-abab-ce51232288a3","resolution":{"observed_at":"2026-08-03T09:01:13.664744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2601.15252","last_updated":"2026-07-06T12:04:36Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-09T16:01:38.306880Z","submitted_at":"2026-01-21T18:35:20Z","title":"Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":8,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":21,"verified_fuzzy":0},"total_outbound_references":56},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2601.15252."}