{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JKTXYT6F6SNQVJDLW5KVGP5BFI","short_pith_number":"pith:JKTXYT6F","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"},"canonical_sha256":"4aa77c4fc5f49b0aa46bb755533fa12a0db4b9ead4cf4ed26a8bc94098a7946d","source":{"kind":"arxiv","id":"1711.07710","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07710","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07710v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07710","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"JKTXYT6F6SNQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JKTXYT6F6SNQVJDL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JKTXYT6F","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JKTXYT6F6SNQVJDLW5KVGP5BFI","target":"record","payload":{"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"},"canonical_sha256":"4aa77c4fc5f49b0aa46bb755533fa12a0db4b9ead4cf4ed26a8bc94098a7946d","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"},"source_kind":"arxiv","source_id":"1711.07710","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qa+DS4iz+3FetDDbT2Go9TGlvJ5raiIiYpPHlu+fpUQDnk//mVgKbmoE8mGdUPmw7UArovdzcD8usQM0QI/DDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:41:47.057753Z"},"content_sha256":"8703ae027b3ae3397db86f6b1b409ffb87bf16e8cb5345720c5d9a0561674518","schema_version":"1.0","event_id":"sha256:8703ae027b3ae3397db86f6b1b409ffb87bf16e8cb5345720c5d9a0561674518"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JKTXYT6F6SNQVJDLW5KVGP5BFI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLR00Wpn9MplIAixjzN2wLeND3rwqRFFUSAfZKuJmBnmWva3r9npBJ31mfpzlSWHiOVK/Aiu9AFILMtuJ1fdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:41:47.058274Z"},"content_sha256":"332c70bfc07abe74b27dd3e1ace3370f4b7b02f27669ae24177e980056dd4354","schema_version":"1.0","event_id":"sha256:332c70bfc07abe74b27dd3e1ace3370f4b7b02f27669ae24177e980056dd4354"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/bundle.json","state_url":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T22:41:47Z","links":{"resolver":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI","bundle":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/bundle.json","state":"https://pith.science/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKTXYT6F6SNQVJDLW5KVGP5BFI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JKTXYT6F6SNQVJDLW5KVGP5BFI","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":"47a20528578f9c92e5cc0804fd1225b9d2d17ab0f24507b1983222c0ea8630fe","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T10:46:35Z","title_canon_sha256":"2004a0fb5db514c54b43f1b61c8278ba71d7422e525c6679a4a3df4d35fd25c7"},"schema_version":"1.0","source":{"id":"1711.07710","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07710","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07710v1","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07710","created_at":"2026-05-18T00:29:56Z"},{"alias_kind":"pith_short_12","alias_value":"JKTXYT6F6SNQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JKTXYT6F6SNQVJDL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JKTXYT6F","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:332c70bfc07abe74b27dd3e1ace3370f4b7b02f27669ae24177e980056dd4354","target":"graph","created_at":"2026-05-18T00:29:56Z","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":"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","authors_text":"Andreas Wiese, Arindam Khan, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Waldo G\\'alvez","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T10:46:35Z","title":"Approximating Geometric Knapsack via L-packings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07710","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:8703ae027b3ae3397db86f6b1b409ffb87bf16e8cb5345720c5d9a0561674518","target":"record","created_at":"2026-05-18T00:29:56Z","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":"47a20528578f9c92e5cc0804fd1225b9d2d17ab0f24507b1983222c0ea8630fe","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T10:46:35Z","title_canon_sha256":"2004a0fb5db514c54b43f1b61c8278ba71d7422e525c6679a4a3df4d35fd25c7"},"schema_version":"1.0","source":{"id":"1711.07710","kind":"arxiv","version":1}},"canonical_sha256":"4aa77c4fc5f49b0aa46bb755533fa12a0db4b9ead4cf4ed26a8bc94098a7946d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4aa77c4fc5f49b0aa46bb755533fa12a0db4b9ead4cf4ed26a8bc94098a7946d","first_computed_at":"2026-05-18T00:29:56.676072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:56.676072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KonsxNqaVkwAn7Hs+uHC+ca/hkGX/hqM1Bw4vEqAyUMTNcKhnEcfgFuKZC39RpTAnGWBcViezPGFsi0vbICOCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:56.676650Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07710","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8703ae027b3ae3397db86f6b1b409ffb87bf16e8cb5345720c5d9a0561674518","sha256:332c70bfc07abe74b27dd3e1ace3370f4b7b02f27669ae24177e980056dd4354"],"state_sha256":"aa39c2eb98c461d87f6162e50f2062351c375af52ff14afa9088b639894c2a00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITD6HyC9OprGEBO/soOimnLc5oLTG2uhDHRqvRD1kkBux3/ewJzYJ8n5LwBqMge8EmDnaMIVFHoLlgxx0YbIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:41:47.061179Z","bundle_sha256":"7f4be1b5498bf92e1dddb0b3fdeb08c644fc4b6429295d7a497a7c7e643f719c"}}