{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NYGGVV3FP2VCUM4QONNTBOGHXR","short_pith_number":"pith:NYGGVV3F","canonical_record":{"source":{"id":"2411.15864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-24T14:57:26Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e8fde035a8187ef819c6d8b95d604af575c0f8a3b6224b76e05b153013b1fcd8","abstract_canon_sha256":"1e0444fb4da71bd78f38df7a1dc0ad04dccd305cf280b72bd59f523afe28621f"},"schema_version":"1.0"},"canonical_sha256":"6e0c6ad7657eaa2a3390735b30b8c7bc6a28cab4429e181bb3eb26d9340fefc6","source":{"kind":"arxiv","id":"2411.15864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15864","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15864v1","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15864","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"NYGGVV3FP2VC","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"pith_short_16","alias_value":"NYGGVV3FP2VCUM4Q","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"pith_short_8","alias_value":"NYGGVV3F","created_at":"2026-07-05T09:39:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NYGGVV3FP2VCUM4QONNTBOGHXR","target":"record","payload":{"canonical_record":{"source":{"id":"2411.15864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-24T14:57:26Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e8fde035a8187ef819c6d8b95d604af575c0f8a3b6224b76e05b153013b1fcd8","abstract_canon_sha256":"1e0444fb4da71bd78f38df7a1dc0ad04dccd305cf280b72bd59f523afe28621f"},"schema_version":"1.0"},"canonical_sha256":"6e0c6ad7657eaa2a3390735b30b8c7bc6a28cab4429e181bb3eb26d9340fefc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:41.981829Z","signature_b64":"Lj7As+DvsdDrDIyF1npRUAlkRSlMZAMtNMjRs85rui1XkrPHmD56J/jsY+iVLpRnwULaX/XM9EQO9TXxaz5nDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e0c6ad7657eaa2a3390735b30b8c7bc6a28cab4429e181bb3eb26d9340fefc6","last_reissued_at":"2026-07-05T09:39:41.981403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:41.981403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.15864","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-05T09:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWgc6UwNaKqEX15VF87hzDzkVHLhBDYgkVOhk2vAgiVc+dSYbX+1XxPSAoD8gUCXBSOleFt6WYTWWtreeIVxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:39:34.223390Z"},"content_sha256":"766de4f723f298d9514d10cd81e35ac3888ee3d88c36e625948b83ee10317497","schema_version":"1.0","event_id":"sha256:766de4f723f298d9514d10cd81e35ac3888ee3d88c36e625948b83ee10317497"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NYGGVV3FP2VCUM4QONNTBOGHXR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pathways to Tractability for Geometric Thickness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Alexander Firbas, Martin N\\\"ollenburg, Robert Ganian, Simon Dominik Fink, Thomas Depian","submitted_at":"2024-11-24T14:57:26Z","abstract_excerpt":"We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is NP-hard, we investigate its tractability through the lens of parameterized complexity. As our first set of contributions, we provide two fixed-parameter algorithms which utilize well-studied parameters of the input graph, notably the vertex cover and feedback edge numbers. Since parameterizing by the thickness itself does not yield tractability and the use of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15864","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/2411.15864/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-05T09:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jNwztW0QMrxMtILkZhyZS4UGuMLF4nxwZbLDLPM+CkCDWv1UQ+KeOuzx/SvLj+83WbR2WcBL1n4xD1FWoPj0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T03:39:34.223890Z"},"content_sha256":"3235cbf378e810f83f54f522847628ad4ea4422a613fe18a5cd2180fe43e4422","schema_version":"1.0","event_id":"sha256:3235cbf378e810f83f54f522847628ad4ea4422a613fe18a5cd2180fe43e4422"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/bundle.json","state_url":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/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-13T03:39:34Z","links":{"resolver":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR","bundle":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/bundle.json","state":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NYGGVV3FP2VCUM4QONNTBOGHXR","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":"1e0444fb4da71bd78f38df7a1dc0ad04dccd305cf280b72bd59f523afe28621f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-24T14:57:26Z","title_canon_sha256":"e8fde035a8187ef819c6d8b95d604af575c0f8a3b6224b76e05b153013b1fcd8"},"schema_version":"1.0","source":{"id":"2411.15864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15864","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15864v1","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15864","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"NYGGVV3FP2VC","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"pith_short_16","alias_value":"NYGGVV3FP2VCUM4Q","created_at":"2026-07-05T09:39:41Z"},{"alias_kind":"pith_short_8","alias_value":"NYGGVV3F","created_at":"2026-07-05T09:39:41Z"}],"graph_snapshots":[{"event_id":"sha256:3235cbf378e810f83f54f522847628ad4ea4422a613fe18a5cd2180fe43e4422","target":"graph","created_at":"2026-07-05T09:39:41Z","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/2411.15864/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is NP-hard, we investigate its tractability through the lens of parameterized complexity. As our first set of contributions, we provide two fixed-parameter algorithms which utilize well-studied parameters of the input graph, notably the vertex cover and feedback edge numbers. Since parameterizing by the thickness itself does not yield tractability and the use of o","authors_text":"Alexander Firbas, Martin N\\\"ollenburg, Robert Ganian, Simon Dominik Fink, Thomas Depian","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-24T14:57:26Z","title":"Pathways to Tractability for Geometric Thickness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15864","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:766de4f723f298d9514d10cd81e35ac3888ee3d88c36e625948b83ee10317497","target":"record","created_at":"2026-07-05T09:39:41Z","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":"1e0444fb4da71bd78f38df7a1dc0ad04dccd305cf280b72bd59f523afe28621f","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-24T14:57:26Z","title_canon_sha256":"e8fde035a8187ef819c6d8b95d604af575c0f8a3b6224b76e05b153013b1fcd8"},"schema_version":"1.0","source":{"id":"2411.15864","kind":"arxiv","version":1}},"canonical_sha256":"6e0c6ad7657eaa2a3390735b30b8c7bc6a28cab4429e181bb3eb26d9340fefc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e0c6ad7657eaa2a3390735b30b8c7bc6a28cab4429e181bb3eb26d9340fefc6","first_computed_at":"2026-07-05T09:39:41.981403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:41.981403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lj7As+DvsdDrDIyF1npRUAlkRSlMZAMtNMjRs85rui1XkrPHmD56J/jsY+iVLpRnwULaX/XM9EQO9TXxaz5nDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:41.981829Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.15864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:766de4f723f298d9514d10cd81e35ac3888ee3d88c36e625948b83ee10317497","sha256:3235cbf378e810f83f54f522847628ad4ea4422a613fe18a5cd2180fe43e4422"],"state_sha256":"9cbc6bf2bb41ad7092b08e068a1886fa0d579c49e1f7ccbece04f70334049dba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nThru5Sbvb/1AbcFAfqrFkuxs6Lr8XQBkshQYEQ7BEC2yk0lcFIkV1oA/MB4DK9JJMCjm2ztd9jVs77q1j3uAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T03:39:34.227277Z","bundle_sha256":"50a16200158f20a880298c258caf7cff2f01fc170c37a233183b8b3e2817dbc2"}}