{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EMB7METAVEMZIC4Z7JXIKCUTB2","short_pith_number":"pith:EMB7META","canonical_record":{"source":{"id":"2505.18885","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-05-24T21:55:22Z","cross_cats_sorted":[],"title_canon_sha256":"ce0c4cf4401bf365605b010687bb5d9495faaf40cbaea9761ee9a5bbe456d79a","abstract_canon_sha256":"01dcc1bc44b8c81733c8b193fb6a44a8f94b8135854a29dd61b208eacae8a36d"},"schema_version":"1.0"},"canonical_sha256":"2303f61260a919940b99fa6e850a930eb341e6b67170cc996906fba86df71738","source":{"kind":"arxiv","id":"2505.18885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18885","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18885v1","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18885","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"EMB7METAVEMZ","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"pith_short_16","alias_value":"EMB7METAVEMZIC4Z","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"pith_short_8","alias_value":"EMB7META","created_at":"2026-07-05T11:09:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EMB7METAVEMZIC4Z7JXIKCUTB2","target":"record","payload":{"canonical_record":{"source":{"id":"2505.18885","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-05-24T21:55:22Z","cross_cats_sorted":[],"title_canon_sha256":"ce0c4cf4401bf365605b010687bb5d9495faaf40cbaea9761ee9a5bbe456d79a","abstract_canon_sha256":"01dcc1bc44b8c81733c8b193fb6a44a8f94b8135854a29dd61b208eacae8a36d"},"schema_version":"1.0"},"canonical_sha256":"2303f61260a919940b99fa6e850a930eb341e6b67170cc996906fba86df71738","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:21.233729Z","signature_b64":"aBjlMqWNStVv2JDVQJ0ecuchr28spugY189Od5XUI+G71TdUaKsulPyiebsdS5lmzywF26LKHBRxHTvqmyoyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2303f61260a919940b99fa6e850a930eb341e6b67170cc996906fba86df71738","last_reissued_at":"2026-07-05T11:09:21.233262Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:21.233262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.18885","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-05T11:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4tw9FyjGNdPfALo0bpHrl/0paiUcUNE8EaUHtdfsWvnUXciEyT6LA5qwOWR+ABPR7Eyq6KueWOcQD1/od+HCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:23:10.227663Z"},"content_sha256":"4fc17a06e632c1eb709dd80c8b8527b6cf46f1f7ce8cd262d677f8df05201451","schema_version":"1.0","event_id":"sha256:4fc17a06e632c1eb709dd80c8b8527b6cf46f1f7ce8cd262d677f8df05201451"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EMB7METAVEMZIC4Z7JXIKCUTB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Erhardt, Alexander Wolff","submitted_at":"2025-05-24T21:55:22Z","abstract_excerpt":"The \\emph{linear vertex arboricity} of a graph is the smallest number of sets into which the vertices of a graph can be partitioned so that each of these sets induces a linear forest. Chaplick et al. [JoCG 2020] showed that, somewhat surprisingly, the linear vertex arboricity of a graph is the same as the \\emph{3D weak line cover number} of the graph, that is, the minimum number of straight lines necessary to cover the vertices of a crossing-free straight-line drawing of the graph in $\\mathbb{R}^3$. Chaplick et al. [JGAA 2023] showed that deciding whether a given graph has linear vertex arbori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18885","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/2505.18885/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-05T11:09:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dLrtRH6mzELoWXSHbTwpa35TJGdzwjM8DADLmK8a6tf3S4JIdKxaGf6fSGiUDQNOW07VIMhiQsdgxBTBCPYKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:23:10.228155Z"},"content_sha256":"8ce38f4712366213ef50ba7d5f719ff616fb3daee5e307e948f3d2249bdc1cfe","schema_version":"1.0","event_id":"sha256:8ce38f4712366213ef50ba7d5f719ff616fb3daee5e307e948f3d2249bdc1cfe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMB7METAVEMZIC4Z7JXIKCUTB2/bundle.json","state_url":"https://pith.science/pith/EMB7METAVEMZIC4Z7JXIKCUTB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMB7METAVEMZIC4Z7JXIKCUTB2/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-08T07:23:10Z","links":{"resolver":"https://pith.science/pith/EMB7METAVEMZIC4Z7JXIKCUTB2","bundle":"https://pith.science/pith/EMB7METAVEMZIC4Z7JXIKCUTB2/bundle.json","state":"https://pith.science/pith/EMB7METAVEMZIC4Z7JXIKCUTB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMB7METAVEMZIC4Z7JXIKCUTB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EMB7METAVEMZIC4Z7JXIKCUTB2","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":"01dcc1bc44b8c81733c8b193fb6a44a8f94b8135854a29dd61b208eacae8a36d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-05-24T21:55:22Z","title_canon_sha256":"ce0c4cf4401bf365605b010687bb5d9495faaf40cbaea9761ee9a5bbe456d79a"},"schema_version":"1.0","source":{"id":"2505.18885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18885","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18885v1","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18885","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"pith_short_12","alias_value":"EMB7METAVEMZ","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"pith_short_16","alias_value":"EMB7METAVEMZIC4Z","created_at":"2026-07-05T11:09:21Z"},{"alias_kind":"pith_short_8","alias_value":"EMB7META","created_at":"2026-07-05T11:09:21Z"}],"graph_snapshots":[{"event_id":"sha256:8ce38f4712366213ef50ba7d5f719ff616fb3daee5e307e948f3d2249bdc1cfe","target":"graph","created_at":"2026-07-05T11:09:21Z","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/2505.18885/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The \\emph{linear vertex arboricity} of a graph is the smallest number of sets into which the vertices of a graph can be partitioned so that each of these sets induces a linear forest. Chaplick et al. [JoCG 2020] showed that, somewhat surprisingly, the linear vertex arboricity of a graph is the same as the \\emph{3D weak line cover number} of the graph, that is, the minimum number of straight lines necessary to cover the vertices of a crossing-free straight-line drawing of the graph in $\\mathbb{R}^3$. Chaplick et al. [JGAA 2023] showed that deciding whether a given graph has linear vertex arbori","authors_text":"Alexander Erhardt, Alexander Wolff","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-05-24T21:55:22Z","title":"The Parameterized Complexity of Computing the Linear Vertex Arboricity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18885","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:4fc17a06e632c1eb709dd80c8b8527b6cf46f1f7ce8cd262d677f8df05201451","target":"record","created_at":"2026-07-05T11:09:21Z","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":"01dcc1bc44b8c81733c8b193fb6a44a8f94b8135854a29dd61b208eacae8a36d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-05-24T21:55:22Z","title_canon_sha256":"ce0c4cf4401bf365605b010687bb5d9495faaf40cbaea9761ee9a5bbe456d79a"},"schema_version":"1.0","source":{"id":"2505.18885","kind":"arxiv","version":1}},"canonical_sha256":"2303f61260a919940b99fa6e850a930eb341e6b67170cc996906fba86df71738","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2303f61260a919940b99fa6e850a930eb341e6b67170cc996906fba86df71738","first_computed_at":"2026-07-05T11:09:21.233262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:09:21.233262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aBjlMqWNStVv2JDVQJ0ecuchr28spugY189Od5XUI+G71TdUaKsulPyiebsdS5lmzywF26LKHBRxHTvqmyoyAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:09:21.233729Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.18885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fc17a06e632c1eb709dd80c8b8527b6cf46f1f7ce8cd262d677f8df05201451","sha256:8ce38f4712366213ef50ba7d5f719ff616fb3daee5e307e948f3d2249bdc1cfe"],"state_sha256":"627417c90d7c18da9c1063adad4815656165c927a15ed8274fe9560459ef9128"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jvzbnmBqzhgtbA5xCrchrf0c9GGMXWpJpMOzSgkqno/3x+GgkaoTOUWRKMkmLJjxpq1qLqKvT8PfJqHtPTtBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T07:23:10.232936Z","bundle_sha256":"75d0de5436f66aeed4903a8a741feaff9ee50859c496e86bafb10a6d563c867d"}}