{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WEZ4R34K2X7UOA7BVQ4HYTHGCF","short_pith_number":"pith:WEZ4R34K","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"},"canonical_sha256":"b133c8ef8ad5ff4703e1ac387c4ce6115d6965a981e023e6dad3c7610e9f4ef0","source":{"kind":"arxiv","id":"1802.08799","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08799","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08799v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08799","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"WEZ4R34K2X7U","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WEZ4R34K2X7UOA7B","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WEZ4R34K","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WEZ4R34K2X7UOA7BVQ4HYTHGCF","target":"record","payload":{"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"},"canonical_sha256":"b133c8ef8ad5ff4703e1ac387c4ce6115d6965a981e023e6dad3c7610e9f4ef0","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"},"source_kind":"arxiv","source_id":"1802.08799","source_version":1,"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-18T00:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhlZsQITNLj7m+UsDP/wlStYJ6vFvJQuwwQOUy68x9h/DlcZyVO7tAm78pj1IpksgUMFKc4CxfP31QyZ4zqoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:33:26.407133Z"},"content_sha256":"b9836d7f5c768aacccabff3ff100259206f1d15953e27d1bc32c843e5a725503","schema_version":"1.0","event_id":"sha256:b9836d7f5c768aacccabff3ff100259206f1d15953e27d1bc32c843e5a725503"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WEZ4R34K2X7UOA7BVQ4HYTHGCF","target":"graph","payload":{"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"},"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-18T00:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POQTAjunQ2r+EL/u0nAQboczJN/ubbguC2aTxOQ16YtPetsEqoXb44nxXy9SMppu8u7otFQ6dfWvAcsk0XGYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:33:26.407832Z"},"content_sha256":"814f83c439b4df753731b9d58004a729792bf457eafa889ab6f883d569a5da7b","schema_version":"1.0","event_id":"sha256:814f83c439b4df753731b9d58004a729792bf457eafa889ab6f883d569a5da7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/bundle.json","state_url":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/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-05-25T23:33:26Z","links":{"resolver":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF","bundle":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/bundle.json","state":"https://pith.science/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEZ4R34K2X7UOA7BVQ4HYTHGCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WEZ4R34K2X7UOA7BVQ4HYTHGCF","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":"325abd78eeb74a8337e2989ec8d3b99827a0aff013b80e6d5a5f3c8a70a0bcc3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-24T04:51:48Z","title_canon_sha256":"40c9fa9baf07fd562e10ecb1cb69c2ae989d3abcdfa5abf2b5ccc78de860a958"},"schema_version":"1.0","source":{"id":"1802.08799","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08799","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08799v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08799","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"WEZ4R34K2X7U","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WEZ4R34K2X7UOA7B","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WEZ4R34K","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:814f83c439b4df753731b9d58004a729792bf457eafa889ab6f883d569a5da7b","target":"graph","created_at":"2026-05-18T00:22:36Z","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 $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","authors_text":"Anirudh Donakonda, Boris Aronov, Esther Ezra, Rom Pinchasi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-24T04:51:48Z","title":"On Pseudo-disk Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08799","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:b9836d7f5c768aacccabff3ff100259206f1d15953e27d1bc32c843e5a725503","target":"record","created_at":"2026-05-18T00:22:36Z","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":"325abd78eeb74a8337e2989ec8d3b99827a0aff013b80e6d5a5f3c8a70a0bcc3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-02-24T04:51:48Z","title_canon_sha256":"40c9fa9baf07fd562e10ecb1cb69c2ae989d3abcdfa5abf2b5ccc78de860a958"},"schema_version":"1.0","source":{"id":"1802.08799","kind":"arxiv","version":1}},"canonical_sha256":"b133c8ef8ad5ff4703e1ac387c4ce6115d6965a981e023e6dad3c7610e9f4ef0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b133c8ef8ad5ff4703e1ac387c4ce6115d6965a981e023e6dad3c7610e9f4ef0","first_computed_at":"2026-05-18T00:22:36.411043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:36.411043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w8wleIcn35VfhUezPWrFQqnG9WF6bFAXQCkk4FhuUserkc8NUPH33YxyPGicyVQ8VuoIcmuOUMJSXIxJQv0aDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:36.411600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08799","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9836d7f5c768aacccabff3ff100259206f1d15953e27d1bc32c843e5a725503","sha256:814f83c439b4df753731b9d58004a729792bf457eafa889ab6f883d569a5da7b"],"state_sha256":"c73ae3e71ba64250925912a3000d99ae5f384a66fbfa633871521bfa6672b853"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A3A3uhDRgAIThqSFnjIBDW6FqaYXedAxb5CutF5MEUCj9UU6D1GCO8ywNoT0WbIp209jzuuhQel9O4+LK3PiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:33:26.411464Z","bundle_sha256":"97016d6e98bdded267d44fdc8c2271a03b25902538db708337d6f9760bf6f114"}}