{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PPJX3DMGYML4VDGNDMTWJ45DPP","short_pith_number":"pith:PPJX3DMG","schema_version":"1.0","canonical_sha256":"7bd37d8d86c317ca8ccd1b2764f3a37bc36679ac9705bf3b825184039e768ca4","source":{"kind":"arxiv","id":"1806.08770","version":3},"attestation_state":"computed","paper":{"title":"Uniform 2D-Monotone Minimum Spanning Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Konstantinos Mastakas","submitted_at":"2018-06-22T17:07:02Z","abstract_excerpt":"A geometric graph $G$ is $xy-$monotone if each pair of vertices of $G$ is connected by a $xy-$monotone path. We study the problem of producing the $xy-$monotone spanning geometric graph of a point set $P$ that (i) has the minimum cost, where the cost of a geometric graph is the sum of the Euclidean lengths of its edges, and (ii) has the least number of edges, in the cases that the Cartesian System $xy$ is specified or freely selected. Building upon previous results, we easily obtain that the two solutions coincide when the Cartesian System is specified and are both equal to the rectangle of in"},"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":"1806.08770","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-06-22T17:07:02Z","cross_cats_sorted":[],"title_canon_sha256":"8a21504d83c0c8b185694d29de121ebed70985a25a70699cc07b141b3b086f7d","abstract_canon_sha256":"fc716d45b1cb898c1497d68203d2bf0a0bbdbf19141d97be3f78081d8e1fb301"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:44.643812Z","signature_b64":"nwLVc6kKtv4TdTjos6NbYxDMvCuGsreVxQoA9zLSx9dtmcWjTg4CrpTJjprQzzDSvvwkYNAHkPu1FljZARilDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bd37d8d86c317ca8ccd1b2764f3a37bc36679ac9705bf3b825184039e768ca4","last_reissued_at":"2026-05-18T00:04:44.643067Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:44.643067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniform 2D-Monotone Minimum Spanning Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Konstantinos Mastakas","submitted_at":"2018-06-22T17:07:02Z","abstract_excerpt":"A geometric graph $G$ is $xy-$monotone if each pair of vertices of $G$ is connected by a $xy-$monotone path. We study the problem of producing the $xy-$monotone spanning geometric graph of a point set $P$ that (i) has the minimum cost, where the cost of a geometric graph is the sum of the Euclidean lengths of its edges, and (ii) has the least number of edges, in the cases that the Cartesian System $xy$ is specified or freely selected. Building upon previous results, we easily obtain that the two solutions coincide when the Cartesian System is specified and are both equal to the rectangle of in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08770","kind":"arxiv","version":3},"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":"1806.08770","created_at":"2026-05-18T00:04:44.643188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08770v3","created_at":"2026-05-18T00:04:44.643188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08770","created_at":"2026-05-18T00:04:44.643188+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPJX3DMGYML4","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPJX3DMGYML4VDGN","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPJX3DMG","created_at":"2026-05-18T12:32:46.962924+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/PPJX3DMGYML4VDGNDMTWJ45DPP","json":"https://pith.science/pith/PPJX3DMGYML4VDGNDMTWJ45DPP.json","graph_json":"https://pith.science/api/pith-number/PPJX3DMGYML4VDGNDMTWJ45DPP/graph.json","events_json":"https://pith.science/api/pith-number/PPJX3DMGYML4VDGNDMTWJ45DPP/events.json","paper":"https://pith.science/paper/PPJX3DMG"},"agent_actions":{"view_html":"https://pith.science/pith/PPJX3DMGYML4VDGNDMTWJ45DPP","download_json":"https://pith.science/pith/PPJX3DMGYML4VDGNDMTWJ45DPP.json","view_paper":"https://pith.science/paper/PPJX3DMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08770&json=true","fetch_graph":"https://pith.science/api/pith-number/PPJX3DMGYML4VDGNDMTWJ45DPP/graph.json","fetch_events":"https://pith.science/api/pith-number/PPJX3DMGYML4VDGNDMTWJ45DPP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPJX3DMGYML4VDGNDMTWJ45DPP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPJX3DMGYML4VDGNDMTWJ45DPP/action/storage_attestation","attest_author":"https://pith.science/pith/PPJX3DMGYML4VDGNDMTWJ45DPP/action/author_attestation","sign_citation":"https://pith.science/pith/PPJX3DMGYML4VDGNDMTWJ45DPP/action/citation_signature","submit_replication":"https://pith.science/pith/PPJX3DMGYML4VDGNDMTWJ45DPP/action/replication_record"}},"created_at":"2026-05-18T00:04:44.643188+00:00","updated_at":"2026-05-18T00:04:44.643188+00:00"}