{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZBC5BK2ZMGBMGLOLEREIC7WRSQ","short_pith_number":"pith:ZBC5BK2Z","schema_version":"1.0","canonical_sha256":"c845d0ab596182c32dcb2448817ed19419aba45927417f431443c76d04bf9e0d","source":{"kind":"arxiv","id":"1010.5937","version":1},"attestation_state":"computed","paper":{"title":"Upward Point-Set Embeddability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonios Symvonis, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze","submitted_at":"2010-10-28T12:19:53Z","abstract_excerpt":"We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph $D$ has an upward planar embedding into a point set $S$. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of $k$-switch trees, that is a generalization of switch trees (according to this definition a switch tree is a $1$-switch tree), we show that not every $k$-switch tree admits an upward planar straight-line embedding into any convex point set, for any $k \\geq 2$. Finally we show that the problem of "},"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":"1010.5937","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-10-28T12:19:53Z","cross_cats_sorted":[],"title_canon_sha256":"431faf1dd514d96b063b64ac5958e7ce8d46ddaf7ed2feb3563b7eace5d8e732","abstract_canon_sha256":"78b6feda7cff0a4424a207c23b006d3dfab350043d7c7b7dc8b752ae69e23f13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:55.342240Z","signature_b64":"QwrhNKjoMR6JYuD+8CoiSASVYSObfhamo1I+3fHAq/5RWuoTjlQlwyR97rnm2AX5BgIq0F44AMx+LuOEUiULBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c845d0ab596182c32dcb2448817ed19419aba45927417f431443c76d04bf9e0d","last_reissued_at":"2026-05-18T02:04:55.341689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:55.341689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upward Point-Set Embeddability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonios Symvonis, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze","submitted_at":"2010-10-28T12:19:53Z","abstract_excerpt":"We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph $D$ has an upward planar embedding into a point set $S$. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of $k$-switch trees, that is a generalization of switch trees (according to this definition a switch tree is a $1$-switch tree), we show that not every $k$-switch tree admits an upward planar straight-line embedding into any convex point set, for any $k \\geq 2$. Finally we show that the problem of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5937","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":"1010.5937","created_at":"2026-05-18T02:04:55.341760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5937v1","created_at":"2026-05-18T02:04:55.341760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5937","created_at":"2026-05-18T02:04:55.341760+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBC5BK2ZMGBM","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBC5BK2ZMGBMGLOL","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBC5BK2Z","created_at":"2026-05-18T12:26:17.028572+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/ZBC5BK2ZMGBMGLOLEREIC7WRSQ","json":"https://pith.science/pith/ZBC5BK2ZMGBMGLOLEREIC7WRSQ.json","graph_json":"https://pith.science/api/pith-number/ZBC5BK2ZMGBMGLOLEREIC7WRSQ/graph.json","events_json":"https://pith.science/api/pith-number/ZBC5BK2ZMGBMGLOLEREIC7WRSQ/events.json","paper":"https://pith.science/paper/ZBC5BK2Z"},"agent_actions":{"view_html":"https://pith.science/pith/ZBC5BK2ZMGBMGLOLEREIC7WRSQ","download_json":"https://pith.science/pith/ZBC5BK2ZMGBMGLOLEREIC7WRSQ.json","view_paper":"https://pith.science/paper/ZBC5BK2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5937&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBC5BK2ZMGBMGLOLEREIC7WRSQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBC5BK2ZMGBMGLOLEREIC7WRSQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBC5BK2ZMGBMGLOLEREIC7WRSQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBC5BK2ZMGBMGLOLEREIC7WRSQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZBC5BK2ZMGBMGLOLEREIC7WRSQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZBC5BK2ZMGBMGLOLEREIC7WRSQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZBC5BK2ZMGBMGLOLEREIC7WRSQ/action/replication_record"}},"created_at":"2026-05-18T02:04:55.341760+00:00","updated_at":"2026-05-18T02:04:55.341760+00:00"}