{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CJH6PG7VCINCXKIAA6KK6L23MV","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":"88140f23b15bc924987b65afac8004bcb740d0cfa37779981436b34eb455ba1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T20:00:44Z","title_canon_sha256":"6fa2a03c991dde4e18893c6243527e700628c4a8fc325c3498ba4e6d492ff508"},"schema_version":"1.0","source":{"id":"1807.07626","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07626","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07626v1","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07626","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"CJH6PG7VCINC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CJH6PG7VCINCXKIA","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CJH6PG7V","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:3d337e2c6d7f33fbfaea569a3a54f726da59b04deda1d1568d99eeb09e5b10a6","target":"graph","created_at":"2026-05-18T00:10:16Z","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 consider two optimization problems in planar graphs. In Maximum Weight Independent Set of Objects we are given a graph $G$ and a family $\\mathcal{D}$ of objects, each being a connected subgraph of $G$ with a prescribed weight, and the task is to find a maximum-weight subfamily of $\\mathcal{D}$ consisting of pairwise disjoint objects. In Minimum Weight Distance Set Cover we are given an edge-weighted graph $G$, two sets $\\mathcal{D},\\mathcal{C}$ of vertices of $G$, where vertices of $\\mathcal{D}$ have prescribed weights, and a nonnegative radius $r$. The task is to find a minimum-weight subs","authors_text":"Andreas Wiese, Erik Jan van Leeuwen, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T20:00:44Z","title":"Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07626","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:199f920132aa4c46db001086056b028d7e8c217208f78c808caadc9f7d9caf2d","target":"record","created_at":"2026-05-18T00:10:16Z","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":"88140f23b15bc924987b65afac8004bcb740d0cfa37779981436b34eb455ba1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T20:00:44Z","title_canon_sha256":"6fa2a03c991dde4e18893c6243527e700628c4a8fc325c3498ba4e6d492ff508"},"schema_version":"1.0","source":{"id":"1807.07626","kind":"arxiv","version":1}},"canonical_sha256":"124fe79bf5121a2ba9000794af2f5b654a98fcedff8be52c3a827f8c02d183e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"124fe79bf5121a2ba9000794af2f5b654a98fcedff8be52c3a827f8c02d183e0","first_computed_at":"2026-05-18T00:10:16.067944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:16.067944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3sEo6BYr0U4ZB7npdlpWgujWvugAUIKvbo+zMZxd9ab1l5ZJNETQZDOOZtyhrl20bVJ23KwrwQqp7pBb/B0MAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:16.068547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07626","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:199f920132aa4c46db001086056b028d7e8c217208f78c808caadc9f7d9caf2d","sha256:3d337e2c6d7f33fbfaea569a3a54f726da59b04deda1d1568d99eeb09e5b10a6"],"state_sha256":"aebc28f43777d64c654d97de470936a3b56c7761547327d1372a82ba17b8064d"}