Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-03T09:01:13.664744Z
Paper Citation Record · LEDGER
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
As of 9 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2601.15252.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
56 of 56 outbound references displayed
- verified exact21
- verified fuzzy0
- unresolved27
- parse uncertain0
- malformed identifier8
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 058b0ad3-6c98-48d7-aaaf-e1db68be69bd · outbound
This paper cites Symmetry-breaking constraints for packing identical rectangles within polyhedra.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Symmetry-breaking constraints for packing identical rectangles within polyhedra
Reference 1
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T09:01:07.791401Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ffe904ab-d1da-46e8-9e47-cdec4710400c · outbound
This paper cites Disjunctive programming: Properties of the convex hull of feasible points.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Disjunctive programming: Properties of the convex hull of feasible points
Reference 2
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T09:01:07.866667Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b1934216-173c-4798-aeb5-91c78e86acab · outbound
This paper cites The SCIP Optimization Suite 9.0.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing The SCIP Optimization Suite 9.0
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:07.964672Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation dde6e9cc-a611-45df-8802-0f6843cc2a5a · outbound
This paper cites A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
Reference 4
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:55.724741Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 0bf9389d-79f3-4769-a3b3-fa24c3bab702 · outbound
This paper cites An epsilon-accurate model for optimal unequal-area block layout design.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing An epsilon-accurate model for optimal unequal-area block layout design
Reference 5
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:55.354830Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 79914782-a955-4132-a78e-b1b3915b14b0 · outbound
This paper cites Atomic Decomposition by BasisPursuit.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Atomic Decomposition by BasisPursuit
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:08.174039Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 19092f8b-e5c0-48d7-998d-f0febc80ca7f · outbound
This paper cites Verifying integer programming results.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Verifying integer programming results
Reference 7
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:55.011022Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 2abc97bf-b99e-4b8c-892f-35e31514fd91 · outbound
This paper cites an unresolved cited work.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Unresolved cited work
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:08.292827Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 257d295b-a42c-4655-b1b0-a14fb857b1a5 · outbound
This paper cites A computational status update for exact rational mixed integer programming.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A computational status update for exact rational mixed integer programming
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:08.348515Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5bbde202-f058-40e4-baab-ae70665cac82 · outbound
This paper cites A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture
Reference 10
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:54.774757Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 71a2eee3-fa58-4d8c-a1ca-f983c2096a8c · outbound
This paper cites A survey on the cutting and packing problems.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A survey on the cutting and packing problems
Reference 11
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T09:01:08.453648Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d3975dc9-ad86-4b00-958e-8dcfe5abd0f1 · outbound
This paper cites An Exact Formulation for Multi-Workshop Facility Layout Problem with Clearance Bounds.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing An Exact Formulation for Multi-Workshop Facility Layout Problem with Clearance Bounds
Reference 12
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T09:01:08.542867Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1681c5cb-136d-4496-b66d-b631b55a2ec2 · outbound
This paper cites A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:08.694937Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8b758aa5-1fcf-4d2c-ad25-8b066a1a1935 · outbound
This paper cites Fixed and flexible shape facility layout problems using biogeography-based optimisation algorithm.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Fixed and flexible shape facility layout problems using biogeography-based optimisation algorithm
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:08.789969Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a391cd22-d633-4e2e-8677-e3a6d71b6ba0 · outbound
This paper cites Unequal-area, fixed-shape facility layout problems using the firefly algorithm.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Unequal-area, fixed-shape facility layout problems using the firefly algorithm
Reference 16
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T09:01:08.852508Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 061cf41e-42a1-4a3d-8620-e32ab362453f · outbound
This paper cites Modelling with integer variables.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Modelling with integer variables
Reference 18
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:54.284752Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation f5d3f398-d5ee-47a4-a666-bf18adf36e49 · outbound
This paper cites On verifiable sufficient conditions for sparse signal recovery via L1 minimization.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing On verifiable sufficient conditions for sparse signal recovery via L1 minimization
Reference 19
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:54.001859Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation efe35fde-6b81-4528-86a2-b77d36221b82 · outbound
This paper cites A biased random-key genetic algorithm using dotted board model for solving two-dimensional irregular strip packing problems.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A biased random-key genetic algorithm using dotted board model for solving two-dimensional irregular strip packing problems
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:09.057815Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation adc59695-1faf-490f-a33c-9af50afd0506 · outbound
This paper cites Construction heuristics for the single row layout problem with machine-spanning clearances.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Construction heuristics for the single row layout problem with machine-spanning clearances
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:09.131058Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6f080049-4615-40a3-a584-90d710643a1c · outbound
This paper cites Integer-Programming Bounds on Pebbling Numbers of Cartesian-ProductGraphs.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Integer-Programming Bounds on Pebbling Numbers of Cartesian-ProductGraphs
Reference 22
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:53.649865Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 8047edf6-3f16-4f4a-aa9f-fda50290b85b · outbound
This paper cites Using Integer Programming to Search for Counterexamples: A Case Study.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Using Integer Programming to Search for Counterexamples: A Case Study
Reference 23
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:53.052765Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 0cb521f5-865a-4213-a0b0-8d2bf70e4407 · outbound
This paper cites Visual nesting system for irregular cutting-stock problem based on rubber band packing algorithm.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Visual nesting system for irregular cutting-stock problem based on rubber band packing algorithm
Reference 24
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:52.815863Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 3ab4097a-48db-4840-b396-7d35ea37781c · outbound
This paper cites Two-dimensional packing problems: A survey.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Two-dimensional packing problems: A survey
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:09.547070Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c8845625-c282-46c4-9885-4f4464b07865 · outbound
This paper cites An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing An Application of an Unequal-Area Facilities Layout Problem with Fixed-Shape Facilities
Reference 26
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:09.715708Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e546a4ba-a154-4e36-afd4-131a5d1b84a5 · outbound
This paper cites Applying the sequence-pair represen- tation to optimal facility layout designs.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Applying the sequence-pair represen- tation to optimal facility layout designs
Reference 27
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:52.134162Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation a1784e18-9f31-4915-87e6-29cbd7fd4349 · outbound
This paper cites A biased random key genetic algorithm for open dimension nesting problems using no-fit raster.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A biased random key genetic algorithm for open dimension nesting problems using no-fit raster
Reference 28
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:51.904429Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 96733a95-fa63-4bb4-818e-ae4821908cdd · outbound
This paper cites On the degree of Boolean functions as real polynomials.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing On the degree of Boolean functions as real polynomials
Reference 29
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:09.907746Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 06a8a4a5-46da-4bfa-a206-bb4898dfd115 · outbound
This paper cites an unresolved cited work.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Unresolved cited work
Reference 30
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T09:01:09.991867Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation efd90179-851b-4c51-8288-f602081cd3a0 · outbound
This paper cites Locally Ideal LP Formulations I.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Locally Ideal LP Formulations I
Reference 31
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:51.540279Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation b1788452-2a5e-4bff-88c8-a13cd8d5a579 · outbound
This paper cites SOLVING IRREGULAR STRIP PACKING PROBLEMS WITH FREE ROTATIONS USING SEPARATION LINES.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing SOLVING IRREGULAR STRIP PACKING PROBLEMS WITH FREE ROTATIONS USING SEPARATION LINES
Reference 32
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:10.162122Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c2f2da8b-b8ed-4701-a8a3-92dd7f43888e · outbound
This paper cites Cutting planes for families implying Frankl’s conjecture.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Cutting planes for families implying Frankl’s conjecture
Reference 33
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:51.356622Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation c014bd56-a9d7-47ac-af6b-ed1369c45737 · outbound
This paper cites A clique covering MIP model for the irregular strip packing problem.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A clique covering MIP model for the irregular strip packing problem
Reference 34
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:50.827767Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 5fd5fbe5-384e-4327-ae2d-fe7272809eb2 · outbound
This paper cites Solving an extended multi-row facility layout problem with fuzzy clearances using GA.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Solving an extended multi-row facility layout problem with fuzzy clearances using GA
Reference 35
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:50.634016Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation ad1069d3-be51-4d33-a13c-54a48945315d · outbound
This paper cites A study in pairwise clustering for bi-dimensional irregular strip packing using the dotted board model.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A study in pairwise clustering for bi-dimensional irregular strip packing using the dotted board model
Reference 36
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:50.349546Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 2eb1e726-1df0-41ab-8fc1-a32768799175 · outbound
This paper cites an unresolved cited work.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Unresolved cited work
Reference 37
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:10.686719Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 26667237-6b59-4bf1-b0da-114736b53905 · outbound
This paper cites Enhanced Model Formu- lations for Optimal Facility Layout.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Enhanced Model Formu- lations for Optimal Facility Layout
Reference 38
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:50.094648Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 67109192-92cc-49da-9539-6dd4cde44950 · outbound
This paper cites 2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing 2DCPackGen: A problem generator for two-dimensional rectangular cutting and packing problems
Reference 39
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:49.862476Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 3ba995d6-ae59-4a1d-a493-e8243fd5776f · outbound
This paper cites Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear op- timization.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear op- timization
Reference 40
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:49.595892Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 98e93f17-3261-4609-9a39-2d4300eeeb08 · outbound
This paper cites Computing the spark: mixed-integer programming for the (vector) matroid girth problem.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Computing the spark: mixed-integer programming for the (vector) matroid girth problem
Reference 41
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:49.359500Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 076dc1b3-9c79-468c-ac02-aab6354c0e57 · outbound
This paper cites The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
Reference 42
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T09:01:11.322765Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c4e7a95e-6474-44b1-913a-ff63dc5ceeeb · outbound
This paper cites Zoning Constrained Machine Layout Problem with Mutual Clearances.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Zoning Constrained Machine Layout Problem with Mutual Clearances
Reference 43
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:11.479084Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation d806d0b3-796b-4160-a324-8c19e3c8d307 · outbound
This paper cites Embedding formulations and complexity for unions of polyhedra.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Embedding formulations and complexity for unions of polyhedra
Reference 44
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:11.623815Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c91f6d51-58d6-4cbe-b679-3fc75653fe4f · outbound
This paper cites Mixed Integer Linear Programming Formulation Techniques.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Mixed Integer Linear Programming Formulation Techniques
Reference 46
- Resolution
- verified exact
- doi, observed 2026-08-03T09:03:49.142525Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.
Observation 6b4a7ba8-f0d3-490a-b063-905351d7b3c4 · outbound
This paper cites Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
Reference 47
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:12.110108Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b652c1ca-8ffb-40dd-ae7a-69d656beee59 · outbound
This paper cites Wolsey.Integer Programming.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Wolsey.Integer Programming
Reference 48
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:12.244123Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation aafa1657-77a5-46cd-a665-cbf7008a38ba · outbound
This paper cites A hybrid multiobjective GRASP for a multi-row facility layout problem with extra clearances.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A hybrid multiobjective GRASP for a multi-row facility layout problem with extra clearances
Reference 49
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:12.397130Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5d01c127-de73-4b54-a3e7-e7890888929d · outbound
This paper cites A tabu search heuristic for the single row layoutproblemwithsharedclearances.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing A tabu search heuristic for the single row layoutproblemwithsharedclearances
Reference 50
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:12.604851Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6ac361dd-f6bb-4f09-8266-65e81f9f0e09 · outbound
This paper cites Sharing clearances to improve machine layout.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Sharing clearances to improve machine layout
Reference 51
- Resolution
- malformed identifier
- no resolver link, observed 2026-08-03T09:01:12.714769Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1bb96bdc-6bca-4828-9a58-32d629c3e1ce · outbound
This paper cites an unresolved cited work.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Unresolved cited work
Reference 52
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:12.846043Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 661c7482-d590-4d45-87da-33e6f37f3356 · outbound
This paper cites We have already shown that this is a contradiction.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing We have already shown that this is a contradiction
Reference 53
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:13.070211Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 59c76feb-b228-46dc-ab76-47f55cfcaeb4 · outbound
This paper cites However, (SU.d) is linearly dependent with a tight (16g) in the directionˆtand tight (16h) and (16i) in the direction ofˆs.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing However, (SU.d) is linearly dependent with a tight (16g) in the directionˆtand tight (16h) and (16i) in the direction ofˆs
Reference 54
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:13.130244Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e0f06135-dbaf-4e07-8491-aa8b59de0d55 · outbound
This paper cites But the projected system (16) has only four variables and cannot support five or more linearly independent, tight constraints.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing But the projected system (16) has only four variables and cannot support five or more linearly independent, tight constraints
Reference 55
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:13.222953Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3cb8def3-c737-4177-8844-9f6c9377c84d · outbound
This paper cites an unresolved cited work.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Unresolved cited work
Reference 56
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:13.291940Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation fbbbf49a-421a-47cf-b6f8-e92018567e6a · outbound
This paper cites Thus, SB-L is not generally pairwise-ideal.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Thus, SB-L is not generally pairwise-ideal
Reference 57
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:13.415479Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 12b7aec5-2ea3-4f5f-908b-97251a86e354 · outbound
This paper cites Thus,N Uis not generally pairwise-ideal.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing Thus,N Uis not generally pairwise-ideal
Reference 58
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:13.535583Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c66f1e4a-5d56-4106-abab-ce51232288a3 · outbound
This paper cites SeeCounterexampleSU.nbin our repository (footnote 2) for complete evidence.
Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing SeeCounterexampleSU.nbin our repository (footnote 2) for complete evidence
Reference 59
- Resolution
- unresolved
- no resolver link, observed 2026-08-03T09:01:13.664744Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.