{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:6AA3Q7HTZ5QRDRTJSX3Q2ILIGI","short_pith_number":"pith:6AA3Q7HT","schema_version":"1.0","canonical_sha256":"f001b87cf3cf6111c66995f70d216832160a376e0ab4610bba03a74ee3963903","source":{"kind":"arxiv","id":"1107.2949","version":2},"attestation_state":"computed","paper":{"title":"Geometric Packing under Non-uniform Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alina Ene, Benjamin Raichel, Sariel Har-Peled","submitted_at":"2011-07-14T20:59:28Z","abstract_excerpt":"We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity. We provide a general framework and an algorithm for approximating the optimal solution for packing in hypergraphs arising out of such geometric settings. Using this framework we get a flotilla of results on this problem (and also on its dual, where one wants to pick a maximum weight subset of the points when the regions have capacities). For example, for the "},"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":"1107.2949","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-07-14T20:59:28Z","cross_cats_sorted":[],"title_canon_sha256":"4748c4d8ca1151e8facac8b10610d9b9229a2c6e00d169f540aaccef57c304c2","abstract_canon_sha256":"5b09a0dc79fc1504641e0bd218196fb85c805b3e23ba4fe41c22908a574a8ce7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:19.510033Z","signature_b64":"ma6tctsPVTruG95eB4tZc9bozIC5OuJ6V8gaQZa8PkjInj1vmXNml/RwcMHWs96aMHvmGNCz3SeqJgohOG33Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f001b87cf3cf6111c66995f70d216832160a376e0ab4610bba03a74ee3963903","last_reissued_at":"2026-05-18T04:07:19.509243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:19.509243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric Packing under Non-uniform Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alina Ene, Benjamin Raichel, Sariel Har-Peled","submitted_at":"2011-07-14T20:59:28Z","abstract_excerpt":"We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity. We provide a general framework and an algorithm for approximating the optimal solution for packing in hypergraphs arising out of such geometric settings. Using this framework we get a flotilla of results on this problem (and also on its dual, where one wants to pick a maximum weight subset of the points when the regions have capacities). For example, for the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2949","kind":"arxiv","version":2},"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":"1107.2949","created_at":"2026-05-18T04:07:19.509364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2949v2","created_at":"2026-05-18T04:07:19.509364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2949","created_at":"2026-05-18T04:07:19.509364+00:00"},{"alias_kind":"pith_short_12","alias_value":"6AA3Q7HTZ5QR","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"6AA3Q7HTZ5QRDRTJ","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"6AA3Q7HT","created_at":"2026-05-18T12:26:22.705136+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/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI","json":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI.json","graph_json":"https://pith.science/api/pith-number/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/graph.json","events_json":"https://pith.science/api/pith-number/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/events.json","paper":"https://pith.science/paper/6AA3Q7HT"},"agent_actions":{"view_html":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI","download_json":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI.json","view_paper":"https://pith.science/paper/6AA3Q7HT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2949&json=true","fetch_graph":"https://pith.science/api/pith-number/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/graph.json","fetch_events":"https://pith.science/api/pith-number/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/action/storage_attestation","attest_author":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/action/author_attestation","sign_citation":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/action/citation_signature","submit_replication":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/action/replication_record"}},"created_at":"2026-05-18T04:07:19.509364+00:00","updated_at":"2026-05-18T04:07:19.509364+00:00"}