{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TOMBN43WU5KCY64AQ3P2MUXWJB","short_pith_number":"pith:TOMBN43W","schema_version":"1.0","canonical_sha256":"9b9816f376a7542c7b8086dfa652f6486d5bdcf085627da2c1d1274661eb0f65","source":{"kind":"arxiv","id":"1908.07647","version":1},"attestation_state":"computed","paper":{"title":"Line and Plane Cover Numbers Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Henk Meijer, Stefan Felsner, Therese Biedl","submitted_at":"2019-08-20T23:52:50Z","abstract_excerpt":"A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph $G$, the minimum such number (over all drawings in dimension $d \\in \\{2,3\\}$) is called the \\emph{$d$-dimensional weak line cover number} and denoted by $\\pi^1_d(G)$. In 3D, the minimum number of \\emph{planes} needed to cover all vertices of~$G$ is denoted by $\\pi^2_3(G)$. When edges are also required to be covered, the corresponding numbers $\\rho^1_d(G)$ and $\\rho^2_3(G)$ are called the \\emph{(strong) line cover number} and the "},"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.07647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T23:52:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e477ddff1d6effaea90ef639c7dd083db8fae89fb5002edeae4d512ce727bf9c","abstract_canon_sha256":"a17a239c5efd074fe5b6d0971c28dd16d452bdd9315b14a7a04db1e5b2c8466c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:59.918569Z","signature_b64":"W77uWs7lgbtZ1dd8kpliDXhSuvoRs/CY7Gr423k0+I/NVb9hDlC7iM5LeF1xkzmGSIN4ZwWUdjwQu8NS3cvFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b9816f376a7542c7b8086dfa652f6486d5bdcf085627da2c1d1274661eb0f65","last_reissued_at":"2026-07-04T23:58:59.918212Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:59.918212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Line and Plane Cover Numbers Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Henk Meijer, Stefan Felsner, Therese Biedl","submitted_at":"2019-08-20T23:52:50Z","abstract_excerpt":"A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph $G$, the minimum such number (over all drawings in dimension $d \\in \\{2,3\\}$) is called the \\emph{$d$-dimensional weak line cover number} and denoted by $\\pi^1_d(G)$. In 3D, the minimum number of \\emph{planes} needed to cover all vertices of~$G$ is denoted by $\\pi^2_3(G)$. When edges are also required to be covered, the corresponding numbers $\\rho^1_d(G)$ and $\\rho^2_3(G)$ are called the \\emph{(strong) line cover number} and the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07647","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07647/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.07647","created_at":"2026-07-04T23:58:59.918266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.07647v1","created_at":"2026-07-04T23:58:59.918266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07647","created_at":"2026-07-04T23:58:59.918266+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOMBN43WU5KC","created_at":"2026-07-04T23:58:59.918266+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOMBN43WU5KCY64A","created_at":"2026-07-04T23:58:59.918266+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOMBN43W","created_at":"2026-07-04T23:58:59.918266+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":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB","json":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB.json","graph_json":"https://pith.science/api/pith-number/TOMBN43WU5KCY64AQ3P2MUXWJB/graph.json","events_json":"https://pith.science/api/pith-number/TOMBN43WU5KCY64AQ3P2MUXWJB/events.json","paper":"https://pith.science/paper/TOMBN43W"},"agent_actions":{"view_html":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB","download_json":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB.json","view_paper":"https://pith.science/paper/TOMBN43W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.07647&json=true","fetch_graph":"https://pith.science/api/pith-number/TOMBN43WU5KCY64AQ3P2MUXWJB/graph.json","fetch_events":"https://pith.science/api/pith-number/TOMBN43WU5KCY64AQ3P2MUXWJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/action/storage_attestation","attest_author":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/action/author_attestation","sign_citation":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/action/citation_signature","submit_replication":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/action/replication_record"}},"created_at":"2026-07-04T23:58:59.918266+00:00","updated_at":"2026-07-04T23:58:59.918266+00:00"}