{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GK4VWFNE7UJ6XQQL6R6IWSQYGA","short_pith_number":"pith:GK4VWFNE","schema_version":"1.0","canonical_sha256":"32b95b15a4fd13ebc20bf47c8b4a18302f341466e16f9a4c9bfc634b99a03338","source":{"kind":"arxiv","id":"1804.04016","version":1},"attestation_state":"computed","paper":{"title":"Bipartitioning Problems on Graphs with Bounded Tree-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anjeneya Swami Kare, N. R. Aravind, Subrahmanyam Kalyanasundaram","submitted_at":"2018-04-11T14:28:01Z","abstract_excerpt":"For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induced graph G[A] nor G[B] contain H (i) as a subgraph? (ii) as an induced subgraph? These problems are NP-complete and are expressible in monadic second order logic (MSOL). The MSOL formulation, together with Courcelle's theorem implies linear time solvability on graphs with bounded tree-width. This approach yields algorithms with running time f(|phi|, t) * n, where |phi| is the length of the MSOL formula, t is the tree"},"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":"1804.04016","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-11T14:28:01Z","cross_cats_sorted":[],"title_canon_sha256":"6886f9ced79a18d85f7a2c2da07bd6cdf6a0a50d07acc0134bcceef86e3fbaa4","abstract_canon_sha256":"3943552302cbd01fee24dc9dc10405b31be9587a531ddf2c972838f8c39a3c2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:42.363483Z","signature_b64":"CWsYd/K1m+pazDMToKxFUvLN7KwzYML7YapWv8LrzpFTGmwmZ1CUZNf3EhiepKPe7Z8Ae2hkxG81/5Nk20+KAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32b95b15a4fd13ebc20bf47c8b4a18302f341466e16f9a4c9bfc634b99a03338","last_reissued_at":"2026-05-18T00:18:42.362989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:42.362989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bipartitioning Problems on Graphs with Bounded Tree-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anjeneya Swami Kare, N. R. Aravind, Subrahmanyam Kalyanasundaram","submitted_at":"2018-04-11T14:28:01Z","abstract_excerpt":"For an undirected graph G, we consider the following problems: given a fixed graph H, can we partition the vertices of G into two non-empty sets A and B such that neither the induced graph G[A] nor G[B] contain H (i) as a subgraph? (ii) as an induced subgraph? These problems are NP-complete and are expressible in monadic second order logic (MSOL). The MSOL formulation, together with Courcelle's theorem implies linear time solvability on graphs with bounded tree-width. This approach yields algorithms with running time f(|phi|, t) * n, where |phi| is the length of the MSOL formula, t is the tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04016","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":"1804.04016","created_at":"2026-05-18T00:18:42.363058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04016v1","created_at":"2026-05-18T00:18:42.363058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04016","created_at":"2026-05-18T00:18:42.363058+00:00"},{"alias_kind":"pith_short_12","alias_value":"GK4VWFNE7UJ6","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GK4VWFNE7UJ6XQQL","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GK4VWFNE","created_at":"2026-05-18T12:32:25.280505+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/GK4VWFNE7UJ6XQQL6R6IWSQYGA","json":"https://pith.science/pith/GK4VWFNE7UJ6XQQL6R6IWSQYGA.json","graph_json":"https://pith.science/api/pith-number/GK4VWFNE7UJ6XQQL6R6IWSQYGA/graph.json","events_json":"https://pith.science/api/pith-number/GK4VWFNE7UJ6XQQL6R6IWSQYGA/events.json","paper":"https://pith.science/paper/GK4VWFNE"},"agent_actions":{"view_html":"https://pith.science/pith/GK4VWFNE7UJ6XQQL6R6IWSQYGA","download_json":"https://pith.science/pith/GK4VWFNE7UJ6XQQL6R6IWSQYGA.json","view_paper":"https://pith.science/paper/GK4VWFNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04016&json=true","fetch_graph":"https://pith.science/api/pith-number/GK4VWFNE7UJ6XQQL6R6IWSQYGA/graph.json","fetch_events":"https://pith.science/api/pith-number/GK4VWFNE7UJ6XQQL6R6IWSQYGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GK4VWFNE7UJ6XQQL6R6IWSQYGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GK4VWFNE7UJ6XQQL6R6IWSQYGA/action/storage_attestation","attest_author":"https://pith.science/pith/GK4VWFNE7UJ6XQQL6R6IWSQYGA/action/author_attestation","sign_citation":"https://pith.science/pith/GK4VWFNE7UJ6XQQL6R6IWSQYGA/action/citation_signature","submit_replication":"https://pith.science/pith/GK4VWFNE7UJ6XQQL6R6IWSQYGA/action/replication_record"}},"created_at":"2026-05-18T00:18:42.363058+00:00","updated_at":"2026-05-18T00:18:42.363058+00:00"}