{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:R5JRZ6MH5LM74JKQNXIM3GIQTK","short_pith_number":"pith:R5JRZ6MH","schema_version":"1.0","canonical_sha256":"8f531cf987ead9fe25506dd0cd99109a8221264977721066cf1de4e565ab3373","source":{"kind":"arxiv","id":"1608.03943","version":1},"attestation_state":"computed","paper":{"title":"Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Md. Jawaherul Alam, Michael Dillencourt, Michael T. Goodrich","submitted_at":"2016-08-13T05:22:02Z","abstract_excerpt":"Inspired by the artwork of Mark Lombardi, we study the problem of constructing orthogonal drawings where a small number of horizontal and vertical line segments covers all vertices. We study two problems on orthogonal drawings of planar graphs, one that minimizes the total number of line segments and another that minimizes the number of line segments that cover all the vertices. We show that the first problem can be solved by a non-trivial modification of the flow-network orthogonal bend-minimization algorithm of Tamassia, resulting in a polynomial-time algorithm. We show that the second probl"},"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":"1608.03943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-08-13T05:22:02Z","cross_cats_sorted":[],"title_canon_sha256":"10897e7bb4f3daf81c667c7de8b89087724fd754ecdc6ca00feefa041d10a86c","abstract_canon_sha256":"e36640841ceca6be5ce13653b36448e1da8655a0c5c1f7110103cf9233de58ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:04.604176Z","signature_b64":"/WyntAoI+RCcXS4dsvU7Ic3SDsIlrVdoPnAQhZHQ72oY3DztXLJRmUUwd2Yg6kgdkmOX4J6nfofd3L1I900mBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f531cf987ead9fe25506dd0cd99109a8221264977721066cf1de4e565ab3373","last_reissued_at":"2026-05-18T01:09:04.603685Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:04.603685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capturing Lombardi Flow in Orthogonal Drawings by Minimizing the Number of Segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Md. Jawaherul Alam, Michael Dillencourt, Michael T. Goodrich","submitted_at":"2016-08-13T05:22:02Z","abstract_excerpt":"Inspired by the artwork of Mark Lombardi, we study the problem of constructing orthogonal drawings where a small number of horizontal and vertical line segments covers all vertices. We study two problems on orthogonal drawings of planar graphs, one that minimizes the total number of line segments and another that minimizes the number of line segments that cover all the vertices. We show that the first problem can be solved by a non-trivial modification of the flow-network orthogonal bend-minimization algorithm of Tamassia, resulting in a polynomial-time algorithm. We show that the second probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03943","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":"1608.03943","created_at":"2026-05-18T01:09:04.603752+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03943v1","created_at":"2026-05-18T01:09:04.603752+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03943","created_at":"2026-05-18T01:09:04.603752+00:00"},{"alias_kind":"pith_short_12","alias_value":"R5JRZ6MH5LM7","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"R5JRZ6MH5LM74JKQ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"R5JRZ6MH","created_at":"2026-05-18T12:30:41.710351+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/R5JRZ6MH5LM74JKQNXIM3GIQTK","json":"https://pith.science/pith/R5JRZ6MH5LM74JKQNXIM3GIQTK.json","graph_json":"https://pith.science/api/pith-number/R5JRZ6MH5LM74JKQNXIM3GIQTK/graph.json","events_json":"https://pith.science/api/pith-number/R5JRZ6MH5LM74JKQNXIM3GIQTK/events.json","paper":"https://pith.science/paper/R5JRZ6MH"},"agent_actions":{"view_html":"https://pith.science/pith/R5JRZ6MH5LM74JKQNXIM3GIQTK","download_json":"https://pith.science/pith/R5JRZ6MH5LM74JKQNXIM3GIQTK.json","view_paper":"https://pith.science/paper/R5JRZ6MH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03943&json=true","fetch_graph":"https://pith.science/api/pith-number/R5JRZ6MH5LM74JKQNXIM3GIQTK/graph.json","fetch_events":"https://pith.science/api/pith-number/R5JRZ6MH5LM74JKQNXIM3GIQTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R5JRZ6MH5LM74JKQNXIM3GIQTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R5JRZ6MH5LM74JKQNXIM3GIQTK/action/storage_attestation","attest_author":"https://pith.science/pith/R5JRZ6MH5LM74JKQNXIM3GIQTK/action/author_attestation","sign_citation":"https://pith.science/pith/R5JRZ6MH5LM74JKQNXIM3GIQTK/action/citation_signature","submit_replication":"https://pith.science/pith/R5JRZ6MH5LM74JKQNXIM3GIQTK/action/replication_record"}},"created_at":"2026-05-18T01:09:04.603752+00:00","updated_at":"2026-05-18T01:09:04.603752+00:00"}