{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3EV4VESZ5RAQDX4LAVFWTW5ULX","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":"2269d915aff5c7f47d512e304692c1738939b4603dc85208088a4045ecdcda4d","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T22:20:25Z","title_canon_sha256":"499d119fceddbf4400221ed3540185e91e78026ba107632078bba4fe5da604fa"},"schema_version":"1.0","source":{"id":"1702.00849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.00849","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"arxiv_version","alias_value":"1702.00849v1","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00849","created_at":"2026-05-18T00:51:29Z"},{"alias_kind":"pith_short_12","alias_value":"3EV4VESZ5RAQ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3EV4VESZ5RAQDX4L","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3EV4VESZ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:90088815ec43b03773ab58104b004deb9fe71d773471ef5152bb50dc05b28921","target":"graph","created_at":"2026-05-18T00:51:29Z","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":"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.","authors_text":"Chaya Keller, Shakhar Smorodinsky","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T22:20:25Z","title":"On the union complexity of families of axis-parallel rectangles with a low packing number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00849","kind":"arxiv","version":1},"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:3078cd99abee199043a89b91546fe22ccff40292c52abeaaddab8f2042f18319","target":"record","created_at":"2026-05-18T00:51:29Z","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":"2269d915aff5c7f47d512e304692c1738939b4603dc85208088a4045ecdcda4d","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-02T22:20:25Z","title_canon_sha256":"499d119fceddbf4400221ed3540185e91e78026ba107632078bba4fe5da604fa"},"schema_version":"1.0","source":{"id":"1702.00849","kind":"arxiv","version":1}},"canonical_sha256":"d92bca9259ec4101df8b054b69dbb45dd5dcc66c45786b890ad1e7c9a4c97c4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d92bca9259ec4101df8b054b69dbb45dd5dcc66c45786b890ad1e7c9a4c97c4b","first_computed_at":"2026-05-18T00:51:29.592046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:29.592046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GD2YGiDoUk26caCukQVzDqotPIDOr4MW39If6qHmzqOTBBUx7cLfg5LUnIUZPuMq8HKTn5dMx2osKXj5VvwPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:29.592468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.00849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3078cd99abee199043a89b91546fe22ccff40292c52abeaaddab8f2042f18319","sha256:90088815ec43b03773ab58104b004deb9fe71d773471ef5152bb50dc05b28921"],"state_sha256":"a34ae226be61b18857c2a034407fde88a1ce045e642f26fa65eb1ee4bd9f9ebb"}