{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U33DZXCFUSIZG4CJTJO7BBQTIQ","short_pith_number":"pith:U33DZXCF","schema_version":"1.0","canonical_sha256":"a6f63cdc45a4919370499a5df08613442c0926e6e1cf7a49cf4eb4f871e5ac46","source":{"kind":"arxiv","id":"1107.4463","version":1},"attestation_state":"computed","paper":{"title":"Bottom-Left Placement Theorem for Rectangle Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.DM","authors_text":"Duanbing Chen, Tao Ye, Wenqi Huang","submitted_at":"2011-07-22T09:27:23Z","abstract_excerpt":"This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. This theorem shows that even for the real-parameter rectangle packing problem, we can solve it after finite times of bottom-left placement actions. Based on this theorem, we might develop efficient heuristic algorithms for solving the rectangle packing problem."},"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":"1107.4463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-07-22T09:27:23Z","cross_cats_sorted":["cs.CG","cs.DS"],"title_canon_sha256":"c4dfafe246e60f7f5e6aa82dd30833017c705c6fc59b6b637cf16d526061acd9","abstract_canon_sha256":"1452f7cd6a6ee9298e9615f47c4508e67fd29544ea186558fbf77b3e70b6d7c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:03.996652Z","signature_b64":"RFFQhCNz5k8bL0oBKc/oofqUw4vT5JxA+Ib2FN23BRRm6zALKT6+vIn6eGaTHnr3BIeOIggLMEEef26RRbvZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6f63cdc45a4919370499a5df08613442c0926e6e1cf7a49cf4eb4f871e5ac46","last_reissued_at":"2026-05-18T04:17:03.995937Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:03.995937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bottom-Left Placement Theorem for Rectangle Packing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS"],"primary_cat":"cs.DM","authors_text":"Duanbing Chen, Tao Ye, Wenqi Huang","submitted_at":"2011-07-22T09:27:23Z","abstract_excerpt":"This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. This theorem shows that even for the real-parameter rectangle packing problem, we can solve it after finite times of bottom-left placement actions. Based on this theorem, we might develop efficient heuristic algorithms for solving the rectangle packing problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4463","kind":"arxiv","version":1},"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":"1107.4463","created_at":"2026-05-18T04:17:03.996040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4463v1","created_at":"2026-05-18T04:17:03.996040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4463","created_at":"2026-05-18T04:17:03.996040+00:00"},{"alias_kind":"pith_short_12","alias_value":"U33DZXCFUSIZ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U33DZXCFUSIZG4CJ","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U33DZXCF","created_at":"2026-05-18T12:26:42.757692+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/U33DZXCFUSIZG4CJTJO7BBQTIQ","json":"https://pith.science/pith/U33DZXCFUSIZG4CJTJO7BBQTIQ.json","graph_json":"https://pith.science/api/pith-number/U33DZXCFUSIZG4CJTJO7BBQTIQ/graph.json","events_json":"https://pith.science/api/pith-number/U33DZXCFUSIZG4CJTJO7BBQTIQ/events.json","paper":"https://pith.science/paper/U33DZXCF"},"agent_actions":{"view_html":"https://pith.science/pith/U33DZXCFUSIZG4CJTJO7BBQTIQ","download_json":"https://pith.science/pith/U33DZXCFUSIZG4CJTJO7BBQTIQ.json","view_paper":"https://pith.science/paper/U33DZXCF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4463&json=true","fetch_graph":"https://pith.science/api/pith-number/U33DZXCFUSIZG4CJTJO7BBQTIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/U33DZXCFUSIZG4CJTJO7BBQTIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U33DZXCFUSIZG4CJTJO7BBQTIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U33DZXCFUSIZG4CJTJO7BBQTIQ/action/storage_attestation","attest_author":"https://pith.science/pith/U33DZXCFUSIZG4CJTJO7BBQTIQ/action/author_attestation","sign_citation":"https://pith.science/pith/U33DZXCFUSIZG4CJTJO7BBQTIQ/action/citation_signature","submit_replication":"https://pith.science/pith/U33DZXCFUSIZG4CJTJO7BBQTIQ/action/replication_record"}},"created_at":"2026-05-18T04:17:03.996040+00:00","updated_at":"2026-05-18T04:17:03.996040+00:00"}