{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UDJB452ACSWM7LLHA2WAK5COYD","short_pith_number":"pith:UDJB452A","schema_version":"1.0","canonical_sha256":"a0d21e774014accfad6706ac05744ec0f5c35b431783c10194d09177ad5eb067","source":{"kind":"arxiv","id":"1611.06501","version":1},"attestation_state":"computed","paper":{"title":"Approximation and parameterized algorithms for geometric independent set with shrinking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Erik Jan van Leeuwen, Micha{\\l} Pilipczuk","submitted_at":"2016-11-20T11:15:41Z","abstract_excerpt":"Consider the Maximum Weight Independent Set problem for rectangles: given a family of weighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlapping rectangles. The problem is notoriously hard both in the approximation and in the parameterized setting. The best known polynomial-time approximation algorithms achieve super-constant approximation ratios [Chalermsook and Chuzhoy, SODA 2009; Chan and Har-Peled, Discrete & Comp. Geometry 2012], even though there is a $(1+\\epsilon)$-approximation running in quasi-polynomial time [Adamaszek and Wiese, FOCS 2013; Chuzho"},"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":"1611.06501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-20T11:15:41Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"c5eeb0f26cb2e2eaded557aa994358883e0b84266038173d540db702e91bfde3","abstract_canon_sha256":"c60fc252a438d911622aa8394f060633b239da7e709566725faf823c0773e783"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:36.617456Z","signature_b64":"j9LswMiD/FFeLV0IS8JGCFZhOQYBQnUZvNaB6Cc/mnHHxUUnR5+pTCEW3KrYqHNqQmL4C/iemODm+E18O4tjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0d21e774014accfad6706ac05744ec0f5c35b431783c10194d09177ad5eb067","last_reissued_at":"2026-05-18T00:57:36.616916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:36.616916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation and parameterized algorithms for geometric independent set with shrinking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Erik Jan van Leeuwen, Micha{\\l} Pilipczuk","submitted_at":"2016-11-20T11:15:41Z","abstract_excerpt":"Consider the Maximum Weight Independent Set problem for rectangles: given a family of weighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlapping rectangles. The problem is notoriously hard both in the approximation and in the parameterized setting. The best known polynomial-time approximation algorithms achieve super-constant approximation ratios [Chalermsook and Chuzhoy, SODA 2009; Chan and Har-Peled, Discrete & Comp. Geometry 2012], even though there is a $(1+\\epsilon)$-approximation running in quasi-polynomial time [Adamaszek and Wiese, FOCS 2013; Chuzho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06501","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":"1611.06501","created_at":"2026-05-18T00:57:36.616998+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06501v1","created_at":"2026-05-18T00:57:36.616998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06501","created_at":"2026-05-18T00:57:36.616998+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDJB452ACSWM","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDJB452ACSWM7LLH","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDJB452A","created_at":"2026-05-18T12:30:46.583412+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/UDJB452ACSWM7LLHA2WAK5COYD","json":"https://pith.science/pith/UDJB452ACSWM7LLHA2WAK5COYD.json","graph_json":"https://pith.science/api/pith-number/UDJB452ACSWM7LLHA2WAK5COYD/graph.json","events_json":"https://pith.science/api/pith-number/UDJB452ACSWM7LLHA2WAK5COYD/events.json","paper":"https://pith.science/paper/UDJB452A"},"agent_actions":{"view_html":"https://pith.science/pith/UDJB452ACSWM7LLHA2WAK5COYD","download_json":"https://pith.science/pith/UDJB452ACSWM7LLHA2WAK5COYD.json","view_paper":"https://pith.science/paper/UDJB452A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06501&json=true","fetch_graph":"https://pith.science/api/pith-number/UDJB452ACSWM7LLHA2WAK5COYD/graph.json","fetch_events":"https://pith.science/api/pith-number/UDJB452ACSWM7LLHA2WAK5COYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDJB452ACSWM7LLHA2WAK5COYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDJB452ACSWM7LLHA2WAK5COYD/action/storage_attestation","attest_author":"https://pith.science/pith/UDJB452ACSWM7LLHA2WAK5COYD/action/author_attestation","sign_citation":"https://pith.science/pith/UDJB452ACSWM7LLHA2WAK5COYD/action/citation_signature","submit_replication":"https://pith.science/pith/UDJB452ACSWM7LLHA2WAK5COYD/action/replication_record"}},"created_at":"2026-05-18T00:57:36.616998+00:00","updated_at":"2026-05-18T00:57:36.616998+00:00"}