{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LYHRWL3IEICY2MDYFNSQB4RAVZ","short_pith_number":"pith:LYHRWL3I","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"},"canonical_sha256":"5e0f1b2f6822058d30782b6500f220ae4aefd0ebe60c18aa31b6fee72fac542d","source":{"kind":"arxiv","id":"1505.01410","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01410","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01410v2","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01410","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"pith_short_12","alias_value":"LYHRWL3IEICY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LYHRWL3IEICY2MDY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LYHRWL3I","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LYHRWL3IEICY2MDYFNSQB4RAVZ","target":"record","payload":{"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"},"canonical_sha256":"5e0f1b2f6822058d30782b6500f220ae4aefd0ebe60c18aa31b6fee72fac542d","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"},"source_kind":"arxiv","source_id":"1505.01410","source_version":2,"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-18T01:16:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AN4cb0PzVlYieG+ogsMszba1sG3mBoZfRsPL07ni7VLulyxiIImNhk5bGyoBhbCYzh74CvlHvn3//Wuc/p9NDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:19:34.329001Z"},"content_sha256":"e43894d46237c3acf128aff1a6444db9065dfa24a48c9db06c6a42f340ffcbc5","schema_version":"1.0","event_id":"sha256:e43894d46237c3acf128aff1a6444db9065dfa24a48c9db06c6a42f340ffcbc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LYHRWL3IEICY2MDYFNSQB4RAVZ","target":"graph","payload":{"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"},"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-18T01:16:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"roWroLXkqdqF+/lvPlQEZWoaOs0BT7H/3wjNBRn5pYFdlxj9Vq/cHkrw2E2+AmmuzoLS+I6/eTH/JR5LwXUdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:19:34.329361Z"},"content_sha256":"4616a4b7769053f0e4746bfff606058bac785de2b8c2608b4528298b34af4464","schema_version":"1.0","event_id":"sha256:4616a4b7769053f0e4746bfff606058bac785de2b8c2608b4528298b34af4464"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/bundle.json","state_url":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/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-31T08:19:34Z","links":{"resolver":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ","bundle":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/bundle.json","state":"https://pith.science/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LYHRWL3IEICY2MDYFNSQB4RAVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LYHRWL3IEICY2MDYFNSQB4RAVZ","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":"58b28711ad8b1d0ce792454c01755203c98914003f06bd0604a290bf01646ac7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-06T15:54:32Z","title_canon_sha256":"88c2e59aa8b9d7f19fcfc023f2ab4d5c0cc043c794597e9835809fff3d19eaee"},"schema_version":"1.0","source":{"id":"1505.01410","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01410","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01410v2","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01410","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"pith_short_12","alias_value":"LYHRWL3IEICY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LYHRWL3IEICY2MDY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LYHRWL3I","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:4616a4b7769053f0e4746bfff606058bac785de2b8c2608b4528298b34af4464","target":"graph","created_at":"2026-05-18T01:16:26Z","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":"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","authors_text":"Alexander Wolff, Andr\\'e Schulz, Joachim Spoerhase, Philipp Kindermann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-06T15:54:32Z","title":"On Monotone Drawings of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01410","kind":"arxiv","version":2},"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:e43894d46237c3acf128aff1a6444db9065dfa24a48c9db06c6a42f340ffcbc5","target":"record","created_at":"2026-05-18T01:16:26Z","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":"58b28711ad8b1d0ce792454c01755203c98914003f06bd0604a290bf01646ac7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-06T15:54:32Z","title_canon_sha256":"88c2e59aa8b9d7f19fcfc023f2ab4d5c0cc043c794597e9835809fff3d19eaee"},"schema_version":"1.0","source":{"id":"1505.01410","kind":"arxiv","version":2}},"canonical_sha256":"5e0f1b2f6822058d30782b6500f220ae4aefd0ebe60c18aa31b6fee72fac542d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e0f1b2f6822058d30782b6500f220ae4aefd0ebe60c18aa31b6fee72fac542d","first_computed_at":"2026-05-18T01:16:26.449889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:26.449889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/8ZUaK4BsIdb2sE7uZI5RcJieKXO2YdBSL/CLxBbOIAHNQ5k3AUAny9bToX08swfinYxGPafJJBpa+wHn/WTCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:26.450450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01410","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e43894d46237c3acf128aff1a6444db9065dfa24a48c9db06c6a42f340ffcbc5","sha256:4616a4b7769053f0e4746bfff606058bac785de2b8c2608b4528298b34af4464"],"state_sha256":"d19d396d7acaddfe0d2a1392e071b62da8bf45c6981195dbdb79afc819d2dba2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mpu+WQHEV6fcjjSkerZkjNDMlXS8gRK4B1d/TzxaWMnbOq4PUTr5o9qx/970hm6Jg8hOrdsM6craPrjnOgSgDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:19:34.332339Z","bundle_sha256":"b204a8434afdbc3d1c2ec9c25acafdea2b4f2c8acc53689f39dc92f70afbe799"}}