{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JKTXYT6F6SNQVJDLW5KVGP5BFI","short_pith_number":"pith:JKTXYT6F","schema_version":"1.0","canonical_sha256":"4aa77c4fc5f49b0aa46bb755533fa12a0db4b9ead4cf4ed26a8bc94098a7946d","source":{"kind":"arxiv","id":"1711.07710","version":1},"attestation_state":"computed","paper":{"title":"Approximating Geometric Knapsack via L-packings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Arindam Khan, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Waldo G\\'alvez","submitted_at":"2017-11-21T10:46:35Z","abstract_excerpt":"We study the two-dimensional geometric knapsack problem (2DK) in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-aligned square knapsack. The goal is to find a (non-overlapping) packing of a maximum profit subset of items inside the knapsack (without rotating items). The best-known polynomial-time approximation factor for this problem (even just in the cardinality case) is (2 + \\epsilon) [Jansen and Zhang, SODA 2004].\n  In this paper, we break the 2 approximation barrier, achieving a polynomial-time (17/9 + \\epsilon) < 1.89 approxim"},"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":"1711.07710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T10:46:35Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"2004a0fb5db514c54b43f1b61c8278ba71d7422e525c6679a4a3df4d35fd25c7","abstract_canon_sha256":"47a20528578f9c92e5cc0804fd1225b9d2d17ab0f24507b1983222c0ea8630fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:56.676650Z","signature_b64":"KonsxNqaVkwAn7Hs+uHC+ca/hkGX/hqM1Bw4vEqAyUMTNcKhnEcfgFuKZC39RpTAnGWBcViezPGFsi0vbICOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aa77c4fc5f49b0aa46bb755533fa12a0db4b9ead4cf4ed26a8bc94098a7946d","last_reissued_at":"2026-05-18T00:29:56.676072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:56.676072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating Geometric Knapsack via L-packings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Arindam Khan, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Waldo G\\'alvez","submitted_at":"2017-11-21T10:46:35Z","abstract_excerpt":"We study the two-dimensional geometric knapsack problem (2DK) in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-aligned square knapsack. The goal is to find a (non-overlapping) packing of a maximum profit subset of items inside the knapsack (without rotating items). The best-known polynomial-time approximation factor for this problem (even just in the cardinality case) is (2 + \\epsilon) [Jansen and Zhang, SODA 2004].\n  In this paper, we break the 2 approximation barrier, achieving a polynomial-time (17/9 + \\epsilon) < 1.89 approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07710","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":"1711.07710","created_at":"2026-05-18T00:29:56.676156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07710v1","created_at":"2026-05-18T00:29:56.676156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07710","created_at":"2026-05-18T00:29:56.676156+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKTXYT6F6SNQ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKTXYT6F6SNQVJDL","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKTXYT6F","created_at":"2026-05-18T12:31:24.725408+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/JKTXYT6F6SNQVJDLW5KVGP5BFI","json":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI.json","graph_json":"https://pith.science/api/pith-number/JKTXYT6F6SNQVJDLW5KVGP5BFI/graph.json","events_json":"https://pith.science/api/pith-number/JKTXYT6F6SNQVJDLW5KVGP5BFI/events.json","paper":"https://pith.science/paper/JKTXYT6F"},"agent_actions":{"view_html":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI","download_json":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI.json","view_paper":"https://pith.science/paper/JKTXYT6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07710&json=true","fetch_graph":"https://pith.science/api/pith-number/JKTXYT6F6SNQVJDLW5KVGP5BFI/graph.json","fetch_events":"https://pith.science/api/pith-number/JKTXYT6F6SNQVJDLW5KVGP5BFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/action/storage_attestation","attest_author":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/action/author_attestation","sign_citation":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/action/citation_signature","submit_replication":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/action/replication_record"}},"created_at":"2026-05-18T00:29:56.676156+00:00","updated_at":"2026-05-18T00:29:56.676156+00:00"}