{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6AK3VKVSIOQZTRVU63ZZJT5QEW","short_pith_number":"pith:6AK3VKVS","canonical_record":{"source":{"id":"1612.03854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-12T19:12:47Z","cross_cats_sorted":[],"title_canon_sha256":"0dbd3ee966f8e60a3875d7adff75739b39138c986fb102404db2f449b816e57d","abstract_canon_sha256":"9f56a9db343774fdfcf866bfb699a01e35aa591ef33d1f6f99b4381ce490d2a0"},"schema_version":"1.0"},"canonical_sha256":"f015baaab243a199c6b4f6f394cfb0258cf1c78d0723e923173f04619d0a0e84","source":{"kind":"arxiv","id":"1612.03854","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03854","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03854v2","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03854","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"6AK3VKVSIOQZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6AK3VKVSIOQZTRVU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6AK3VKVS","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6AK3VKVSIOQZTRVU63ZZJT5QEW","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-12T19:12:47Z","cross_cats_sorted":[],"title_canon_sha256":"0dbd3ee966f8e60a3875d7adff75739b39138c986fb102404db2f449b816e57d","abstract_canon_sha256":"9f56a9db343774fdfcf866bfb699a01e35aa591ef33d1f6f99b4381ce490d2a0"},"schema_version":"1.0"},"canonical_sha256":"f015baaab243a199c6b4f6f394cfb0258cf1c78d0723e923173f04619d0a0e84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:02.289511Z","signature_b64":"pzZG+THoqRVnRsHF9KZG7y48jvY0BNxlrsYu/+IJ5+WDpRqOvNvt1n98IVU5U7Vr26I8nYIGqeo/cI1XkSB/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f015baaab243a199c6b4f6f394cfb0258cf1c78d0723e923173f04619d0a0e84","last_reissued_at":"2026-05-18T00:33:02.289058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:02.289058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03854","source_version":2,"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-18T00:33:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PMQmwM53HUEA2psSmXJ/qRE5MMJUb3LzZjCaS1HMzE2JRGrpDjb8e5lY83s3UNl+jTKqo/GZipsUEGnPtMecCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:24:32.752898Z"},"content_sha256":"cb09763b3a747784d583a899ec931e69076096d4818530ee69ad4800e28ebea7","schema_version":"1.0","event_id":"sha256:cb09763b3a747784d583a899ec931e69076096d4818530ee69ad4800e28ebea7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6AK3VKVSIOQZTRVU63ZZJT5QEW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Crossing Number for Graphs With Bounded Pathwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Markus Chimani, Martin Derka, Petra Mutzel, Therese Biedl","submitted_at":"2016-12-12T19:12:47Z","abstract_excerpt":"The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant approximation ratios. Furthermore, up to now, general crossing number computations have never been successfully tackled using bounded width of graph decompositions, like treewidth or pathwidth.\n  In this paper, we for the first time show that crossing number is tractable (even in linear time) for maximal graphs of bounded pathwidth~3. The technique also shows that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03854","kind":"arxiv","version":2},"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-18T00:33:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8fWR5o1WVrAuX3zURzJxEoKLSmdPbzUmgvMU8z2r2lb3hhKgMbWz2GCQyeoR9juxg4Kl1iDjkwZNK9IC/5jDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T23:24:32.753239Z"},"content_sha256":"a2a6554494f3329d19d9504e72bafb4709178391a97fd570576952e5ededd669","schema_version":"1.0","event_id":"sha256:a2a6554494f3329d19d9504e72bafb4709178391a97fd570576952e5ededd669"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6AK3VKVSIOQZTRVU63ZZJT5QEW/bundle.json","state_url":"https://pith.science/pith/6AK3VKVSIOQZTRVU63ZZJT5QEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6AK3VKVSIOQZTRVU63ZZJT5QEW/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-24T23:24:32Z","links":{"resolver":"https://pith.science/pith/6AK3VKVSIOQZTRVU63ZZJT5QEW","bundle":"https://pith.science/pith/6AK3VKVSIOQZTRVU63ZZJT5QEW/bundle.json","state":"https://pith.science/pith/6AK3VKVSIOQZTRVU63ZZJT5QEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6AK3VKVSIOQZTRVU63ZZJT5QEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6AK3VKVSIOQZTRVU63ZZJT5QEW","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":"9f56a9db343774fdfcf866bfb699a01e35aa591ef33d1f6f99b4381ce490d2a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-12T19:12:47Z","title_canon_sha256":"0dbd3ee966f8e60a3875d7adff75739b39138c986fb102404db2f449b816e57d"},"schema_version":"1.0","source":{"id":"1612.03854","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03854","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03854v2","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03854","created_at":"2026-05-18T00:33:02Z"},{"alias_kind":"pith_short_12","alias_value":"6AK3VKVSIOQZ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6AK3VKVSIOQZTRVU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6AK3VKVS","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:a2a6554494f3329d19d9504e72bafb4709178391a97fd570576952e5ededd669","target":"graph","created_at":"2026-05-18T00:33:02Z","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":"The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant approximation ratios. Furthermore, up to now, general crossing number computations have never been successfully tackled using bounded width of graph decompositions, like treewidth or pathwidth.\n  In this paper, we for the first time show that crossing number is tractable (even in linear time) for maximal graphs of bounded pathwidth~3. The technique also shows that ","authors_text":"Markus Chimani, Martin Derka, Petra Mutzel, Therese Biedl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-12T19:12:47Z","title":"Crossing Number for Graphs With Bounded Pathwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03854","kind":"arxiv","version":2},"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:cb09763b3a747784d583a899ec931e69076096d4818530ee69ad4800e28ebea7","target":"record","created_at":"2026-05-18T00:33:02Z","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":"9f56a9db343774fdfcf866bfb699a01e35aa591ef33d1f6f99b4381ce490d2a0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-12T19:12:47Z","title_canon_sha256":"0dbd3ee966f8e60a3875d7adff75739b39138c986fb102404db2f449b816e57d"},"schema_version":"1.0","source":{"id":"1612.03854","kind":"arxiv","version":2}},"canonical_sha256":"f015baaab243a199c6b4f6f394cfb0258cf1c78d0723e923173f04619d0a0e84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f015baaab243a199c6b4f6f394cfb0258cf1c78d0723e923173f04619d0a0e84","first_computed_at":"2026-05-18T00:33:02.289058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:02.289058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pzZG+THoqRVnRsHF9KZG7y48jvY0BNxlrsYu/+IJ5+WDpRqOvNvt1n98IVU5U7Vr26I8nYIGqeo/cI1XkSB/DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:02.289511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03854","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb09763b3a747784d583a899ec931e69076096d4818530ee69ad4800e28ebea7","sha256:a2a6554494f3329d19d9504e72bafb4709178391a97fd570576952e5ededd669"],"state_sha256":"a903fb21aac494c2f60bcb919d5dea310dfa469e2caf7108f7ca19a9b5c2573d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1oh2e54yzg5blZxoHzpSG3iT6N0hOlovckSF2RBZ83w8ye7K0Kj5qTH42iWnuWIg/zzJgd+Z8BwsjrcoEXJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T23:24:32.755185Z","bundle_sha256":"d2d6da9d5ee3cd2738da6ee23ae1983b3cb4d27b9c0c7444dc93f8c4c6bb92d3"}}