{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IZZZF4SNGOIW7YHDKFLP5XQ7FN","short_pith_number":"pith:IZZZF4SN","schema_version":"1.0","canonical_sha256":"467392f24d33916fe0e35156fede1f2b41cbff9e3c4804cdbeafcb68eb0aa86e","source":{"kind":"arxiv","id":"1703.01475","version":1},"attestation_state":"computed","paper":{"title":"4/3 Rectangle Tiling lower bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grzegorz G{\\l}uch, Krzysztof Lory\\'s","submitted_at":"2017-03-04T15:14:06Z","abstract_excerpt":"The problem that we consider is the following: given an $n \\times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must overlap) that minimizes the maximum weight of any rectangle (the weight of a rectangle is the sum of elements which are covered by it). We prove that it is NP-hard to approximate this problem to within a factor of \\textbf{1$\\frac{1}{3}$} (the previous best result was $1\\frac{1}{4}$)."},"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":"1703.01475","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-04T15:14:06Z","cross_cats_sorted":[],"title_canon_sha256":"504d0511a913af19730a098a0df1ac3d32af16c3742f4706d25a8f62a9fe31c3","abstract_canon_sha256":"de4348e75c87547afd398ee75b9ff8f0d09fcb71782035cf1da0aeeb23bb72b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:30.603245Z","signature_b64":"TV2EbXtM9VTK+TShtyDH1k3+j2qgr1IC6lpCYOuWVvKus8VyWaaUuQX0xRb3ift/LqIk4y6MUXP8lQwB+mmJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"467392f24d33916fe0e35156fede1f2b41cbff9e3c4804cdbeafcb68eb0aa86e","last_reissued_at":"2026-05-18T00:49:30.602505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:30.602505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"4/3 Rectangle Tiling lower bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grzegorz G{\\l}uch, Krzysztof Lory\\'s","submitted_at":"2017-03-04T15:14:06Z","abstract_excerpt":"The problem that we consider is the following: given an $n \\times n$ array $A$ of positive numbers, find a tiling using at most $p$ rectangles (which means that each array element must be covered by some rectangle and no two rectangles must overlap) that minimizes the maximum weight of any rectangle (the weight of a rectangle is the sum of elements which are covered by it). We prove that it is NP-hard to approximate this problem to within a factor of \\textbf{1$\\frac{1}{3}$} (the previous best result was $1\\frac{1}{4}$)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01475","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":"1703.01475","created_at":"2026-05-18T00:49:30.602625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01475v1","created_at":"2026-05-18T00:49:30.602625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01475","created_at":"2026-05-18T00:49:30.602625+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZZZF4SNGOIW","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZZZF4SNGOIW7YHD","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZZZF4SN","created_at":"2026-05-18T12:31:21.493067+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/IZZZF4SNGOIW7YHDKFLP5XQ7FN","json":"https://pith.science/pith/IZZZF4SNGOIW7YHDKFLP5XQ7FN.json","graph_json":"https://pith.science/api/pith-number/IZZZF4SNGOIW7YHDKFLP5XQ7FN/graph.json","events_json":"https://pith.science/api/pith-number/IZZZF4SNGOIW7YHDKFLP5XQ7FN/events.json","paper":"https://pith.science/paper/IZZZF4SN"},"agent_actions":{"view_html":"https://pith.science/pith/IZZZF4SNGOIW7YHDKFLP5XQ7FN","download_json":"https://pith.science/pith/IZZZF4SNGOIW7YHDKFLP5XQ7FN.json","view_paper":"https://pith.science/paper/IZZZF4SN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01475&json=true","fetch_graph":"https://pith.science/api/pith-number/IZZZF4SNGOIW7YHDKFLP5XQ7FN/graph.json","fetch_events":"https://pith.science/api/pith-number/IZZZF4SNGOIW7YHDKFLP5XQ7FN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZZZF4SNGOIW7YHDKFLP5XQ7FN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZZZF4SNGOIW7YHDKFLP5XQ7FN/action/storage_attestation","attest_author":"https://pith.science/pith/IZZZF4SNGOIW7YHDKFLP5XQ7FN/action/author_attestation","sign_citation":"https://pith.science/pith/IZZZF4SNGOIW7YHDKFLP5XQ7FN/action/citation_signature","submit_replication":"https://pith.science/pith/IZZZF4SNGOIW7YHDKFLP5XQ7FN/action/replication_record"}},"created_at":"2026-05-18T00:49:30.602625+00:00","updated_at":"2026-05-18T00:49:30.602625+00:00"}