{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:Z3WVLIVWOFLH43UZAFXWBZ2CO4","short_pith_number":"pith:Z3WVLIVW","schema_version":"1.0","canonical_sha256":"ceed55a2b671567e6e99016f60e742770bb96fa50bd012a3f566e9d7b474ed86","source":{"kind":"arxiv","id":"2103.10406","version":1},"attestation_state":"computed","paper":{"title":"Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Andreas Wiese, Arindam Khan, Diego Ram\\'irez-Romero, Fabrizio Grandoni, Waldo G\\'alvez","submitted_at":"2021-03-18T17:42:20Z","abstract_excerpt":"In the \\textsc{2-Dimensional Knapsack} problem (2DK) we are given a square knapsack and a collection of $n$ rectangular items with integer sizes and profits. Our goal is to find the most profitable subset of items that can be packed non-overlappingly into the knapsack. The currently best known polynomial-time approximation factor for 2DK is $17/9+\\varepsilon<1.89$ and there is a $(3/2+\\varepsilon)$-approximation algorithm if we are allowed to rotate items by 90 degrees~{[}G\\'alvez et al., FOCS 2017{]}. In this paper, we give $(4/3+\\varepsilon)$-approximation algorithms in polynomial time for 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":"2103.10406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2021-03-18T17:42:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"438910b2375988c407d66aa29f995ea6ca4f0b8af880996dc2e6f7f4c16ab57b","abstract_canon_sha256":"1957cff0fde3967113d47deed295fc127a0022e5764f9f58ba087709796bc532"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:24:26.194415Z","signature_b64":"FOsCS58C1IuXCTKmEQWkmuOMXUzDI4ETL43a7tThaKeGPmCGgOdESNUQ6+I7pgBDHvnp62s54Fve8432+KtiDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ceed55a2b671567e6e99016f60e742770bb96fa50bd012a3f566e9d7b474ed86","last_reissued_at":"2026-07-05T02:24:26.193958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:24:26.193958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Andreas Wiese, Arindam Khan, Diego Ram\\'irez-Romero, Fabrizio Grandoni, Waldo G\\'alvez","submitted_at":"2021-03-18T17:42:20Z","abstract_excerpt":"In the \\textsc{2-Dimensional Knapsack} problem (2DK) we are given a square knapsack and a collection of $n$ rectangular items with integer sizes and profits. Our goal is to find the most profitable subset of items that can be packed non-overlappingly into the knapsack. The currently best known polynomial-time approximation factor for 2DK is $17/9+\\varepsilon<1.89$ and there is a $(3/2+\\varepsilon)$-approximation algorithm if we are allowed to rotate items by 90 degrees~{[}G\\'alvez et al., FOCS 2017{]}. In this paper, we give $(4/3+\\varepsilon)$-approximation algorithms in polynomial time for b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.10406","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.10406/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2103.10406","created_at":"2026-07-05T02:24:26.194016+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.10406v1","created_at":"2026-07-05T02:24:26.194016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.10406","created_at":"2026-07-05T02:24:26.194016+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3WVLIVWOFLH","created_at":"2026-07-05T02:24:26.194016+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3WVLIVWOFLH43UZ","created_at":"2026-07-05T02:24:26.194016+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3WVLIVW","created_at":"2026-07-05T02:24:26.194016+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05233","citing_title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z3WVLIVWOFLH43UZAFXWBZ2CO4","json":"https://pith.science/pith/Z3WVLIVWOFLH43UZAFXWBZ2CO4.json","graph_json":"https://pith.science/api/pith-number/Z3WVLIVWOFLH43UZAFXWBZ2CO4/graph.json","events_json":"https://pith.science/api/pith-number/Z3WVLIVWOFLH43UZAFXWBZ2CO4/events.json","paper":"https://pith.science/paper/Z3WVLIVW"},"agent_actions":{"view_html":"https://pith.science/pith/Z3WVLIVWOFLH43UZAFXWBZ2CO4","download_json":"https://pith.science/pith/Z3WVLIVWOFLH43UZAFXWBZ2CO4.json","view_paper":"https://pith.science/paper/Z3WVLIVW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.10406&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3WVLIVWOFLH43UZAFXWBZ2CO4/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3WVLIVWOFLH43UZAFXWBZ2CO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3WVLIVWOFLH43UZAFXWBZ2CO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3WVLIVWOFLH43UZAFXWBZ2CO4/action/storage_attestation","attest_author":"https://pith.science/pith/Z3WVLIVWOFLH43UZAFXWBZ2CO4/action/author_attestation","sign_citation":"https://pith.science/pith/Z3WVLIVWOFLH43UZAFXWBZ2CO4/action/citation_signature","submit_replication":"https://pith.science/pith/Z3WVLIVWOFLH43UZAFXWBZ2CO4/action/replication_record"}},"created_at":"2026-07-05T02:24:26.194016+00:00","updated_at":"2026-07-05T02:24:26.194016+00:00"}