{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5PEDZQ4HNMS3GM6TNRJP7UWHBF","short_pith_number":"pith:5PEDZQ4H","schema_version":"1.0","canonical_sha256":"ebc83cc3876b25b333d36c52ffd2c7094fe468bd33c0e5e3bcee2b5a82dfcbf9","source":{"kind":"arxiv","id":"1908.08871","version":2},"attestation_state":"computed","paper":{"title":"Variants of the Segment Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Alexander Ravsky, Alexander Wolff, Yoshio Okamoto","submitted_at":"2019-08-23T15:37:38Z","abstract_excerpt":"The \\emph{segment number} of a planar graph is the smallest number of line segments whose union represents a crossing-free straight-line drawing of the given graph in the plane. The segment number is a measure for the visual complexity of a drawing; it has been studied extensively.\n  In this paper, we study three variants of the segment number: for planar graphs, we consider crossing-free polyline drawings in 2D; for arbitrary graphs, we consider crossing-free straight-line drawings in 3D and straight-line drawings with crossings in 2D. We first construct an infinite family of planar graphs wh"},"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":"1908.08871","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-23T15:37:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d70c7d4759026d403bf14d23588f5caec66c4332a34521e3c311a1a77e053973","abstract_canon_sha256":"b2e723d3907a0630b330d6f04ec0f7d00a1cfd12a83fdfa9b719ed334a058377"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:00.976426Z","signature_b64":"0ZC2U2gKJ+eZBXbKFUmqgsIUXinlT0HbxGJfxUdnT4uayf7e5SpRHfrMKDG6e1lYDSVjPppH2/XiJFEr7MJJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebc83cc3876b25b333d36c52ffd2c7094fe468bd33c0e5e3bcee2b5a82dfcbf9","last_reissued_at":"2026-07-05T00:03:00.975975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:00.975975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variants of the Segment Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Alexander Ravsky, Alexander Wolff, Yoshio Okamoto","submitted_at":"2019-08-23T15:37:38Z","abstract_excerpt":"The \\emph{segment number} of a planar graph is the smallest number of line segments whose union represents a crossing-free straight-line drawing of the given graph in the plane. The segment number is a measure for the visual complexity of a drawing; it has been studied extensively.\n  In this paper, we study three variants of the segment number: for planar graphs, we consider crossing-free polyline drawings in 2D; for arbitrary graphs, we consider crossing-free straight-line drawings in 3D and straight-line drawings with crossings in 2D. We first construct an infinite family of planar graphs wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08871","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/1908.08871/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":"1908.08871","created_at":"2026-07-05T00:03:00.976029+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08871v2","created_at":"2026-07-05T00:03:00.976029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08871","created_at":"2026-07-05T00:03:00.976029+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PEDZQ4HNMS3","created_at":"2026-07-05T00:03:00.976029+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PEDZQ4HNMS3GM6T","created_at":"2026-07-05T00:03:00.976029+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PEDZQ4H","created_at":"2026-07-05T00:03:00.976029+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.18885","citing_title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5PEDZQ4HNMS3GM6TNRJP7UWHBF","json":"https://pith.science/pith/5PEDZQ4HNMS3GM6TNRJP7UWHBF.json","graph_json":"https://pith.science/api/pith-number/5PEDZQ4HNMS3GM6TNRJP7UWHBF/graph.json","events_json":"https://pith.science/api/pith-number/5PEDZQ4HNMS3GM6TNRJP7UWHBF/events.json","paper":"https://pith.science/paper/5PEDZQ4H"},"agent_actions":{"view_html":"https://pith.science/pith/5PEDZQ4HNMS3GM6TNRJP7UWHBF","download_json":"https://pith.science/pith/5PEDZQ4HNMS3GM6TNRJP7UWHBF.json","view_paper":"https://pith.science/paper/5PEDZQ4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08871&json=true","fetch_graph":"https://pith.science/api/pith-number/5PEDZQ4HNMS3GM6TNRJP7UWHBF/graph.json","fetch_events":"https://pith.science/api/pith-number/5PEDZQ4HNMS3GM6TNRJP7UWHBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PEDZQ4HNMS3GM6TNRJP7UWHBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PEDZQ4HNMS3GM6TNRJP7UWHBF/action/storage_attestation","attest_author":"https://pith.science/pith/5PEDZQ4HNMS3GM6TNRJP7UWHBF/action/author_attestation","sign_citation":"https://pith.science/pith/5PEDZQ4HNMS3GM6TNRJP7UWHBF/action/citation_signature","submit_replication":"https://pith.science/pith/5PEDZQ4HNMS3GM6TNRJP7UWHBF/action/replication_record"}},"created_at":"2026-07-05T00:03:00.976029+00:00","updated_at":"2026-07-05T00:03:00.976029+00:00"}