{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IZZZF4SNGOIW7YHDKFLP5XQ7FN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"de4348e75c87547afd398ee75b9ff8f0d09fcb71782035cf1da0aeeb23bb72b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-04T15:14:06Z","title_canon_sha256":"504d0511a913af19730a098a0df1ac3d32af16c3742f4706d25a8f62a9fe31c3"},"schema_version":"1.0","source":{"id":"1703.01475","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01475","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01475v1","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01475","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"IZZZF4SNGOIW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IZZZF4SNGOIW7YHD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IZZZF4SN","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:d7c60516167bbec9c235d1c26d5d60d817267d247f5a78e406c7f017c4883363","target":"graph","created_at":"2026-05-18T00:49:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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}$).","authors_text":"Grzegorz G{\\l}uch, Krzysztof Lory\\'s","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-04T15:14:06Z","title":"4/3 Rectangle Tiling lower bound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01475","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:41994ddc4709b5d1518aae0babc9896e1630aadacba6c7a75f91615f869e3732","target":"record","created_at":"2026-05-18T00:49:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"de4348e75c87547afd398ee75b9ff8f0d09fcb71782035cf1da0aeeb23bb72b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-04T15:14:06Z","title_canon_sha256":"504d0511a913af19730a098a0df1ac3d32af16c3742f4706d25a8f62a9fe31c3"},"schema_version":"1.0","source":{"id":"1703.01475","kind":"arxiv","version":1}},"canonical_sha256":"467392f24d33916fe0e35156fede1f2b41cbff9e3c4804cdbeafcb68eb0aa86e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"467392f24d33916fe0e35156fede1f2b41cbff9e3c4804cdbeafcb68eb0aa86e","first_computed_at":"2026-05-18T00:49:30.602505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:30.602505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TV2EbXtM9VTK+TShtyDH1k3+j2qgr1IC6lpCYOuWVvKus8VyWaaUuQX0xRb3ift/LqIk4y6MUXP8lQwB+mmJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:30.603245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01475","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41994ddc4709b5d1518aae0babc9896e1630aadacba6c7a75f91615f869e3732","sha256:d7c60516167bbec9c235d1c26d5d60d817267d247f5a78e406c7f017c4883363"],"state_sha256":"46e4e96b4bde547356be4b47ae8b554e50e03a236018df17ee091c023f42e058"}