{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MB55WNCNGS57FXDLJXFHGMUPQC","short_pith_number":"pith:MB55WNCN","canonical_record":{"source":{"id":"1903.01291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T14:55:58Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"bfa4a2c3a045241d78ef7cd93594878140f265e2e01b7fea07c443a6f72fd82c","abstract_canon_sha256":"89e006c1ae774448955a1107a6d3187baee12bef4241cd9f379046adf8e50138"},"schema_version":"1.0"},"canonical_sha256":"607bdb344d34bbf2dc6b4dca73328f80a84e8c9cee8f5ce5c57bbf1367f52115","source":{"kind":"arxiv","id":"1903.01291","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01291","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01291v1","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01291","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"MB55WNCNGS57","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MB55WNCNGS57FXDL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MB55WNCN","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MB55WNCNGS57FXDLJXFHGMUPQC","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01291","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T14:55:58Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"bfa4a2c3a045241d78ef7cd93594878140f265e2e01b7fea07c443a6f72fd82c","abstract_canon_sha256":"89e006c1ae774448955a1107a6d3187baee12bef4241cd9f379046adf8e50138"},"schema_version":"1.0"},"canonical_sha256":"607bdb344d34bbf2dc6b4dca73328f80a84e8c9cee8f5ce5c57bbf1367f52115","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:09.185493Z","signature_b64":"pz9M2k6OA4pV+VvCO/HEdDY9hh3b4Hl5YxRa8GmcT0NLTNuYyXOn6fqlVZIKfpZE7QWVN3nLS5RTnUNJrfPVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"607bdb344d34bbf2dc6b4dca73328f80a84e8c9cee8f5ce5c57bbf1367f52115","last_reissued_at":"2026-05-17T23:52:09.184828Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:09.184828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01291","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:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CTEATi7+aH2KffVsV+TX0PziDtIWaBg0ugIw+OEmN8aFdi6L4O4ys+XN9r+4OIQwfgbWS2+LaZoUm45Tg/wAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:30:39.882932Z"},"content_sha256":"088cd94a2d131d41f8be0f7c73ad622dcfc0f5a85676eafac9d4844d5751342b","schema_version":"1.0","event_id":"sha256:088cd94a2d131d41f8be0f7c73ad622dcfc0f5a85676eafac9d4844d5751342b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MB55WNCNGS57FXDLJXFHGMUPQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition of Map Graphs with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Meirav Zehavi, Saket Saurabh","submitted_at":"2019-03-04T14:55:58Z","abstract_excerpt":"Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and Thomas that states that every planar graph either has a $\\sqrt{k}\\times \\sqrt{k}$-grid as a minor, or its treewidth is $O(\\sqrt{k})$. However, bidimensionality theory cannot be extended directly to several well-known classes of geometric graphs. Nevertheless, a relaxation of this lemma has been proven useful for unit disk graphs. Inspired by this, we prove a new"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01291","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:52:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xP9XQPy1qz1qHVDh8z8CmseHHZpy2TPmVmWDPlMbSqR+qmUMQ3ZL591RYdKODZ3qjDCLOLtI4b5ki8TqbnZIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:30:39.883710Z"},"content_sha256":"90e197be3928da4b1121203c39295deec58da913f3acd0eab8a4a7cc46710642","schema_version":"1.0","event_id":"sha256:90e197be3928da4b1121203c39295deec58da913f3acd0eab8a4a7cc46710642"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MB55WNCNGS57FXDLJXFHGMUPQC/bundle.json","state_url":"https://pith.science/pith/MB55WNCNGS57FXDLJXFHGMUPQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MB55WNCNGS57FXDLJXFHGMUPQC/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-05-30T16:30:39Z","links":{"resolver":"https://pith.science/pith/MB55WNCNGS57FXDLJXFHGMUPQC","bundle":"https://pith.science/pith/MB55WNCNGS57FXDLJXFHGMUPQC/bundle.json","state":"https://pith.science/pith/MB55WNCNGS57FXDLJXFHGMUPQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MB55WNCNGS57FXDLJXFHGMUPQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MB55WNCNGS57FXDLJXFHGMUPQC","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":"89e006c1ae774448955a1107a6d3187baee12bef4241cd9f379046adf8e50138","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T14:55:58Z","title_canon_sha256":"bfa4a2c3a045241d78ef7cd93594878140f265e2e01b7fea07c443a6f72fd82c"},"schema_version":"1.0","source":{"id":"1903.01291","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01291","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01291v1","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01291","created_at":"2026-05-17T23:52:09Z"},{"alias_kind":"pith_short_12","alias_value":"MB55WNCNGS57","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"MB55WNCNGS57FXDL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"MB55WNCN","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:90e197be3928da4b1121203c39295deec58da913f3acd0eab8a4a7cc46710642","target":"graph","created_at":"2026-05-17T23:52:09Z","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":"Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and Thomas that states that every planar graph either has a $\\sqrt{k}\\times \\sqrt{k}$-grid as a minor, or its treewidth is $O(\\sqrt{k})$. However, bidimensionality theory cannot be extended directly to several well-known classes of geometric graphs. Nevertheless, a relaxation of this lemma has been proven useful for unit disk graphs. Inspired by this, we prove a new","authors_text":"Daniel Lokshtanov, Fahad Panolan, Fedor V. Fomin, Meirav Zehavi, Saket Saurabh","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T14:55:58Z","title":"Decomposition of Map Graphs with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01291","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:088cd94a2d131d41f8be0f7c73ad622dcfc0f5a85676eafac9d4844d5751342b","target":"record","created_at":"2026-05-17T23:52:09Z","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":"89e006c1ae774448955a1107a6d3187baee12bef4241cd9f379046adf8e50138","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T14:55:58Z","title_canon_sha256":"bfa4a2c3a045241d78ef7cd93594878140f265e2e01b7fea07c443a6f72fd82c"},"schema_version":"1.0","source":{"id":"1903.01291","kind":"arxiv","version":1}},"canonical_sha256":"607bdb344d34bbf2dc6b4dca73328f80a84e8c9cee8f5ce5c57bbf1367f52115","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"607bdb344d34bbf2dc6b4dca73328f80a84e8c9cee8f5ce5c57bbf1367f52115","first_computed_at":"2026-05-17T23:52:09.184828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:09.184828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pz9M2k6OA4pV+VvCO/HEdDY9hh3b4Hl5YxRa8GmcT0NLTNuYyXOn6fqlVZIKfpZE7QWVN3nLS5RTnUNJrfPVDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:09.185493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01291","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:088cd94a2d131d41f8be0f7c73ad622dcfc0f5a85676eafac9d4844d5751342b","sha256:90e197be3928da4b1121203c39295deec58da913f3acd0eab8a4a7cc46710642"],"state_sha256":"5f8629eaa4cd3607b8d005e3f44a9a79482e727bf06381cfa9e4ddfa3917ae51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+0M4M7xCHvSBFGsrMO1A5xcw4seksy9gvK4bfISIvmnpnblsFqoIkkY21DnQlfVUPZSzotnLXRHS5md2AeJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:30:39.887132Z","bundle_sha256":"5461873a81656b74bc1a486baa3db754f52588bdea14c557126cda089d58304b"}}