{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TOMBN43WU5KCY64AQ3P2MUXWJB","short_pith_number":"pith:TOMBN43W","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"},"canonical_sha256":"9b9816f376a7542c7b8086dfa652f6486d5bdcf085627da2c1d1274661eb0f65","source":{"kind":"arxiv","id":"1908.07647","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07647","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07647v1","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07647","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"TOMBN43WU5KC","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_16","alias_value":"TOMBN43WU5KCY64A","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_8","alias_value":"TOMBN43W","created_at":"2026-07-04T23:58:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TOMBN43WU5KCY64AQ3P2MUXWJB","target":"record","payload":{"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"},"canonical_sha256":"9b9816f376a7542c7b8086dfa652f6486d5bdcf085627da2c1d1274661eb0f65","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"},"source_kind":"arxiv","source_id":"1908.07647","source_version":1,"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-04T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0EI/G2uWOghu3n+mqtSsjzD+ZRZkcDUpCnDkj5z0/VpngG4RJKj0drwQnVxim1XgAQ+o//g/ud+aD6NXHU4sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:25:42.805121Z"},"content_sha256":"6de51dc7605839e4faec8617c1884bf47b5c9f13ec23b485724c5b7b56446e62","schema_version":"1.0","event_id":"sha256:6de51dc7605839e4faec8617c1884bf47b5c9f13ec23b485724c5b7b56446e62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TOMBN43WU5KCY64AQ3P2MUXWJB","target":"graph","payload":{"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"},"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-04T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DgUPRndaBqgC6UD1JhrLuQdq33mvgCH6lTGKGn7W3m3wQyJvC2eUmHDtUpQev5saYslmg1Yqk9kaKtF7SUmbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:25:42.805664Z"},"content_sha256":"0ea72bbd1c110312197f098b40bf40f0b930c89873f1c75514297a8ddfd47b42","schema_version":"1.0","event_id":"sha256:0ea72bbd1c110312197f098b40bf40f0b930c89873f1c75514297a8ddfd47b42"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/bundle.json","state_url":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/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-08T15:25:42Z","links":{"resolver":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB","bundle":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/bundle.json","state":"https://pith.science/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOMBN43WU5KCY64AQ3P2MUXWJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TOMBN43WU5KCY64AQ3P2MUXWJB","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":"a17a239c5efd074fe5b6d0971c28dd16d452bdd9315b14a7a04db1e5b2c8466c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T23:52:50Z","title_canon_sha256":"e477ddff1d6effaea90ef639c7dd083db8fae89fb5002edeae4d512ce727bf9c"},"schema_version":"1.0","source":{"id":"1908.07647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07647","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07647v1","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07647","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"TOMBN43WU5KC","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_16","alias_value":"TOMBN43WU5KCY64A","created_at":"2026-07-04T23:58:59Z"},{"alias_kind":"pith_short_8","alias_value":"TOMBN43W","created_at":"2026-07-04T23:58:59Z"}],"graph_snapshots":[{"event_id":"sha256:0ea72bbd1c110312197f098b40bf40f0b930c89873f1c75514297a8ddfd47b42","target":"graph","created_at":"2026-07-04T23:58:59Z","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/1908.07647/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Alexander Wolff, Henk Meijer, Stefan Felsner, Therese Biedl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T23:52:50Z","title":"Line and Plane Cover Numbers Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07647","kind":"arxiv","version":1},"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:6de51dc7605839e4faec8617c1884bf47b5c9f13ec23b485724c5b7b56446e62","target":"record","created_at":"2026-07-04T23:58:59Z","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":"a17a239c5efd074fe5b6d0971c28dd16d452bdd9315b14a7a04db1e5b2c8466c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-20T23:52:50Z","title_canon_sha256":"e477ddff1d6effaea90ef639c7dd083db8fae89fb5002edeae4d512ce727bf9c"},"schema_version":"1.0","source":{"id":"1908.07647","kind":"arxiv","version":1}},"canonical_sha256":"9b9816f376a7542c7b8086dfa652f6486d5bdcf085627da2c1d1274661eb0f65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b9816f376a7542c7b8086dfa652f6486d5bdcf085627da2c1d1274661eb0f65","first_computed_at":"2026-07-04T23:58:59.918212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:59.918212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W77uWs7lgbtZ1dd8kpliDXhSuvoRs/CY7Gr423k0+I/NVb9hDlC7iM5LeF1xkzmGSIN4ZwWUdjwQu8NS3cvFBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:59.918569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6de51dc7605839e4faec8617c1884bf47b5c9f13ec23b485724c5b7b56446e62","sha256:0ea72bbd1c110312197f098b40bf40f0b930c89873f1c75514297a8ddfd47b42"],"state_sha256":"cc1a5c5f52fc92e98d8deecea8165b421119f6f253d81d11f8350e87b338af7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2Ih9tV5DNnjtWXxboZGj0SJIFXIhu7ubPQ5ovRVY4ysHAYoiy3NpaKXQCKgokDoGTCX4rTxd39qOChtmEp/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:25:42.810145Z","bundle_sha256":"5dfaf5fb9162271b3d17c4f47ba8527ec43a279a9819a760c8e199f21e4a623e"}}