{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WERRP6CTTTMQWGGLGF4U5UTQ6J","short_pith_number":"pith:WERRP6CT","schema_version":"1.0","canonical_sha256":"b12317f8539cd90b18cb31794ed270f2743d88da9a970875b50735b068bfb6ae","source":{"kind":"arxiv","id":"1104.3915","version":2},"attestation_state":"computed","paper":{"title":"Feedback vertex set on chordal bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ching-Hao Liu, Sheung-Hung Poon, Ton Kloks","submitted_at":"2011-04-20T01:46:42Z","abstract_excerpt":"Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is chordal bipartite if G has no induced cycle of length more than four. Let G=(V,E) be a graph. A feedback vertex set F is a set of vertices F subset V such that G-F is a forest. The feedback vertex set problem asks for a feedback vertex set of minimal cardinality. We show that the feedback vertex set problem can be solved in polynomial time on chordal bipartite graphs."},"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":"1104.3915","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-20T01:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"c9f6b08da5eda43c873eed0c1152b471164abfa38818cd9d2b7736d11ceb1776","abstract_canon_sha256":"22da56338bd432eb045bdd2a2b8cae8b0db1dc69d82c24cb07f70efe92700d35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:18.881763Z","signature_b64":"Rm+2FBwSnUX5zxeQmxT2bjODanQMpxLbpv+xkO4G/SB/isLE46/laiRvkjem0m8ctBYKEEYpiOKD2ZKLIsAOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b12317f8539cd90b18cb31794ed270f2743d88da9a970875b50735b068bfb6ae","last_reissued_at":"2026-05-18T03:43:18.881148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:18.881148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feedback vertex set on chordal bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ching-Hao Liu, Sheung-Hung Poon, Ton Kloks","submitted_at":"2011-04-20T01:46:42Z","abstract_excerpt":"Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is chordal bipartite if G has no induced cycle of length more than four. Let G=(V,E) be a graph. A feedback vertex set F is a set of vertices F subset V such that G-F is a forest. The feedback vertex set problem asks for a feedback vertex set of minimal cardinality. We show that the feedback vertex set problem can be solved in polynomial time on chordal bipartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3915","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":""},"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":"1104.3915","created_at":"2026-05-18T03:43:18.881263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3915v2","created_at":"2026-05-18T03:43:18.881263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3915","created_at":"2026-05-18T03:43:18.881263+00:00"},{"alias_kind":"pith_short_12","alias_value":"WERRP6CTTTMQ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WERRP6CTTTMQWGGL","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WERRP6CT","created_at":"2026-05-18T12:26:44.992195+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14836","citing_title":"Sparse induced subgraphs in $P_7$-free graphs of bounded clique number","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WERRP6CTTTMQWGGLGF4U5UTQ6J","json":"https://pith.science/pith/WERRP6CTTTMQWGGLGF4U5UTQ6J.json","graph_json":"https://pith.science/api/pith-number/WERRP6CTTTMQWGGLGF4U5UTQ6J/graph.json","events_json":"https://pith.science/api/pith-number/WERRP6CTTTMQWGGLGF4U5UTQ6J/events.json","paper":"https://pith.science/paper/WERRP6CT"},"agent_actions":{"view_html":"https://pith.science/pith/WERRP6CTTTMQWGGLGF4U5UTQ6J","download_json":"https://pith.science/pith/WERRP6CTTTMQWGGLGF4U5UTQ6J.json","view_paper":"https://pith.science/paper/WERRP6CT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3915&json=true","fetch_graph":"https://pith.science/api/pith-number/WERRP6CTTTMQWGGLGF4U5UTQ6J/graph.json","fetch_events":"https://pith.science/api/pith-number/WERRP6CTTTMQWGGLGF4U5UTQ6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WERRP6CTTTMQWGGLGF4U5UTQ6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WERRP6CTTTMQWGGLGF4U5UTQ6J/action/storage_attestation","attest_author":"https://pith.science/pith/WERRP6CTTTMQWGGLGF4U5UTQ6J/action/author_attestation","sign_citation":"https://pith.science/pith/WERRP6CTTTMQWGGLGF4U5UTQ6J/action/citation_signature","submit_replication":"https://pith.science/pith/WERRP6CTTTMQWGGLGF4U5UTQ6J/action/replication_record"}},"created_at":"2026-05-18T03:43:18.881263+00:00","updated_at":"2026-05-18T03:43:18.881263+00:00"}