{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VJJEU6M7SSYQU7WGFHLNFZQDFA","short_pith_number":"pith:VJJEU6M7","schema_version":"1.0","canonical_sha256":"aa524a799f94b10a7ec629d6d2e603283cdebf19479ea01195f5b60c00c5954e","source":{"kind":"arxiv","id":"1607.04545","version":1},"attestation_state":"computed","paper":{"title":"On Distance-$d$ Independent Set and other problems in graphs with few minimal separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ioan Todinca, Pedro Montealegre","submitted_at":"2016-07-15T15:09:12Z","abstract_excerpt":"Fomin and Villanger (STACS 2010) proved that Maximum Independent Set, Feedback Vertex Set, and more generally the problem of finding a maximum induced subgraph of treewith at most a constant $t$, can be solved in polynomial time on graph classes with polynomially many minimal separators. We extend these results in two directions. Let $\\Gpoly$ be the class of graphs with at most $\\poly(n)$ minimal separators, for some polynomial $\\poly$.\n  We show that the odd powers of a graph $G$ have at most as many minimal separators as $G$. Consequently, \\textsc{Distance-$d$ Independent Set}, which consist"},"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":"1607.04545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T15:09:12Z","cross_cats_sorted":[],"title_canon_sha256":"d3242d5b43f8acc478cb5c7220d54f8cdd116a2670aa28736ceeeec7a12c9830","abstract_canon_sha256":"0ca6dc365765841b6b34c0dc18e6f2b0ff567e0dfec09950bf85d067de47a01b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:00.914970Z","signature_b64":"8f6qC8Lgqm4DWffULrzfgm8xPDemDc00NMGJp+jrhn5N/tAUhU3M/x84N0fLxhaNQJ/6FfGvWFbuY8Ytwv8HBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa524a799f94b10a7ec629d6d2e603283cdebf19479ea01195f5b60c00c5954e","last_reissued_at":"2026-05-18T01:11:00.914264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:00.914264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Distance-$d$ Independent Set and other problems in graphs with few minimal separators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ioan Todinca, Pedro Montealegre","submitted_at":"2016-07-15T15:09:12Z","abstract_excerpt":"Fomin and Villanger (STACS 2010) proved that Maximum Independent Set, Feedback Vertex Set, and more generally the problem of finding a maximum induced subgraph of treewith at most a constant $t$, can be solved in polynomial time on graph classes with polynomially many minimal separators. We extend these results in two directions. Let $\\Gpoly$ be the class of graphs with at most $\\poly(n)$ minimal separators, for some polynomial $\\poly$.\n  We show that the odd powers of a graph $G$ have at most as many minimal separators as $G$. Consequently, \\textsc{Distance-$d$ Independent Set}, which consist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04545","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":"1607.04545","created_at":"2026-05-18T01:11:00.914390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04545v1","created_at":"2026-05-18T01:11:00.914390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04545","created_at":"2026-05-18T01:11:00.914390+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJJEU6M7SSYQ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJJEU6M7SSYQU7WG","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJJEU6M7","created_at":"2026-05-18T12:30:48.956258+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/VJJEU6M7SSYQU7WGFHLNFZQDFA","json":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA.json","graph_json":"https://pith.science/api/pith-number/VJJEU6M7SSYQU7WGFHLNFZQDFA/graph.json","events_json":"https://pith.science/api/pith-number/VJJEU6M7SSYQU7WGFHLNFZQDFA/events.json","paper":"https://pith.science/paper/VJJEU6M7"},"agent_actions":{"view_html":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA","download_json":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA.json","view_paper":"https://pith.science/paper/VJJEU6M7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04545&json=true","fetch_graph":"https://pith.science/api/pith-number/VJJEU6M7SSYQU7WGFHLNFZQDFA/graph.json","fetch_events":"https://pith.science/api/pith-number/VJJEU6M7SSYQU7WGFHLNFZQDFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/action/storage_attestation","attest_author":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/action/author_attestation","sign_citation":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/action/citation_signature","submit_replication":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/action/replication_record"}},"created_at":"2026-05-18T01:11:00.914390+00:00","updated_at":"2026-05-18T01:11:00.914390+00:00"}