{"as_of":"2026-08-08T01:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:382f35cb8d57c31efde0eec8cd688c0f5b1c440dc4b0fa98d079cf4dab56c530","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-07T06:34:17.273281+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-03T09:01:04.806693Z","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:057ac2ba2055e63263492c71c86940def7dfcc5fee2499ac6e7f2b95d95537b6","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-03T09:01:04.806693Z","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:6bee7fdc791ae910edaeba6293e8dc06a54b7f96594bd769728d84a6eb691a0c","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-07-06T17:36:23.851926Z","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-03T09:01:04.806693Z","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:573ae6c4853869bcaa411bb4c2740cbdfdc19f676da8a4aca3ca6905e3849d01","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-03T09:01:04.806693Z","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:de06a9ac41b20b18a2c6906746b739dedb1a1089f81776311b249ee90df44323","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:ab4b048d32f12311b7bac9748f83f4d2b236a24fc0ef03fc8f1664f949e10013","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:54fdd2b5076a653fd8b8f2a2e0ce8b55f56d97bd556b77814eaf9c7bbb87f8e0","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-03T09:01:04.806693Z","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:4525c1ad09a8a3ce15c426698d5a2ed9873f1a632e2e60c9b0624fb08e9681aa","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:1366fce2f10166893b5be1207dceb7f8c9fee31276852420f449febfe578247c","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-03T09:01:04.806693Z","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:69cbfd28799c62a8be53a84851480e48cf0aac9efe4976d4f469ad9f7d2873c8","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-03T09:01:04.806693Z","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:f7ca552052fdcc412a31520d6b8de901b818f897ce9808d0d0383f59d723f0e0","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:4e4278f34445545edb3ce43e5759b72b6fdc486507d5d16c6b1d94bc035b33f5","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-03T09:01:04.806693Z","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:d0400577dca4a2d277c3a23f4890656cb772bb015375f7b4261e754e0db27a84","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-03T09:01:04.806693Z","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:456990fd4d2233a7bf7aba8283b6d89914d81ac58f3ea3c3e8eb233d87287f10","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-03T09:01:04.806693Z","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:2ccb61558787084400ca41fc099eda944cf297295184c3fcd76e50f9613dd239","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-03T09:01:04.806693Z","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:e8191c8617f9c40af397b69697ac9ac439387bceccec5ff03a2d949d6a81bf7c","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-03T09:01:04.806693Z","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:1badce9ef9eda2ddffde98447a270e78b687685b35112480be938f7a0f83777f","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:08d0f6796c41ddab09269650e356062c0992cb7e783b56b8793321fe04c90930","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:9902755f2e970c612e621229d3dec661fbc0aea83cd9379913c41f15dc688feb","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-03T09:01:04.806693Z","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:cc929e127db7f9b2bc37fa4c1b80df07b2d01b46b88d72b7eb5ac17e4cf05cc9","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-03T09:01:04.806693Z","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:2570b4d27a06d94452d90bd0d60610abe2f728e5cc1ec1d6940d8f5d34b92deb","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:b20fb57f87195e8e97d8fcbb807a7ee9e490abd012efd4fde0a4750aa3f4eaa2","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:54bebbc52944522116ddea4980d7e1d4ec11897e5d7c92c27a2408bc1195404b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:d424b72942bd102e8959315b1ea65d31780840bb75b4b50ab91ea2dcdb0edf32","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-03T09:01:04.806693Z","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:b9771bdfc7ec4fd0a3103b6a40d7376fdd8591b6578ca3644b86073938bcfe2a","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-03T09:01:04.806693Z","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:b63da232318ea86dff879d2ba56e7b4811305ba8f522818a287db0b205ce010b","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:1867c3d6a64c82937fbfe25afb01e5b4b01dee05c6b79b95f8251bb40286845d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:ec0ba10e54ef1b376e0fc3fc7a5bcf7bf88f72b16c1417edcaf6087363e99406","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-03T09:01:04.806693Z","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:188171976ed00809870cdf39d8795341381831d72623918149f22a988a3ece52","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-03T09:01:04.806693Z","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:93e303a0ada83c34dce8e8055c0a28ff2df06ab312f68ad4e2808569976920ec","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:f984717bc997c26bb479471c0f7a0bd38ac822f766e93c1f91184f50dd2b5e13","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-03T09:01:04.806693Z","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:4859d42a8515df616c2a23f66040961d4a085e3ee55e75366659e743275c6b32","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:5d96265d68040e1ff09ca9949d489fc1672d4d8180ed58d22e9c8d83996cfee4","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:3774af2b6f60d38bf548f7bcfd0ae0051007e18922fd4ceaf7f4447f6ac832c8","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:3d3fb0dfe0fd79d3ee06ccba8db9c0da37837496b3aa0ea6a26bbaede5170c5d","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:d666df2e4b8a6792514fdfc00ef14a70b3df7f82104bc392d2b61628241b7550","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-03T09:01:04.806693Z","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:b9969bc51762c40a9c96bfe189f496be290538bf18926292edfa50c979add74a","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:509e275ac804fe77f733eda868252534d350ff1b92980bd05963d1bae5b49ae1","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:866569639b11df065626b4b4de4cb4e5fb83dbda9cdf3a029c9530696cce2e45","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:d54817e0733fe2ca5cd53a4a1308ee293d524a3a44785a0338a62f00d9d0bc63","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:1d6d41b615bd33247362850c4cbead6f56459efa1730334a7480a6145c5265f9","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-03T09:01:04.806693Z","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:05da172b5d1e151cefa6f9b97c821d1764e3347c750592e6d50913406577df62","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-03T09:01:04.806693Z","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:cebbca6228ebb69b3e1ec0c07db326d6160c81f7ad43eb3c9098ac618f47fa2b","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-03T09:01:04.806693Z","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:f9d981ee96623a2504d98ea8a52d8230617db02d972a574fd4b993836ae443fa","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-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-03T09:01:04.806693Z","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:8c00a294867fa1cbbfb0c44b5de1261db6af1b4dea35717bce84bdcd45ad1fcd","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-03T09:01:04.806693Z","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:76caf7baa4bbb4066520254192bdeb95d7848f626b10a22cdd1cbd351e7ba4b2","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-03T09:01:04.806693Z","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:3903e21cb5229f965fdf7e94640e2e299ae54f53d6708d8f14381e71dd0fd85f","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-03T09:01:04.806693Z","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:f7cbb5a2ef861a534737dc7cfd90097e19d5195f3119d039ae3b09b826e457bf","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-03T09:01:04.806693Z","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:e388046e659d4c9fe92463d250624c6fac1435e4c5b182a32995341c438abebf","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-03T09:01:04.806693Z","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:985568ed4da7db33f4b2a63995e3e8f07071537df15a047ab99676a597d5ac33","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-03T09:01:04.806693Z","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:ad87c153535095f047ab382585aeda82ca80e926c9037e63c40124058a2a2c3b","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-03T09:01:04.806693Z","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:ef8577d2efb0d8b02ca0a7b0613ecb3d41d3cfb2bc17fa531324bac0a7697635","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-03T09:01:04.806693Z","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:e47953cc7640862ee17bb44059b7f8487a4d1d6945e503f167dce9d6c71dd622","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-03T09:01:04.806693Z","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:c6a25f31d541e5eab138f55ec1f8944cdbcc547f263830fad2dfc629f0046682","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-03T09:01:04.806693Z","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:5d454351acc29dd65a0264ff0a43496f7c34c06c901696e2431cdba6c0e8e291","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-03T09:01:04.806693Z","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:bd92ee251ab2a0babb9a988aec6c3ff77c14b625269a1f92a1c89da2ce5d101a","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-03T09:01:04.806693Z","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:57be95e8a68408b2c2edcdf538e98f47b983213f70981d35ae2de5f06c72f8d1","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-03T09:01:04.806693Z","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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2601.15252."}