{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KI2HD5CTQ5EERNK7CGTEHGEUY7","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":"5ab384c8aa7878f88c39cb7f467b80d79ece21aa918fb4e286c0a8867115699a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-14T01:41:15Z","title_canon_sha256":"e510be1798d0a727d20134408a9510294c0fb751697a5518403ebcbcd9051410"},"schema_version":"1.0","source":{"id":"1510.03945","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03945","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03945v2","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03945","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"KI2HD5CTQ5EE","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KI2HD5CTQ5EERNK7","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KI2HD5CT","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:425a4989f2f6386d253bd65fd0b182b964d97a7818a02ff8c849496650242cb6","target":"graph","created_at":"2026-05-18T00:52:29Z","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":"Given two graphs $G$ and $H$, we define $\\textsf{v-cover}_{H}(G)$ (resp. $\\textsf{e-cover}_{H}(G)$) as the minimum number of vertices (resp. edges) whose removal from $G$ produces a graph without any minor isomorphic to ${H}$. Also $\\textsf{v-pack}_{H}(G)$ (resp. $\\textsf{v-pack}_{H}(G)$) is the maximum number of vertex- (resp. edge-) disjoint subgraphs of $G$ that contain a minor isomaorphic to $H$. We denote by $\\theta_r$ the graph with two vertices and $r$ parallel edges between them. When $H=\\theta_r$, the parameters $\\textsf{v-cover}_{H}$, $\\textsf{e-cover}_{H}$, $\\textsf{v-pack}_{H}$, an","authors_text":"Dimitrios M. Thilikos, Dimitris Chatzidimitriou, Ignasi Sau, Jean-Florent Raymond","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-14T01:41:15Z","title":"An $O(\\log OPT)$-approximation for covering and packing minor models of ${\\theta}_r$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03945","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:1a948cd8c34495e3a10530d6e85f4622666c77e76108f8b60922732a332a7371","target":"record","created_at":"2026-05-18T00:52:29Z","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":"5ab384c8aa7878f88c39cb7f467b80d79ece21aa918fb4e286c0a8867115699a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-14T01:41:15Z","title_canon_sha256":"e510be1798d0a727d20134408a9510294c0fb751697a5518403ebcbcd9051410"},"schema_version":"1.0","source":{"id":"1510.03945","kind":"arxiv","version":2}},"canonical_sha256":"523471f453874848b55f11a6439894c7d6d6769f0f0b0a5a271a3be31d1b1997","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"523471f453874848b55f11a6439894c7d6d6769f0f0b0a5a271a3be31d1b1997","first_computed_at":"2026-05-18T00:52:29.452198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:29.452198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KL3l5dYYKNPKYipQtqtwL86Rdj/xl8sT27EoR8YRMUhLlzz4dfobNnJWeVGaj/A0YsC6GxAgnrNEjaEC2SAhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:29.452690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03945","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a948cd8c34495e3a10530d6e85f4622666c77e76108f8b60922732a332a7371","sha256:425a4989f2f6386d253bd65fd0b182b964d97a7818a02ff8c849496650242cb6"],"state_sha256":"a66a65a3d716b8a75aad85e540d9abe69724d27d39bb574ba3caf6cb1b08a54b"}