{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SWZ5W5DAM6KWLWU3YE46P4F653","short_pith_number":"pith:SWZ5W5DA","schema_version":"1.0","canonical_sha256":"95b3db7460679565da9bc139e7f0beeec9956621247c5d3b8365b25d879f63a9","source":{"kind":"arxiv","id":"1602.07802","version":2},"attestation_state":"computed","paper":{"title":"Beating the SDP bound for the floor layout problem: A simple combinatorial idea","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Joey Huchette, Juan Pablo Vielma, Santanu S. Dey","submitted_at":"2016-02-25T05:27:47Z","abstract_excerpt":"For many mixed-integer programming (MIP) problems, high-quality dual bounds can be obtained either through advanced formulation techniques coupled with a state-of-the-art MIP solver, or through semidefinite programming (SDP) relaxation hierarchies. In this paper, we introduce an alternative bounding approach that exploits the \"combinatorial implosion\" effect by solving portions of the original problem and aggregating this information to obtain a global dual bound. We apply this technique to the one-dimensional and two-dimensional floor layout problems and compare it with the bounds generated b"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1602.07802","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-02-25T05:27:47Z","cross_cats_sorted":[],"title_canon_sha256":"a5ba3cfd678975b495e9b43b7eb8afb0d4af7acefc8cf5b66422b68e5b1838ce","abstract_canon_sha256":"95c2b6eb9d597b3910df53b78c3cadf767bcd765b32d5ab1f54a21d68d2a0e27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:32.012169Z","signature_b64":"zb105ykNnYbqPTnDljHr7RKvDCI15KqVQ456pB7s5oNDgLqvJQ8DJMjaXKALjoLJrNsBxh42I3pWZ6UpAJ81AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95b3db7460679565da9bc139e7f0beeec9956621247c5d3b8365b25d879f63a9","last_reissued_at":"2026-05-18T00:46:32.011452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:32.011452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beating the SDP bound for the floor layout problem: A simple combinatorial idea","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Joey Huchette, Juan Pablo Vielma, Santanu S. Dey","submitted_at":"2016-02-25T05:27:47Z","abstract_excerpt":"For many mixed-integer programming (MIP) problems, high-quality dual bounds can be obtained either through advanced formulation techniques coupled with a state-of-the-art MIP solver, or through semidefinite programming (SDP) relaxation hierarchies. In this paper, we introduce an alternative bounding approach that exploits the \"combinatorial implosion\" effect by solving portions of the original problem and aggregating this information to obtain a global dual bound. We apply this technique to the one-dimensional and two-dimensional floor layout problems and compare it with the bounds generated b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07802","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07802","created_at":"2026-05-18T00:46:32.011569+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07802v2","created_at":"2026-05-18T00:46:32.011569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07802","created_at":"2026-05-18T00:46:32.011569+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWZ5W5DAM6KW","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWZ5W5DAM6KWLWU3","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWZ5W5DA","created_at":"2026-05-18T12:30:44.179134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SWZ5W5DAM6KWLWU3YE46P4F653","json":"https://pith.science/pith/SWZ5W5DAM6KWLWU3YE46P4F653.json","graph_json":"https://pith.science/api/pith-number/SWZ5W5DAM6KWLWU3YE46P4F653/graph.json","events_json":"https://pith.science/api/pith-number/SWZ5W5DAM6KWLWU3YE46P4F653/events.json","paper":"https://pith.science/paper/SWZ5W5DA"},"agent_actions":{"view_html":"https://pith.science/pith/SWZ5W5DAM6KWLWU3YE46P4F653","download_json":"https://pith.science/pith/SWZ5W5DAM6KWLWU3YE46P4F653.json","view_paper":"https://pith.science/paper/SWZ5W5DA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07802&json=true","fetch_graph":"https://pith.science/api/pith-number/SWZ5W5DAM6KWLWU3YE46P4F653/graph.json","fetch_events":"https://pith.science/api/pith-number/SWZ5W5DAM6KWLWU3YE46P4F653/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWZ5W5DAM6KWLWU3YE46P4F653/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWZ5W5DAM6KWLWU3YE46P4F653/action/storage_attestation","attest_author":"https://pith.science/pith/SWZ5W5DAM6KWLWU3YE46P4F653/action/author_attestation","sign_citation":"https://pith.science/pith/SWZ5W5DAM6KWLWU3YE46P4F653/action/citation_signature","submit_replication":"https://pith.science/pith/SWZ5W5DAM6KWLWU3YE46P4F653/action/replication_record"}},"created_at":"2026-05-18T00:46:32.011569+00:00","updated_at":"2026-05-18T00:46:32.011569+00:00"}