{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PCIEPQ7U3SW6CKWDNC7V7TZN5A","short_pith_number":"pith:PCIEPQ7U","schema_version":"1.0","canonical_sha256":"789047c3f4dcade12ac368bf5fcf2de834e03f587ee3c60bd2ed08c3b26369b4","source":{"kind":"arxiv","id":"2007.14514","version":2},"attestation_state":"computed","paper":{"title":"Computing Weighted Subset Transversals in $H$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Matthew Johnson, Nick Brettell","submitted_at":"2020-07-28T22:51:07Z","abstract_excerpt":"For the Odd Cycle Transversal problem, the task is to find a small set $S$ of vertices in a graph that intersects every cycle of odd length. The Subset Odd Cycle Transversal problem requires S to intersect only those odd cycles that include a vertex of a distinguished vertex subset $T$. If we are given weights for the vertices, we ask instead that $S$ has small weight: this is the problem Weighted Subset Odd Cycle Transversal. We prove an almost-complete complexity dichotomy for Weighted Subset Odd Cycle Transversal for graphs that do not contain a graph $H$ as an induced subgraph. Our general"},"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":"2007.14514","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-28T22:51:07Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"9211e26d599cc139eb829019adc9aef0a3c4bab948aed5b57e3884eda8a0e081","abstract_canon_sha256":"7127b021e621a21744986e05ee3f0a0709158119277d1ada028c9825dc16fc49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:49:11.683276Z","signature_b64":"+7A55xh2mT5rSjkYsEYiEesxcEFin+Klvd2rlwrxhx/LxmSem1RT0n+ae/4wGFCfXttt0QnrJ4e/jAdxgrK3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"789047c3f4dcade12ac368bf5fcf2de834e03f587ee3c60bd2ed08c3b26369b4","last_reissued_at":"2026-07-05T02:49:11.682837Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:49:11.682837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Weighted Subset Transversals in $H$-Free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Matthew Johnson, Nick Brettell","submitted_at":"2020-07-28T22:51:07Z","abstract_excerpt":"For the Odd Cycle Transversal problem, the task is to find a small set $S$ of vertices in a graph that intersects every cycle of odd length. The Subset Odd Cycle Transversal problem requires S to intersect only those odd cycles that include a vertex of a distinguished vertex subset $T$. If we are given weights for the vertices, we ask instead that $S$ has small weight: this is the problem Weighted Subset Odd Cycle Transversal. We prove an almost-complete complexity dichotomy for Weighted Subset Odd Cycle Transversal for graphs that do not contain a graph $H$ as an induced subgraph. Our general"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.14514","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.14514/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.14514","created_at":"2026-07-05T02:49:11.682895+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.14514v2","created_at":"2026-07-05T02:49:11.682895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.14514","created_at":"2026-07-05T02:49:11.682895+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCIEPQ7U3SW6","created_at":"2026-07-05T02:49:11.682895+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCIEPQ7U3SW6CKWD","created_at":"2026-07-05T02:49:11.682895+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCIEPQ7U","created_at":"2026-07-05T02:49:11.682895+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/PCIEPQ7U3SW6CKWDNC7V7TZN5A","json":"https://pith.science/pith/PCIEPQ7U3SW6CKWDNC7V7TZN5A.json","graph_json":"https://pith.science/api/pith-number/PCIEPQ7U3SW6CKWDNC7V7TZN5A/graph.json","events_json":"https://pith.science/api/pith-number/PCIEPQ7U3SW6CKWDNC7V7TZN5A/events.json","paper":"https://pith.science/paper/PCIEPQ7U"},"agent_actions":{"view_html":"https://pith.science/pith/PCIEPQ7U3SW6CKWDNC7V7TZN5A","download_json":"https://pith.science/pith/PCIEPQ7U3SW6CKWDNC7V7TZN5A.json","view_paper":"https://pith.science/paper/PCIEPQ7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.14514&json=true","fetch_graph":"https://pith.science/api/pith-number/PCIEPQ7U3SW6CKWDNC7V7TZN5A/graph.json","fetch_events":"https://pith.science/api/pith-number/PCIEPQ7U3SW6CKWDNC7V7TZN5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCIEPQ7U3SW6CKWDNC7V7TZN5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCIEPQ7U3SW6CKWDNC7V7TZN5A/action/storage_attestation","attest_author":"https://pith.science/pith/PCIEPQ7U3SW6CKWDNC7V7TZN5A/action/author_attestation","sign_citation":"https://pith.science/pith/PCIEPQ7U3SW6CKWDNC7V7TZN5A/action/citation_signature","submit_replication":"https://pith.science/pith/PCIEPQ7U3SW6CKWDNC7V7TZN5A/action/replication_record"}},"created_at":"2026-07-05T02:49:11.682895+00:00","updated_at":"2026-07-05T02:49:11.682895+00:00"}