{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZWZEYFCLAOXPFH5KPWRFNZ3F5C","short_pith_number":"pith:ZWZEYFCL","schema_version":"1.0","canonical_sha256":"cdb24c144b03aef29faa7da256e765e88ed663e472e9353d5315c10069a4fe08","source":{"kind":"arxiv","id":"1906.10982","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Fabrizio Grandoni, Stefan Kratsch","submitted_at":"2019-06-26T11:33:22Z","abstract_excerpt":"The area of parameterized approximation seeks to combine approximation and parameterized algorithms to obtain, e.g., (1+eps)-approximations in f(k,eps)n^{O(1)} time where k is some parameter of the input. We obtain the following results on parameterized approximability: 1) In the maximum independent set of rectangles problem (MISR) we are given a collection of n axis parallel rectangles in the plane. Our goal is to select a maximum-cardinality subset of pairwise non-overlapping rectangles. This problem is NP-hard and also W[1]-hard [Marx, ESA'05]. The best-known polynomial-time approximation f"},"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":"1906.10982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T11:33:22Z","cross_cats_sorted":[],"title_canon_sha256":"e4c547b069e9e61322f85dcf327adf1b73f2f7e7b0b0c08b24c8f81828e7c82a","abstract_canon_sha256":"d7ed5875a9506e3034cff240e8e1c5a9da39a08e45a5d4adf6a620a635dfdd36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:10.365824Z","signature_b64":"QxwIQU6z5Wn+Dtg2DFQ1W0UOyioIBg6qfW2+waqB5CT9k8FOaZl1A6h4qVrQ3sMr9rne7rE5Dp3ZxZ1+n+bSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdb24c144b03aef29faa7da256e765e88ed663e472e9353d5315c10069a4fe08","last_reissued_at":"2026-05-17T23:42:10.365086Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:10.365086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Fabrizio Grandoni, Stefan Kratsch","submitted_at":"2019-06-26T11:33:22Z","abstract_excerpt":"The area of parameterized approximation seeks to combine approximation and parameterized algorithms to obtain, e.g., (1+eps)-approximations in f(k,eps)n^{O(1)} time where k is some parameter of the input. We obtain the following results on parameterized approximability: 1) In the maximum independent set of rectangles problem (MISR) we are given a collection of n axis parallel rectangles in the plane. Our goal is to select a maximum-cardinality subset of pairwise non-overlapping rectangles. This problem is NP-hard and also W[1]-hard [Marx, ESA'05]. The best-known polynomial-time approximation f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10982","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":"1906.10982","created_at":"2026-05-17T23:42:10.365211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10982v1","created_at":"2026-05-17T23:42:10.365211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10982","created_at":"2026-05-17T23:42:10.365211+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWZEYFCLAOXP","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWZEYFCLAOXPFH5K","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWZEYFCL","created_at":"2026-05-18T12:33:33.725879+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":62,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZWZEYFCLAOXPFH5KPWRFNZ3F5C","json":"https://pith.science/pith/ZWZEYFCLAOXPFH5KPWRFNZ3F5C.json","graph_json":"https://pith.science/api/pith-number/ZWZEYFCLAOXPFH5KPWRFNZ3F5C/graph.json","events_json":"https://pith.science/api/pith-number/ZWZEYFCLAOXPFH5KPWRFNZ3F5C/events.json","paper":"https://pith.science/paper/ZWZEYFCL"},"agent_actions":{"view_html":"https://pith.science/pith/ZWZEYFCLAOXPFH5KPWRFNZ3F5C","download_json":"https://pith.science/pith/ZWZEYFCLAOXPFH5KPWRFNZ3F5C.json","view_paper":"https://pith.science/paper/ZWZEYFCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10982&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWZEYFCLAOXPFH5KPWRFNZ3F5C/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWZEYFCLAOXPFH5KPWRFNZ3F5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWZEYFCLAOXPFH5KPWRFNZ3F5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWZEYFCLAOXPFH5KPWRFNZ3F5C/action/storage_attestation","attest_author":"https://pith.science/pith/ZWZEYFCLAOXPFH5KPWRFNZ3F5C/action/author_attestation","sign_citation":"https://pith.science/pith/ZWZEYFCLAOXPFH5KPWRFNZ3F5C/action/citation_signature","submit_replication":"https://pith.science/pith/ZWZEYFCLAOXPFH5KPWRFNZ3F5C/action/replication_record"}},"created_at":"2026-05-17T23:42:10.365211+00:00","updated_at":"2026-05-17T23:42:10.365211+00:00"}