{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WEZ4R34K2X7UOA7BVQ4HYTHGCF","short_pith_number":"pith:WEZ4R34K","schema_version":"1.0","canonical_sha256":"b133c8ef8ad5ff4703e1ac387c4ce6115d6965a981e023e6dad3c7610e9f4ef0","source":{"kind":"arxiv","id":"1802.08799","version":1},"attestation_state":"computed","paper":{"title":"On Pseudo-disk Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Anirudh Donakonda, Boris Aronov, Esther Ezra, Rom Pinchasi","submitted_at":"2018-02-24T04:51:48Z","abstract_excerpt":"Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\\{D \\in P \\mid D \\cap S \\neq \\emptyset\\}$, where $S$ is a pseudo-disk in $F$. We give an upper bound of $O(nk^3)$ for the number of edges in $H(P,F)$ of cardinality at most $k$. This generalizes a result of Buzaglo et al. (2013).\n  As an application of our bound, we obtain an algorithm that computes a constant-factor approximation to the smallest _weighted_ dominating set in a collectio"},"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":"1802.08799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-24T04:51:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"40c9fa9baf07fd562e10ecb1cb69c2ae989d3abcdfa5abf2b5ccc78de860a958","abstract_canon_sha256":"325abd78eeb74a8337e2989ec8d3b99827a0aff013b80e6d5a5f3c8a70a0bcc3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:36.411600Z","signature_b64":"w8wleIcn35VfhUezPWrFQqnG9WF6bFAXQCkk4FhuUserkc8NUPH33YxyPGicyVQ8VuoIcmuOUMJSXIxJQv0aDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b133c8ef8ad5ff4703e1ac387c4ce6115d6965a981e023e6dad3c7610e9f4ef0","last_reissued_at":"2026-05-18T00:22:36.411043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:36.411043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Pseudo-disk Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Anirudh Donakonda, Boris Aronov, Esther Ezra, Rom Pinchasi","submitted_at":"2018-02-24T04:51:48Z","abstract_excerpt":"Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\\{D \\in P \\mid D \\cap S \\neq \\emptyset\\}$, where $S$ is a pseudo-disk in $F$. We give an upper bound of $O(nk^3)$ for the number of edges in $H(P,F)$ of cardinality at most $k$. This generalizes a result of Buzaglo et al. (2013).\n  As an application of our bound, we obtain an algorithm that computes a constant-factor approximation to the smallest _weighted_ dominating set in a collectio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08799","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":"1802.08799","created_at":"2026-05-18T00:22:36.411120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08799v1","created_at":"2026-05-18T00:22:36.411120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08799","created_at":"2026-05-18T00:22:36.411120+00:00"},{"alias_kind":"pith_short_12","alias_value":"WEZ4R34K2X7U","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WEZ4R34K2X7UOA7B","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WEZ4R34K","created_at":"2026-05-18T12:32:59.047623+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/WEZ4R34K2X7UOA7BVQ4HYTHGCF","json":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF.json","graph_json":"https://pith.science/api/pith-number/WEZ4R34K2X7UOA7BVQ4HYTHGCF/graph.json","events_json":"https://pith.science/api/pith-number/WEZ4R34K2X7UOA7BVQ4HYTHGCF/events.json","paper":"https://pith.science/paper/WEZ4R34K"},"agent_actions":{"view_html":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF","download_json":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF.json","view_paper":"https://pith.science/paper/WEZ4R34K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08799&json=true","fetch_graph":"https://pith.science/api/pith-number/WEZ4R34K2X7UOA7BVQ4HYTHGCF/graph.json","fetch_events":"https://pith.science/api/pith-number/WEZ4R34K2X7UOA7BVQ4HYTHGCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/action/storage_attestation","attest_author":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/action/author_attestation","sign_citation":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/action/citation_signature","submit_replication":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/action/replication_record"}},"created_at":"2026-05-18T00:22:36.411120+00:00","updated_at":"2026-05-18T00:22:36.411120+00:00"}