{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CJH6PG7VCINCXKIAA6KK6L23MV","short_pith_number":"pith:CJH6PG7V","schema_version":"1.0","canonical_sha256":"124fe79bf5121a2ba9000794af2f5b654a98fcedff8be52c3a827f8c02d183e0","source":{"kind":"arxiv","id":"1807.07626","version":1},"attestation_state":"computed","paper":{"title":"Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Erik Jan van Leeuwen, Micha{\\l} Pilipczuk","submitted_at":"2018-07-19T20:00:44Z","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"},"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":"1807.07626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-19T20:00:44Z","cross_cats_sorted":[],"title_canon_sha256":"6fa2a03c991dde4e18893c6243527e700628c4a8fc325c3498ba4e6d492ff508","abstract_canon_sha256":"88140f23b15bc924987b65afac8004bcb740d0cfa37779981436b34eb455ba1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.068547Z","signature_b64":"3sEo6BYr0U4ZB7npdlpWgujWvugAUIKvbo+zMZxd9ab1l5ZJNETQZDOOZtyhrl20bVJ23KwrwQqp7pBb/B0MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"124fe79bf5121a2ba9000794af2f5b654a98fcedff8be52c3a827f8c02d183e0","last_reissued_at":"2026-05-18T00:10:16.067944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.067944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Wiese, Erik Jan van Leeuwen, Micha{\\l} Pilipczuk","submitted_at":"2018-07-19T20:00:44Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07626","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.07626","created_at":"2026-05-18T00:10:16.068018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07626v1","created_at":"2026-05-18T00:10:16.068018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07626","created_at":"2026-05-18T00:10:16.068018+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJH6PG7VCINC","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJH6PG7VCINCXKIA","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJH6PG7V","created_at":"2026-05-18T12:32:16.446611+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/CJH6PG7VCINCXKIAA6KK6L23MV","json":"https://pith.science/pith/CJH6PG7VCINCXKIAA6KK6L23MV.json","graph_json":"https://pith.science/api/pith-number/CJH6PG7VCINCXKIAA6KK6L23MV/graph.json","events_json":"https://pith.science/api/pith-number/CJH6PG7VCINCXKIAA6KK6L23MV/events.json","paper":"https://pith.science/paper/CJH6PG7V"},"agent_actions":{"view_html":"https://pith.science/pith/CJH6PG7VCINCXKIAA6KK6L23MV","download_json":"https://pith.science/pith/CJH6PG7VCINCXKIAA6KK6L23MV.json","view_paper":"https://pith.science/paper/CJH6PG7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07626&json=true","fetch_graph":"https://pith.science/api/pith-number/CJH6PG7VCINCXKIAA6KK6L23MV/graph.json","fetch_events":"https://pith.science/api/pith-number/CJH6PG7VCINCXKIAA6KK6L23MV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJH6PG7VCINCXKIAA6KK6L23MV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJH6PG7VCINCXKIAA6KK6L23MV/action/storage_attestation","attest_author":"https://pith.science/pith/CJH6PG7VCINCXKIAA6KK6L23MV/action/author_attestation","sign_citation":"https://pith.science/pith/CJH6PG7VCINCXKIAA6KK6L23MV/action/citation_signature","submit_replication":"https://pith.science/pith/CJH6PG7VCINCXKIAA6KK6L23MV/action/replication_record"}},"created_at":"2026-05-18T00:10:16.068018+00:00","updated_at":"2026-05-18T00:10:16.068018+00:00"}