{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HI6BM6ES5POPHV2QZUB42XTNDK","short_pith_number":"pith:HI6BM6ES","schema_version":"1.0","canonical_sha256":"3a3c167892ebdcf3d750cd03cd5e6d1a9a59c171094e2c37b258785d7caaf4a7","source":{"kind":"arxiv","id":"1512.02379","version":2},"attestation_state":"computed","paper":{"title":"Crossing Number is Hard for Kernelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Marek Der\\v{n}\\'ar, Petr Hlin\\v{e}n\\'y","submitted_at":"2015-12-08T09:33:47Z","abstract_excerpt":"The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult, it is fixed- parameter tractable for the parameter k [Grohe]. This suggests a closely related question of whether this problem has a polynomial kernel, meaning whether every instance of cr(G)<=k can be in polynomial time reduced to an equivalent instance of size polynomial in k (and independent of |G|). We answer this question in the negative. Along the proof we show that the tile crossing number problem of twisted p"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1512.02379","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-08T09:33:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"c6435180a0c3ebaf9238345370ec3f0c7c2d75bf9df13f784d4dffb5efa5bc52","abstract_canon_sha256":"85a51eb1abd4a6fadc182be6e0400d9d44b9ca43ed5921acf5ea62377a91b865"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:24.056240Z","signature_b64":"BZqLqhy55JJ1NoEgCif8uqHbQJvcdKHb10M9N93bq2F0b2+F7q9nJmz/S7W5pzk+nDP/ECIp2JJoKGkwIm+WBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a3c167892ebdcf3d750cd03cd5e6d1a9a59c171094e2c37b258785d7caaf4a7","last_reissued_at":"2026-05-18T01:20:24.055448Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:24.055448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crossing Number is Hard for Kernelization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Marek Der\\v{n}\\'ar, Petr Hlin\\v{e}n\\'y","submitted_at":"2015-12-08T09:33:47Z","abstract_excerpt":"The graph crossing number problem, cr(G)<=k, asks for a drawing of a graph G in the plane with at most k edge crossings. Although this problem is in general notoriously difficult, it is fixed- parameter tractable for the parameter k [Grohe]. This suggests a closely related question of whether this problem has a polynomial kernel, meaning whether every instance of cr(G)<=k can be in polynomial time reduced to an equivalent instance of size polynomial in k (and independent of |G|). We answer this question in the negative. Along the proof we show that the tile crossing number problem of twisted p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02379","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1512.02379","created_at":"2026-05-18T01:20:24.055563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02379v2","created_at":"2026-05-18T01:20:24.055563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02379","created_at":"2026-05-18T01:20:24.055563+00:00"},{"alias_kind":"pith_short_12","alias_value":"HI6BM6ES5POP","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HI6BM6ES5POPHV2Q","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HI6BM6ES","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK","json":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK.json","graph_json":"https://pith.science/api/pith-number/HI6BM6ES5POPHV2QZUB42XTNDK/graph.json","events_json":"https://pith.science/api/pith-number/HI6BM6ES5POPHV2QZUB42XTNDK/events.json","paper":"https://pith.science/paper/HI6BM6ES"},"agent_actions":{"view_html":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK","download_json":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK.json","view_paper":"https://pith.science/paper/HI6BM6ES","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02379&json=true","fetch_graph":"https://pith.science/api/pith-number/HI6BM6ES5POPHV2QZUB42XTNDK/graph.json","fetch_events":"https://pith.science/api/pith-number/HI6BM6ES5POPHV2QZUB42XTNDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK/action/storage_attestation","attest_author":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK/action/author_attestation","sign_citation":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK/action/citation_signature","submit_replication":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK/action/replication_record"}},"created_at":"2026-05-18T01:20:24.055563+00:00","updated_at":"2026-05-18T01:20:24.055563+00:00"}