{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UF5ZPED3S7BKNBR6VDF5Z5RXVV","short_pith_number":"pith:UF5ZPED3","schema_version":"1.0","canonical_sha256":"a17b97907b97c2a6863ea8cbdcf637ad5b090aa88501bc00f77e17483403b01e","source":{"kind":"arxiv","id":"2411.14038","version":2},"attestation_state":"computed","paper":{"title":"Minimum Monotone Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Antonios Symvonis, Eleni Katsanou, Emilio Di Giacomo, Lena Schlipf, Walter Didimo","submitted_at":"2024-11-21T11:41:17Z","abstract_excerpt":"Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric representation of a given graph. More formally, given a finite set $S$ of points in the plane and a finite set $\\cal D$ of directions, a geometric spanning tree $T$ with vertex set $S$ is ${\\cal D}$-monotone if, for every pair $\\{u,v\\}$ of vertices of $T$, there exists a direction $d \\in \\cal D$ for which the unique path from $u$ to $v$ in $T$ is monotone wit"},"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":"2411.14038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-11-21T11:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"1c5382e10f6cfb57a8887002206842286e10c78452a7e58636c754d5fe674591","abstract_canon_sha256":"e95de9a98183babfce572285eafbdabc3102174e4a0f8af65b8ca6c176eeaf9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:30.045473Z","signature_b64":"vQGV9ocUwTloOS3sr7XI2XfwAh+AxtpfKak+yiv6Sa3WYXkXE+oAo1Oc+dvox8IXoi3oNvWpMZJPJpKvmZgFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a17b97907b97c2a6863ea8cbdcf637ad5b090aa88501bc00f77e17483403b01e","last_reissued_at":"2026-07-05T09:39:30.045009Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:30.045009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Monotone Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Antonios Symvonis, Eleni Katsanou, Emilio Di Giacomo, Lena Schlipf, Walter Didimo","submitted_at":"2024-11-21T11:41:17Z","abstract_excerpt":"Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric representation of a given graph. More formally, given a finite set $S$ of points in the plane and a finite set $\\cal D$ of directions, a geometric spanning tree $T$ with vertex set $S$ is ${\\cal D}$-monotone if, for every pair $\\{u,v\\}$ of vertices of $T$, there exists a direction $d \\in \\cal D$ for which the unique path from $u$ to $v$ in $T$ is monotone wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14038","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.14038/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.14038","created_at":"2026-07-05T09:39:30.045067+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14038v2","created_at":"2026-07-05T09:39:30.045067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14038","created_at":"2026-07-05T09:39:30.045067+00:00"},{"alias_kind":"pith_short_12","alias_value":"UF5ZPED3S7BK","created_at":"2026-07-05T09:39:30.045067+00:00"},{"alias_kind":"pith_short_16","alias_value":"UF5ZPED3S7BKNBR6","created_at":"2026-07-05T09:39:30.045067+00:00"},{"alias_kind":"pith_short_8","alias_value":"UF5ZPED3","created_at":"2026-07-05T09:39:30.045067+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/UF5ZPED3S7BKNBR6VDF5Z5RXVV","json":"https://pith.science/pith/UF5ZPED3S7BKNBR6VDF5Z5RXVV.json","graph_json":"https://pith.science/api/pith-number/UF5ZPED3S7BKNBR6VDF5Z5RXVV/graph.json","events_json":"https://pith.science/api/pith-number/UF5ZPED3S7BKNBR6VDF5Z5RXVV/events.json","paper":"https://pith.science/paper/UF5ZPED3"},"agent_actions":{"view_html":"https://pith.science/pith/UF5ZPED3S7BKNBR6VDF5Z5RXVV","download_json":"https://pith.science/pith/UF5ZPED3S7BKNBR6VDF5Z5RXVV.json","view_paper":"https://pith.science/paper/UF5ZPED3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14038&json=true","fetch_graph":"https://pith.science/api/pith-number/UF5ZPED3S7BKNBR6VDF5Z5RXVV/graph.json","fetch_events":"https://pith.science/api/pith-number/UF5ZPED3S7BKNBR6VDF5Z5RXVV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UF5ZPED3S7BKNBR6VDF5Z5RXVV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UF5ZPED3S7BKNBR6VDF5Z5RXVV/action/storage_attestation","attest_author":"https://pith.science/pith/UF5ZPED3S7BKNBR6VDF5Z5RXVV/action/author_attestation","sign_citation":"https://pith.science/pith/UF5ZPED3S7BKNBR6VDF5Z5RXVV/action/citation_signature","submit_replication":"https://pith.science/pith/UF5ZPED3S7BKNBR6VDF5Z5RXVV/action/replication_record"}},"created_at":"2026-07-05T09:39:30.045067+00:00","updated_at":"2026-07-05T09:39:30.045067+00:00"}