{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6AA3Q7HTZ5QRDRTJSX3Q2ILIGI","short_pith_number":"pith:6AA3Q7HT","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"},"canonical_sha256":"f001b87cf3cf6111c66995f70d216832160a376e0ab4610bba03a74ee3963903","source":{"kind":"arxiv","id":"1107.2949","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2949","created_at":"2026-05-18T04:07:19Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2949v2","created_at":"2026-05-18T04:07:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2949","created_at":"2026-05-18T04:07:19Z"},{"alias_kind":"pith_short_12","alias_value":"6AA3Q7HTZ5QR","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6AA3Q7HTZ5QRDRTJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6AA3Q7HT","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6AA3Q7HTZ5QRDRTJSX3Q2ILIGI","target":"record","payload":{"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"},"canonical_sha256":"f001b87cf3cf6111c66995f70d216832160a376e0ab4610bba03a74ee3963903","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"},"source_kind":"arxiv","source_id":"1107.2949","source_version":2,"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-18T04:07:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"os9AUfriE3LHNPKmVqHBXlrezkV44VQuEh7ICgKd3SCeMnUFbC72vPY0igciQdsaOKbcQEC7jVvB5B57eOWWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:40:04.025115Z"},"content_sha256":"cc291e2c1107ca0f8a98e886a51cbe70c3b95bf8fd54b57d5d4442d6681dfcdd","schema_version":"1.0","event_id":"sha256:cc291e2c1107ca0f8a98e886a51cbe70c3b95bf8fd54b57d5d4442d6681dfcdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6AA3Q7HTZ5QRDRTJSX3Q2ILIGI","target":"graph","payload":{"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"},"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-18T04:07:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1A+73shUChkaFOnARO+iAFMrfGECOZ6rUNWf/yJrXh5Aaz9bUyIQ0hO5WpOS/jzw7y8uB9MyVUwLx0XExFRkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T10:40:04.025836Z"},"content_sha256":"2d5ea928090f6420e48de853dfaa731dc489c0ab05d9b243c036930a600144f9","schema_version":"1.0","event_id":"sha256:2d5ea928090f6420e48de853dfaa731dc489c0ab05d9b243c036930a600144f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/bundle.json","state_url":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/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-06-08T10:40:04Z","links":{"resolver":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI","bundle":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/bundle.json","state":"https://pith.science/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AA3Q7HTZ5QRDRTJSX3Q2ILIGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6AA3Q7HTZ5QRDRTJSX3Q2ILIGI","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":"5b09a0dc79fc1504641e0bd218196fb85c805b3e23ba4fe41c22908a574a8ce7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-07-14T20:59:28Z","title_canon_sha256":"4748c4d8ca1151e8facac8b10610d9b9229a2c6e00d169f540aaccef57c304c2"},"schema_version":"1.0","source":{"id":"1107.2949","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2949","created_at":"2026-05-18T04:07:19Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2949v2","created_at":"2026-05-18T04:07:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2949","created_at":"2026-05-18T04:07:19Z"},{"alias_kind":"pith_short_12","alias_value":"6AA3Q7HTZ5QR","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6AA3Q7HTZ5QRDRTJ","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6AA3Q7HT","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:2d5ea928090f6420e48de853dfaa731dc489c0ab05d9b243c036930a600144f9","target":"graph","created_at":"2026-05-18T04:07:19Z","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 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 ","authors_text":"Alina Ene, Benjamin Raichel, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-07-14T20:59:28Z","title":"Geometric Packing under Non-uniform Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2949","kind":"arxiv","version":2},"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:cc291e2c1107ca0f8a98e886a51cbe70c3b95bf8fd54b57d5d4442d6681dfcdd","target":"record","created_at":"2026-05-18T04:07:19Z","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":"5b09a0dc79fc1504641e0bd218196fb85c805b3e23ba4fe41c22908a574a8ce7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-07-14T20:59:28Z","title_canon_sha256":"4748c4d8ca1151e8facac8b10610d9b9229a2c6e00d169f540aaccef57c304c2"},"schema_version":"1.0","source":{"id":"1107.2949","kind":"arxiv","version":2}},"canonical_sha256":"f001b87cf3cf6111c66995f70d216832160a376e0ab4610bba03a74ee3963903","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f001b87cf3cf6111c66995f70d216832160a376e0ab4610bba03a74ee3963903","first_computed_at":"2026-05-18T04:07:19.509243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:19.509243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ma6tctsPVTruG95eB4tZc9bozIC5OuJ6V8gaQZa8PkjInj1vmXNml/RwcMHWs96aMHvmGNCz3SeqJgohOG33Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:19.510033Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2949","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc291e2c1107ca0f8a98e886a51cbe70c3b95bf8fd54b57d5d4442d6681dfcdd","sha256:2d5ea928090f6420e48de853dfaa731dc489c0ab05d9b243c036930a600144f9"],"state_sha256":"527f8a2b0cf9faaa03e3ba65ee88022c860fc663615958d0c36e687c2293c05e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXFXMtFzDvRvCseV7b2b/9+mpTWBh/X7MHUvuRMmsnaOCUlHR1wUNQhYPKgP7NKfZ3QzQ4SVnpYRllcXGFXlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T10:40:04.030204Z","bundle_sha256":"85d98db61af8be13919481f1d85ff7c18b771bc2867584b268b06939245f9032"}}