{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LYHRWL3IEICY2MDYFNSQB4RAVZ","short_pith_number":"pith:LYHRWL3I","schema_version":"1.0","canonical_sha256":"5e0f1b2f6822058d30782b6500f220ae4aefd0ebe60c18aa31b6fee72fac542d","source":{"kind":"arxiv","id":"1505.01410","version":2},"attestation_state":"computed","paper":{"title":"On Monotone Drawings of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Andr\\'e Schulz, Joachim Spoerhase, Philipp Kindermann","submitted_at":"2015-05-06T15:54:32Z","abstract_excerpt":"A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with $n$ vertices on an $O(n^{1.5}) \\times O(n^{1.5})$ grid whose angles are close to the best possible angular resolution. Our drawings are convex, that is, if every edge to a leaf is substituted by a ray, the (unbounded) faces form convex regions. It is known that convex drawings are monotone and, in the case of trees, also crossing-free.\n  A monotone drawing is strongly monotone if, for eve"},"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":"1505.01410","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-06T15:54:32Z","cross_cats_sorted":[],"title_canon_sha256":"88c2e59aa8b9d7f19fcfc023f2ab4d5c0cc043c794597e9835809fff3d19eaee","abstract_canon_sha256":"58b28711ad8b1d0ce792454c01755203c98914003f06bd0604a290bf01646ac7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:26.450450Z","signature_b64":"/8ZUaK4BsIdb2sE7uZI5RcJieKXO2YdBSL/CLxBbOIAHNQ5k3AUAny9bToX08swfinYxGPafJJBpa+wHn/WTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e0f1b2f6822058d30782b6500f220ae4aefd0ebe60c18aa31b6fee72fac542d","last_reissued_at":"2026-05-18T01:16:26.449889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:26.449889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Monotone Drawings of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Andr\\'e Schulz, Joachim Spoerhase, Philipp Kindermann","submitted_at":"2015-05-06T15:54:32Z","abstract_excerpt":"A crossing-free straight-line drawing of a graph is monotone if there is a monotone path between any pair of vertices with respect to some direction. We show how to construct a monotone drawing of a tree with $n$ vertices on an $O(n^{1.5}) \\times O(n^{1.5})$ grid whose angles are close to the best possible angular resolution. Our drawings are convex, that is, if every edge to a leaf is substituted by a ray, the (unbounded) faces form convex regions. It is known that convex drawings are monotone and, in the case of trees, also crossing-free.\n  A monotone drawing is strongly monotone if, for eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01410","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":"1505.01410","created_at":"2026-05-18T01:16:26.449978+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01410v2","created_at":"2026-05-18T01:16:26.449978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01410","created_at":"2026-05-18T01:16:26.449978+00:00"},{"alias_kind":"pith_short_12","alias_value":"LYHRWL3IEICY","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LYHRWL3IEICY2MDY","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LYHRWL3I","created_at":"2026-05-18T12:29:29.992203+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/LYHRWL3IEICY2MDYFNSQB4RAVZ","json":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ.json","graph_json":"https://pith.science/api/pith-number/LYHRWL3IEICY2MDYFNSQB4RAVZ/graph.json","events_json":"https://pith.science/api/pith-number/LYHRWL3IEICY2MDYFNSQB4RAVZ/events.json","paper":"https://pith.science/paper/LYHRWL3I"},"agent_actions":{"view_html":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ","download_json":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ.json","view_paper":"https://pith.science/paper/LYHRWL3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01410&json=true","fetch_graph":"https://pith.science/api/pith-number/LYHRWL3IEICY2MDYFNSQB4RAVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LYHRWL3IEICY2MDYFNSQB4RAVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/action/storage_attestation","attest_author":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/action/author_attestation","sign_citation":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/action/citation_signature","submit_replication":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/action/replication_record"}},"created_at":"2026-05-18T01:16:26.449978+00:00","updated_at":"2026-05-18T01:16:26.449978+00:00"}