{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CKGA3W2C4AJOI4SMBS2NYJJSWX","short_pith_number":"pith:CKGA3W2C","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"},"canonical_sha256":"128c0ddb42e012e4724c0cb4dc2532b5f50a4ae54dba5dff1636f0450ea819ca","source":{"kind":"arxiv","id":"2308.15416","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15416","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15416v3","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15416","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"CKGA3W2C4AJO","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"pith_short_16","alias_value":"CKGA3W2C4AJOI4SM","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"pith_short_8","alias_value":"CKGA3W2C","created_at":"2026-07-05T08:39:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CKGA3W2C4AJOI4SMBS2NYJJSWX","target":"record","payload":{"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"},"canonical_sha256":"128c0ddb42e012e4724c0cb4dc2532b5f50a4ae54dba5dff1636f0450ea819ca","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"},"source_kind":"arxiv","source_id":"2308.15416","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZUfrb8ni2g8i2i4us+Dxtdj7KVJn5sSeDk4jO8sP6Lw3bl8hMKVRxK9StaSjTUM3083+5nDqpWExOaOTeLYWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:58:00.713645Z"},"content_sha256":"b10c8d112777d3a175264cf998c1b6239267e33e5ad51f253d828a476c77dffb","schema_version":"1.0","event_id":"sha256:b10c8d112777d3a175264cf998c1b6239267e33e5ad51f253d828a476c77dffb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CKGA3W2C4AJOI4SMBS2NYJJSWX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhj+BkqlBQGvp+2l4Fm1faQX9vTPbcl7KJMYRvOuVHCzJIfSWn6p1VcqoqcfyPgMyfGktuJNgoFaZPFjkvT2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:58:00.714249Z"},"content_sha256":"f430096f6a079304e03a5acf5af396aab6ca6473fccb86b06949f03a4d9b2b0a","schema_version":"1.0","event_id":"sha256:f430096f6a079304e03a5acf5af396aab6ca6473fccb86b06949f03a4d9b2b0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/bundle.json","state_url":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T16:58:00Z","links":{"resolver":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX","bundle":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/bundle.json","state":"https://pith.science/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKGA3W2C4AJOI4SMBS2NYJJSWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CKGA3W2C4AJOI4SMBS2NYJJSWX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ff4f1fae913bc08529ef74782533c37c8ee976a89df3a606565a23d849339b87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-08-29T16:21:08Z","title_canon_sha256":"945bee3bd129fc942b9910e6754cd5b8560439f551ca8c1d407c5f6a41ce4cfb"},"schema_version":"1.0","source":{"id":"2308.15416","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15416","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15416v3","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15416","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"CKGA3W2C4AJO","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"pith_short_16","alias_value":"CKGA3W2C4AJOI4SM","created_at":"2026-07-05T08:39:17Z"},{"alias_kind":"pith_short_8","alias_value":"CKGA3W2C","created_at":"2026-07-05T08:39:17Z"}],"graph_snapshots":[{"event_id":"sha256:f430096f6a079304e03a5acf5af396aab6ca6473fccb86b06949f03a4d9b2b0a","target":"graph","created_at":"2026-07-05T08:39:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.15416/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alexander Wolff, Giordano Da Lozzo, Jan Kratochv\\'il, Luca Grilli, Sabine Cornelsen, Siddharth Gupta","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-08-29T16:21:08Z","title":"The Parametrized Complexity of the Segment Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15416","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b10c8d112777d3a175264cf998c1b6239267e33e5ad51f253d828a476c77dffb","target":"record","created_at":"2026-07-05T08:39:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ff4f1fae913bc08529ef74782533c37c8ee976a89df3a606565a23d849339b87","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-08-29T16:21:08Z","title_canon_sha256":"945bee3bd129fc942b9910e6754cd5b8560439f551ca8c1d407c5f6a41ce4cfb"},"schema_version":"1.0","source":{"id":"2308.15416","kind":"arxiv","version":3}},"canonical_sha256":"128c0ddb42e012e4724c0cb4dc2532b5f50a4ae54dba5dff1636f0450ea819ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"128c0ddb42e012e4724c0cb4dc2532b5f50a4ae54dba5dff1636f0450ea819ca","first_computed_at":"2026-07-05T08:39:17.585250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:39:17.585250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bTXy4Xv4sW2NyAb0kZc3f2nXGWxUtk8uOj9o8sCDu+ULvpxtcuH4YvgXRqYcCRd0SCGgGnn2pVQ1c4VJtHLDBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:39:17.585906Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.15416","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b10c8d112777d3a175264cf998c1b6239267e33e5ad51f253d828a476c77dffb","sha256:f430096f6a079304e03a5acf5af396aab6ca6473fccb86b06949f03a4d9b2b0a"],"state_sha256":"f38c8c3191b2c4ed2718c21340ea15d6cdf74a35c9383196fdd42aa8baeab8dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ExJEnOedgP2BaI1PK4Ta++kQNIfGi+EisZIkW0bMRCt+qJ+y+woOpghQ8YPppnU/SDQYuxZ4XpNAkWkzwBCtBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:58:00.724889Z","bundle_sha256":"ed249c6f8742dc0cd3d6cea697c47c922fd03f8e353471e4f09b667f2816bf5e"}}