{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GNX4RXENAVNJLOYWAPMBLI4COH","short_pith_number":"pith:GNX4RXEN","canonical_record":{"source":{"id":"1304.5591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T06:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"eeee972069ffddad25fc9098fb8998ae4c0109475aa5d2971e8d27b4c897ef8a","abstract_canon_sha256":"718f3abb43b7b37c402f985951646e9e48d34c988006fc0688e547add5e7831b"},"schema_version":"1.0"},"canonical_sha256":"336fc8dc8d055a95bb1603d815a38271ecfb5201991a2ef9ae9377e831c90423","source":{"kind":"arxiv","id":"1304.5591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5591","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5591v1","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5591","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"pith_short_12","alias_value":"GNX4RXENAVNJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GNX4RXENAVNJLOYW","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GNX4RXEN","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GNX4RXENAVNJLOYWAPMBLI4COH","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T06:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"eeee972069ffddad25fc9098fb8998ae4c0109475aa5d2971e8d27b4c897ef8a","abstract_canon_sha256":"718f3abb43b7b37c402f985951646e9e48d34c988006fc0688e547add5e7831b"},"schema_version":"1.0"},"canonical_sha256":"336fc8dc8d055a95bb1603d815a38271ecfb5201991a2ef9ae9377e831c90423","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:15.420791Z","signature_b64":"VcYP5i3BHGu/2AGpG5B+RYpvYmE00caBvsukddoMdqjIvsimfHJDmbNJr742YsCv0FGFI0OBvqkTkdXnX5KJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"336fc8dc8d055a95bb1603d815a38271ecfb5201991a2ef9ae9377e831c90423","last_reissued_at":"2026-05-17T23:58:15.420223Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:15.420223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5591","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-05-17T23:58:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVVbCjpYwA+0TaTwzEh14gPIrxz2rHTf/03x5H+0PNT5i1zI8AL/Wy7kL1LcYrauDcOWOiPQO5lEDu9z8TqBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:26:55.962795Z"},"content_sha256":"a0108bc7e880e0cacdf1e8363d9aaed255d57642f707afbc2a5a03e92eb41585","schema_version":"1.0","event_id":"sha256:a0108bc7e880e0cacdf1e8363d9aaed255d57642f707afbc2a5a03e92eb41585"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GNX4RXENAVNJLOYWAPMBLI4COH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of 1-Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Eppstein, Michael J. Bannister, Sergio Cabello","submitted_at":"2013-04-20T06:14:31Z","abstract_excerpt":"We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the parameterized complexity of the problem with respect to the vertex cover number, tree-depth, and cyclomatic number. For these parameters we construct fixed-parameter tractable algorithms. However, the problem remains NP-complete for graphs of bounded bandwidth, pathwidth, or treewidth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5591","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":""},"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-05-17T23:58:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qbSQ8er06ZduD6/RSCXPStGtKVpQLaGiv5ZHELS8HBwuwyLfnbpqs3GGJmUT0pgPxXV1hFZZxVnUX0IERcMZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:26:55.963141Z"},"content_sha256":"9c9d6105688e0aa3be94ab0badae8732be37f1b44b836c91d6d52f85db0c8365","schema_version":"1.0","event_id":"sha256:9c9d6105688e0aa3be94ab0badae8732be37f1b44b836c91d6d52f85db0c8365"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH/bundle.json","state_url":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNX4RXENAVNJLOYWAPMBLI4COH/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-06-01T13:26:55Z","links":{"resolver":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH","bundle":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH/bundle.json","state":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNX4RXENAVNJLOYWAPMBLI4COH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GNX4RXENAVNJLOYWAPMBLI4COH","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":"718f3abb43b7b37c402f985951646e9e48d34c988006fc0688e547add5e7831b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T06:14:31Z","title_canon_sha256":"eeee972069ffddad25fc9098fb8998ae4c0109475aa5d2971e8d27b4c897ef8a"},"schema_version":"1.0","source":{"id":"1304.5591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5591","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5591v1","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5591","created_at":"2026-05-17T23:58:15Z"},{"alias_kind":"pith_short_12","alias_value":"GNX4RXENAVNJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GNX4RXENAVNJLOYW","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GNX4RXEN","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:9c9d6105688e0aa3be94ab0badae8732be37f1b44b836c91d6d52f85db0c8365","target":"graph","created_at":"2026-05-17T23:58:15Z","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"},"paper":{"abstract_excerpt":"We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the parameterized complexity of the problem with respect to the vertex cover number, tree-depth, and cyclomatic number. For these parameters we construct fixed-parameter tractable algorithms. However, the problem remains NP-complete for graphs of bounded bandwidth, pathwidth, or treewidth.","authors_text":"David Eppstein, Michael J. Bannister, Sergio Cabello","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T06:14:31Z","title":"Parameterized Complexity of 1-Planarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5591","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:a0108bc7e880e0cacdf1e8363d9aaed255d57642f707afbc2a5a03e92eb41585","target":"record","created_at":"2026-05-17T23:58:15Z","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":"718f3abb43b7b37c402f985951646e9e48d34c988006fc0688e547add5e7831b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T06:14:31Z","title_canon_sha256":"eeee972069ffddad25fc9098fb8998ae4c0109475aa5d2971e8d27b4c897ef8a"},"schema_version":"1.0","source":{"id":"1304.5591","kind":"arxiv","version":1}},"canonical_sha256":"336fc8dc8d055a95bb1603d815a38271ecfb5201991a2ef9ae9377e831c90423","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"336fc8dc8d055a95bb1603d815a38271ecfb5201991a2ef9ae9377e831c90423","first_computed_at":"2026-05-17T23:58:15.420223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:15.420223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VcYP5i3BHGu/2AGpG5B+RYpvYmE00caBvsukddoMdqjIvsimfHJDmbNJr742YsCv0FGFI0OBvqkTkdXnX5KJCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:15.420791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0108bc7e880e0cacdf1e8363d9aaed255d57642f707afbc2a5a03e92eb41585","sha256:9c9d6105688e0aa3be94ab0badae8732be37f1b44b836c91d6d52f85db0c8365"],"state_sha256":"e3e39fca15c06437b81348562f47782e6c80f96b92dc2468f3acd12b57b2e922"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SftYSeMNsTuGYBwR9RRu8OeYuoJO0qCoeIaHYVBTbRJ0CYkDkxFZztr0C0y68V9Y6MfQnWj1SaOYyCYIZXvFCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:26:55.965107Z","bundle_sha256":"a0301d0c27ea836538d36395f779f7683da88c028ff815d8619e0ede7a5a9076"}}