{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HI6BM6ES5POPHV2QZUB42XTNDK","short_pith_number":"pith:HI6BM6ES","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"},"canonical_sha256":"3a3c167892ebdcf3d750cd03cd5e6d1a9a59c171094e2c37b258785d7caaf4a7","source":{"kind":"arxiv","id":"1512.02379","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02379","created_at":"2026-05-18T01:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02379v2","created_at":"2026-05-18T01:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02379","created_at":"2026-05-18T01:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"HI6BM6ES5POP","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HI6BM6ES5POPHV2Q","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HI6BM6ES","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HI6BM6ES5POPHV2QZUB42XTNDK","target":"record","payload":{"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"},"canonical_sha256":"3a3c167892ebdcf3d750cd03cd5e6d1a9a59c171094e2c37b258785d7caaf4a7","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"},"source_kind":"arxiv","source_id":"1512.02379","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-18T01:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vAaEFcIGZbgLYaI+mN50gocERVI12hqgLXwTwlrn6XbPaaMtQxc30E9QOBdo8hGkSX0PlLkVgcT+U8/KnX6IBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:54:22.085900Z"},"content_sha256":"073b3c132190dafef1d325a4df856231c6fbd66ca92ab5677e094e916024d3ca","schema_version":"1.0","event_id":"sha256:073b3c132190dafef1d325a4df856231c6fbd66ca92ab5677e094e916024d3ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HI6BM6ES5POPHV2QZUB42XTNDK","target":"graph","payload":{"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"},"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-18T01:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MjyUKT7BM/oyJYBMx/fquYyYh/I2HmQkzgviK1QY6YDTHKl13lesgAU2VUw+gkVUoIqDxO90FPOW4Y2Tk6PqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:54:22.086578Z"},"content_sha256":"516ba775ae89710641c9445b5092771be03125f7eb3023f7204a631b38a1f0f0","schema_version":"1.0","event_id":"sha256:516ba775ae89710641c9445b5092771be03125f7eb3023f7204a631b38a1f0f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK/bundle.json","state_url":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HI6BM6ES5POPHV2QZUB42XTNDK/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-05T21:54:22Z","links":{"resolver":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK","bundle":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK/bundle.json","state":"https://pith.science/pith/HI6BM6ES5POPHV2QZUB42XTNDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HI6BM6ES5POPHV2QZUB42XTNDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HI6BM6ES5POPHV2QZUB42XTNDK","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":"85a51eb1abd4a6fadc182be6e0400d9d44b9ca43ed5921acf5ea62377a91b865","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-08T09:33:47Z","title_canon_sha256":"c6435180a0c3ebaf9238345370ec3f0c7c2d75bf9df13f784d4dffb5efa5bc52"},"schema_version":"1.0","source":{"id":"1512.02379","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02379","created_at":"2026-05-18T01:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02379v2","created_at":"2026-05-18T01:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02379","created_at":"2026-05-18T01:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"HI6BM6ES5POP","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HI6BM6ES5POPHV2Q","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HI6BM6ES","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:516ba775ae89710641c9445b5092771be03125f7eb3023f7204a631b38a1f0f0","target":"graph","created_at":"2026-05-18T01:20:24Z","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 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","authors_text":"Marek Der\\v{n}\\'ar, Petr Hlin\\v{e}n\\'y","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-08T09:33:47Z","title":"Crossing Number is Hard for Kernelization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02379","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:073b3c132190dafef1d325a4df856231c6fbd66ca92ab5677e094e916024d3ca","target":"record","created_at":"2026-05-18T01:20:24Z","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":"85a51eb1abd4a6fadc182be6e0400d9d44b9ca43ed5921acf5ea62377a91b865","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-12-08T09:33:47Z","title_canon_sha256":"c6435180a0c3ebaf9238345370ec3f0c7c2d75bf9df13f784d4dffb5efa5bc52"},"schema_version":"1.0","source":{"id":"1512.02379","kind":"arxiv","version":2}},"canonical_sha256":"3a3c167892ebdcf3d750cd03cd5e6d1a9a59c171094e2c37b258785d7caaf4a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a3c167892ebdcf3d750cd03cd5e6d1a9a59c171094e2c37b258785d7caaf4a7","first_computed_at":"2026-05-18T01:20:24.055448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:24.055448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BZqLqhy55JJ1NoEgCif8uqHbQJvcdKHb10M9N93bq2F0b2+F7q9nJmz/S7W5pzk+nDP/ECIp2JJoKGkwIm+WBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:24.056240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02379","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:073b3c132190dafef1d325a4df856231c6fbd66ca92ab5677e094e916024d3ca","sha256:516ba775ae89710641c9445b5092771be03125f7eb3023f7204a631b38a1f0f0"],"state_sha256":"fa9d1dd5c833667ed352f2dff81bb4c13e3594a54a517ff2c8bcc89ef78496eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vAgODEI3VEWWD4SbOZ5kFP+x6VRVbIyDOSM58vRTP8bYCn7GJaMpg3tYEC3qvwvY5gqTYCl0/MIPriz0VCfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:54:22.090592Z","bundle_sha256":"62e29ec211a0fc5c2246f39961639aad3652bf39901c6d1e9dfcaf477bb6b2ac"}}