{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JZME2AWHSANCRQ2WVRB2LEVYAH","short_pith_number":"pith:JZME2AWH","canonical_record":{"source":{"id":"1604.05999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:19:33Z","cross_cats_sorted":[],"title_canon_sha256":"3ad6dc5609c54d84e4fafdcaecea66354576f843a68ccae1b4fc271060196156","abstract_canon_sha256":"b16c3d4375c061d5d1f3e3861aef2e8f97529b1a4b8e0d5fc5afba6a57140c19"},"schema_version":"1.0"},"canonical_sha256":"4e584d02c7901a28c356ac43a592b801e3b99d036128342087b9b31c0e4844ae","source":{"kind":"arxiv","id":"1604.05999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05999","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05999v1","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05999","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"JZME2AWHSANC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JZME2AWHSANCRQ2W","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JZME2AWH","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JZME2AWHSANCRQ2WVRB2LEVYAH","target":"record","payload":{"canonical_record":{"source":{"id":"1604.05999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:19:33Z","cross_cats_sorted":[],"title_canon_sha256":"3ad6dc5609c54d84e4fafdcaecea66354576f843a68ccae1b4fc271060196156","abstract_canon_sha256":"b16c3d4375c061d5d1f3e3861aef2e8f97529b1a4b8e0d5fc5afba6a57140c19"},"schema_version":"1.0"},"canonical_sha256":"4e584d02c7901a28c356ac43a592b801e3b99d036128342087b9b31c0e4844ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:33.974227Z","signature_b64":"KB89hcXujQsvOQclAyJtCwPih206ooISYls6F5A+ezR+z/Gb+fFM74ZraI6Z/gNV+Ybhb1NQwo8Js2AgsjqOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e584d02c7901a28c356ac43a592b801e3b99d036128342087b9b31c0e4844ae","last_reissued_at":"2026-05-18T01:16:33.973561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:33.973561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.05999","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-18T01:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qa+DJ+BoqGDFzEuWp9UjF2SW4r99Gl0cGg2C0u50iCJMTIMG/wt0SB4qe/IuPkBCKeoXN/zTpkfJ839tg6H/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:15:13.646919Z"},"content_sha256":"b2f8b5e015a51eb2984ade3f2dbde38efab5c596d05b7d612dd0a29f552ef2ae","schema_version":"1.0","event_id":"sha256:b2f8b5e015a51eb2984ade3f2dbde38efab5c596d05b7d612dd0a29f552ef2ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JZME2AWHSANCRQ2WVRB2LEVYAH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, D\\'aniel Marx, Fedor V. Fomin, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Saket Saurabh","submitted_at":"2016-04-20T15:19:33Z","abstract_excerpt":"We prove the following theorem. Given a planar graph $G$ and an integer $k$, it is possible in polynomial time to randomly sample a subset $A$ of vertices of $G$ with the following properties: (i) $A$ induces a subgraph of $G$ of treewidth $\\mathcal{O}(\\sqrt{k}\\log k)$, and (ii) for every connected subgraph $H$ of $G$ on at most $k$ vertices, the probability that $A$ covers the whole vertex set of $H$ is at least $(2^{\\mathcal{O}(\\sqrt{k}\\log^2 k)}\\cdot n^{\\mathcal{O}(1)})^{-1}$, where $n$ is the number of vertices of $G$.\n  Together with standard dynamic programming techniques for graphs of b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05999","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-18T01:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3GxDdiHRZJHADe39jwrMsQQzj9fxmx/CPxWkweAoikLi0NHkvLzBAApv5LtGXHF2NuCkvEjjVeCZoS/ILXlvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:15:13.647292Z"},"content_sha256":"edbd0e5390e2f427e50240b1124623f6dea8cd3367cf0ff323ed3ff31a35348a","schema_version":"1.0","event_id":"sha256:edbd0e5390e2f427e50240b1124623f6dea8cd3367cf0ff323ed3ff31a35348a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZME2AWHSANCRQ2WVRB2LEVYAH/bundle.json","state_url":"https://pith.science/pith/JZME2AWHSANCRQ2WVRB2LEVYAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZME2AWHSANCRQ2WVRB2LEVYAH/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-01T00:15:13Z","links":{"resolver":"https://pith.science/pith/JZME2AWHSANCRQ2WVRB2LEVYAH","bundle":"https://pith.science/pith/JZME2AWHSANCRQ2WVRB2LEVYAH/bundle.json","state":"https://pith.science/pith/JZME2AWHSANCRQ2WVRB2LEVYAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZME2AWHSANCRQ2WVRB2LEVYAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JZME2AWHSANCRQ2WVRB2LEVYAH","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":"b16c3d4375c061d5d1f3e3861aef2e8f97529b1a4b8e0d5fc5afba6a57140c19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:19:33Z","title_canon_sha256":"3ad6dc5609c54d84e4fafdcaecea66354576f843a68ccae1b4fc271060196156"},"schema_version":"1.0","source":{"id":"1604.05999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.05999","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"1604.05999v1","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05999","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"JZME2AWHSANC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JZME2AWHSANCRQ2W","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JZME2AWH","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:edbd0e5390e2f427e50240b1124623f6dea8cd3367cf0ff323ed3ff31a35348a","target":"graph","created_at":"2026-05-18T01:16:33Z","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 prove the following theorem. Given a planar graph $G$ and an integer $k$, it is possible in polynomial time to randomly sample a subset $A$ of vertices of $G$ with the following properties: (i) $A$ induces a subgraph of $G$ of treewidth $\\mathcal{O}(\\sqrt{k}\\log k)$, and (ii) for every connected subgraph $H$ of $G$ on at most $k$ vertices, the probability that $A$ covers the whole vertex set of $H$ is at least $(2^{\\mathcal{O}(\\sqrt{k}\\log^2 k)}\\cdot n^{\\mathcal{O}(1)})^{-1}$, where $n$ is the number of vertices of $G$.\n  Together with standard dynamic programming techniques for graphs of b","authors_text":"Daniel Lokshtanov, D\\'aniel Marx, Fedor V. Fomin, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:19:33Z","title":"Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05999","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:b2f8b5e015a51eb2984ade3f2dbde38efab5c596d05b7d612dd0a29f552ef2ae","target":"record","created_at":"2026-05-18T01:16:33Z","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":"b16c3d4375c061d5d1f3e3861aef2e8f97529b1a4b8e0d5fc5afba6a57140c19","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-20T15:19:33Z","title_canon_sha256":"3ad6dc5609c54d84e4fafdcaecea66354576f843a68ccae1b4fc271060196156"},"schema_version":"1.0","source":{"id":"1604.05999","kind":"arxiv","version":1}},"canonical_sha256":"4e584d02c7901a28c356ac43a592b801e3b99d036128342087b9b31c0e4844ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e584d02c7901a28c356ac43a592b801e3b99d036128342087b9b31c0e4844ae","first_computed_at":"2026-05-18T01:16:33.973561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:33.973561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KB89hcXujQsvOQclAyJtCwPih206ooISYls6F5A+ezR+z/Gb+fFM74ZraI6Z/gNV+Ybhb1NQwo8Js2AgsjqOBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:33.974227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.05999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2f8b5e015a51eb2984ade3f2dbde38efab5c596d05b7d612dd0a29f552ef2ae","sha256:edbd0e5390e2f427e50240b1124623f6dea8cd3367cf0ff323ed3ff31a35348a"],"state_sha256":"995827bb21fb520bfbb075e87705ac705395b8852a2eb21feca15af0fc70122d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJ3shmvowpp+qqVynrO8c7rSk+rUNOpGKABC902nqaTcW3XdLFgAQ1tr2RV7mtvFyVmaGVMt2nSWl+rwE0QXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:15:13.649238Z","bundle_sha256":"45a9871e48c43dccf840ba54a9a06d95ff7d90e4ca401fb2c4fb9ca48841d2ab"}}