{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CKGA3W2C4AJOI4SMBS2NYJJSWX","short_pith_number":"pith:CKGA3W2C","schema_version":"1.0","canonical_sha256":"128c0ddb42e012e4724c0cb4dc2532b5f50a4ae54dba5dff1636f0450ea819ca","source":{"kind":"arxiv","id":"2308.15416","version":3},"attestation_state":"computed","paper":{"title":"The Parametrized Complexity of the Segment Number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Giordano Da Lozzo, Jan Kratochv\\'il, Luca Grilli, Sabine Cornelsen, Siddharth Gupta","submitted_at":"2023-08-29T16:21:08Z","abstract_excerpt":"Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph $G$, the segment number of $G$ is the minimum number of segments that can be achieved by any planar straight-line drawing of $G$. The line cover number of $G$ is the minimum number of lines that support all the edges of a planar straight-line drawing of $G$. Computing the segment number or the line cover number of a planar graph is $\\exists\\mathbb{R}$-complete and, thus, NP-hard.\n  We study the problem of computing the segment number from the perspective of parameterized"},"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":"2308.15416","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-08-29T16:21:08Z","cross_cats_sorted":[],"title_canon_sha256":"945bee3bd129fc942b9910e6754cd5b8560439f551ca8c1d407c5f6a41ce4cfb","abstract_canon_sha256":"ff4f1fae913bc08529ef74782533c37c8ee976a89df3a606565a23d849339b87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:39:17.585906Z","signature_b64":"bTXy4Xv4sW2NyAb0kZc3f2nXGWxUtk8uOj9o8sCDu+ULvpxtcuH4YvgXRqYcCRd0SCGgGnn2pVQ1c4VJtHLDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"128c0ddb42e012e4724c0cb4dc2532b5f50a4ae54dba5dff1636f0450ea819ca","last_reissued_at":"2026-07-05T08:39:17.585250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:39:17.585250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Parametrized Complexity of the Segment Number","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Giordano Da Lozzo, Jan Kratochv\\'il, Luca Grilli, Sabine Cornelsen, Siddharth Gupta","submitted_at":"2023-08-29T16:21:08Z","abstract_excerpt":"Given a straight-line drawing of a graph, a segment is a maximal set of edges that form a line segment. Given a planar graph $G$, the segment number of $G$ is the minimum number of segments that can be achieved by any planar straight-line drawing of $G$. The line cover number of $G$ is the minimum number of lines that support all the edges of a planar straight-line drawing of $G$. Computing the segment number or the line cover number of a planar graph is $\\exists\\mathbb{R}$-complete and, thus, NP-hard.\n  We study the problem of computing the segment number from the perspective of parameterized"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15416","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.15416/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":"2308.15416","created_at":"2026-07-05T08:39:17.585327+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.15416v3","created_at":"2026-07-05T08:39:17.585327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15416","created_at":"2026-07-05T08:39:17.585327+00:00"},{"alias_kind":"pith_short_12","alias_value":"CKGA3W2C4AJO","created_at":"2026-07-05T08:39:17.585327+00:00"},{"alias_kind":"pith_short_16","alias_value":"CKGA3W2C4AJOI4SM","created_at":"2026-07-05T08:39:17.585327+00:00"},{"alias_kind":"pith_short_8","alias_value":"CKGA3W2C","created_at":"2026-07-05T08:39:17.585327+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":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX","json":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX.json","graph_json":"https://pith.science/api/pith-number/CKGA3W2C4AJOI4SMBS2NYJJSWX/graph.json","events_json":"https://pith.science/api/pith-number/CKGA3W2C4AJOI4SMBS2NYJJSWX/events.json","paper":"https://pith.science/paper/CKGA3W2C"},"agent_actions":{"view_html":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX","download_json":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX.json","view_paper":"https://pith.science/paper/CKGA3W2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.15416&json=true","fetch_graph":"https://pith.science/api/pith-number/CKGA3W2C4AJOI4SMBS2NYJJSWX/graph.json","fetch_events":"https://pith.science/api/pith-number/CKGA3W2C4AJOI4SMBS2NYJJSWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/action/storage_attestation","attest_author":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/action/author_attestation","sign_citation":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/action/citation_signature","submit_replication":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/action/replication_record"}},"created_at":"2026-07-05T08:39:17.585327+00:00","updated_at":"2026-07-05T08:39:17.585327+00:00"}