{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3EV4VESZ5RAQDX4LAVFWTW5ULX","short_pith_number":"pith:3EV4VESZ","schema_version":"1.0","canonical_sha256":"d92bca9259ec4101df8b054b69dbb45dd5dcc66c45786b890ad1e7c9a4c97c4b","source":{"kind":"arxiv","id":"1702.00849","version":1},"attestation_state":"computed","paper":{"title":"On the union complexity of families of axis-parallel rectangles with a low packing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Chaya Keller, Shakhar Smorodinsky","submitted_at":"2017-02-02T22:20:25Z","abstract_excerpt":"Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n+p^2), and that the (<=k)-level complexity of R is at most O(kn+k^2p^2). Both upper bounds are tight."},"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":"1702.00849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T22:20:25Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"499d119fceddbf4400221ed3540185e91e78026ba107632078bba4fe5da604fa","abstract_canon_sha256":"2269d915aff5c7f47d512e304692c1738939b4603dc85208088a4045ecdcda4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:29.592468Z","signature_b64":"GD2YGiDoUk26caCukQVzDqotPIDOr4MW39If6qHmzqOTBBUx7cLfg5LUnIUZPuMq8HKTn5dMx2osKXj5VvwPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d92bca9259ec4101df8b054b69dbb45dd5dcc66c45786b890ad1e7c9a4c97c4b","last_reissued_at":"2026-05-18T00:51:29.592046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:29.592046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the union complexity of families of axis-parallel rectangles with a low packing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Chaya Keller, Shakhar Smorodinsky","submitted_at":"2017-02-02T22:20:25Z","abstract_excerpt":"Let R be a family of n axis-parallel rectangles with packing number p-1, meaning that among any p of the rectangles, there are two with a non-empty intersection. We show that the union complexity of R is at most O(n+p^2), and that the (<=k)-level complexity of R is at most O(kn+k^2p^2). Both upper bounds are tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00849","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":"1702.00849","created_at":"2026-05-18T00:51:29.592097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00849v1","created_at":"2026-05-18T00:51:29.592097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00849","created_at":"2026-05-18T00:51:29.592097+00:00"},{"alias_kind":"pith_short_12","alias_value":"3EV4VESZ5RAQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3EV4VESZ5RAQDX4L","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3EV4VESZ","created_at":"2026-05-18T12:30:58.224056+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/3EV4VESZ5RAQDX4LAVFWTW5ULX","json":"https://pith.science/pith/3EV4VESZ5RAQDX4LAVFWTW5ULX.json","graph_json":"https://pith.science/api/pith-number/3EV4VESZ5RAQDX4LAVFWTW5ULX/graph.json","events_json":"https://pith.science/api/pith-number/3EV4VESZ5RAQDX4LAVFWTW5ULX/events.json","paper":"https://pith.science/paper/3EV4VESZ"},"agent_actions":{"view_html":"https://pith.science/pith/3EV4VESZ5RAQDX4LAVFWTW5ULX","download_json":"https://pith.science/pith/3EV4VESZ5RAQDX4LAVFWTW5ULX.json","view_paper":"https://pith.science/paper/3EV4VESZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00849&json=true","fetch_graph":"https://pith.science/api/pith-number/3EV4VESZ5RAQDX4LAVFWTW5ULX/graph.json","fetch_events":"https://pith.science/api/pith-number/3EV4VESZ5RAQDX4LAVFWTW5ULX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3EV4VESZ5RAQDX4LAVFWTW5ULX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3EV4VESZ5RAQDX4LAVFWTW5ULX/action/storage_attestation","attest_author":"https://pith.science/pith/3EV4VESZ5RAQDX4LAVFWTW5ULX/action/author_attestation","sign_citation":"https://pith.science/pith/3EV4VESZ5RAQDX4LAVFWTW5ULX/action/citation_signature","submit_replication":"https://pith.science/pith/3EV4VESZ5RAQDX4LAVFWTW5ULX/action/replication_record"}},"created_at":"2026-05-18T00:51:29.592097+00:00","updated_at":"2026-05-18T00:51:29.592097+00:00"}