{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2HJFQ4HAV57LP27AMMHOGB2TL6","short_pith_number":"pith:2HJFQ4HA","schema_version":"1.0","canonical_sha256":"d1d25870e0af7eb7ebe0630ee307535fae09dbe82e9582090a6871593eb3e9ae","source":{"kind":"arxiv","id":"1201.0241","version":2},"attestation_state":"computed","paper":{"title":"Upper bounds for the piercing number of families of pairwise intersecting convex polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"David Nashtir, Meir Katchalski","submitted_at":"2011-12-31T08:10:40Z","abstract_excerpt":"A convex polygon $A$ is related to a convex $m$-gon $K= \\bigcap_{i=1}^m k_i^+$, where $k_1^+,..., k_m^+$ are the $m$ halfplanes whose intersection is equal to $K$, if $A$ is the intersection of halfplanes $a_1^+,...,a_l$, each of which is a translate of one of the $k_i^+$-s. The planar family ${\\cal A}$ is related to $K$ if each $A \\in {\\cal A}$ is related to $K$. We prove that any family of pairwise intersecting convex sets related to a given $n$-gon has a finite piercing number which depends on $n$. In the general case we show $O(3^{n^3})$, while for a certain class of families, we decrease "},"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":"1201.0241","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2011-12-31T08:10:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"881c3e04f5c566c8e9a44f71a1ff6fcc19bb53e16875ab96e239893ea99ce7a9","abstract_canon_sha256":"888be5083b6d54dafe252a87015b1c9af2bdf8f8cc1719a51d8dc34bc08aa794"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:15.712938Z","signature_b64":"a2b9fcLFOYOeg5DBoHry3wK8vpK6s8CXHzVcWrzIOPX6XvOHDj8KDUkCfslTRMHomwMTprLX6cx2rxfz16FwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1d25870e0af7eb7ebe0630ee307535fae09dbe82e9582090a6871593eb3e9ae","last_reissued_at":"2026-05-18T04:05:15.712288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:15.712288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upper bounds for the piercing number of families of pairwise intersecting convex polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"David Nashtir, Meir Katchalski","submitted_at":"2011-12-31T08:10:40Z","abstract_excerpt":"A convex polygon $A$ is related to a convex $m$-gon $K= \\bigcap_{i=1}^m k_i^+$, where $k_1^+,..., k_m^+$ are the $m$ halfplanes whose intersection is equal to $K$, if $A$ is the intersection of halfplanes $a_1^+,...,a_l$, each of which is a translate of one of the $k_i^+$-s. The planar family ${\\cal A}$ is related to $K$ if each $A \\in {\\cal A}$ is related to $K$. We prove that any family of pairwise intersecting convex sets related to a given $n$-gon has a finite piercing number which depends on $n$. In the general case we show $O(3^{n^3})$, while for a certain class of families, we decrease "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0241","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":"1201.0241","created_at":"2026-05-18T04:05:15.712413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.0241v2","created_at":"2026-05-18T04:05:15.712413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0241","created_at":"2026-05-18T04:05:15.712413+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HJFQ4HAV57L","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HJFQ4HAV57LP27A","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HJFQ4HA","created_at":"2026-05-18T12:26:18.847500+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/2HJFQ4HAV57LP27AMMHOGB2TL6","json":"https://pith.science/pith/2HJFQ4HAV57LP27AMMHOGB2TL6.json","graph_json":"https://pith.science/api/pith-number/2HJFQ4HAV57LP27AMMHOGB2TL6/graph.json","events_json":"https://pith.science/api/pith-number/2HJFQ4HAV57LP27AMMHOGB2TL6/events.json","paper":"https://pith.science/paper/2HJFQ4HA"},"agent_actions":{"view_html":"https://pith.science/pith/2HJFQ4HAV57LP27AMMHOGB2TL6","download_json":"https://pith.science/pith/2HJFQ4HAV57LP27AMMHOGB2TL6.json","view_paper":"https://pith.science/paper/2HJFQ4HA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.0241&json=true","fetch_graph":"https://pith.science/api/pith-number/2HJFQ4HAV57LP27AMMHOGB2TL6/graph.json","fetch_events":"https://pith.science/api/pith-number/2HJFQ4HAV57LP27AMMHOGB2TL6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HJFQ4HAV57LP27AMMHOGB2TL6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HJFQ4HAV57LP27AMMHOGB2TL6/action/storage_attestation","attest_author":"https://pith.science/pith/2HJFQ4HAV57LP27AMMHOGB2TL6/action/author_attestation","sign_citation":"https://pith.science/pith/2HJFQ4HAV57LP27AMMHOGB2TL6/action/citation_signature","submit_replication":"https://pith.science/pith/2HJFQ4HAV57LP27AMMHOGB2TL6/action/replication_record"}},"created_at":"2026-05-18T04:05:15.712413+00:00","updated_at":"2026-05-18T04:05:15.712413+00:00"}