{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VJJEU6M7SSYQU7WGFHLNFZQDFA","short_pith_number":"pith:VJJEU6M7","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"},"canonical_sha256":"aa524a799f94b10a7ec629d6d2e603283cdebf19479ea01195f5b60c00c5954e","source":{"kind":"arxiv","id":"1607.04545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04545","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04545v1","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04545","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"VJJEU6M7SSYQ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VJJEU6M7SSYQU7WG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VJJEU6M7","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VJJEU6M7SSYQU7WGFHLNFZQDFA","target":"record","payload":{"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"},"canonical_sha256":"aa524a799f94b10a7ec629d6d2e603283cdebf19479ea01195f5b60c00c5954e","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"},"source_kind":"arxiv","source_id":"1607.04545","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wcc7gPzY9ulYngOjbRjzd0eqye8GInpoQHNFzIpKASLnfHxARjjvP/6pkXmKq39XkdcENeS6mx6I6TUbuHseDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:14:48.032008Z"},"content_sha256":"456c1e4c8f2a1483721e5566e56718c392bb5300e33e223f56240ff2c1020f7e","schema_version":"1.0","event_id":"sha256:456c1e4c8f2a1483721e5566e56718c392bb5300e33e223f56240ff2c1020f7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VJJEU6M7SSYQU7WGFHLNFZQDFA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o8BQH42f8bVolvcv9milswDR46V3OkE1tIoE8MCSsT8T/55WKgRvx3kDqehPYhQKaKDIyEnCpw4kIzeu72RbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T04:14:48.032686Z"},"content_sha256":"30e9f3962cf6eea8ef3a14590b83c5913c96a5344ef6ccaba25aeb5b9996f943","schema_version":"1.0","event_id":"sha256:30e9f3962cf6eea8ef3a14590b83c5913c96a5344ef6ccaba25aeb5b9996f943"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/bundle.json","state_url":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T04:14:48Z","links":{"resolver":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA","bundle":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/bundle.json","state":"https://pith.science/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJJEU6M7SSYQU7WGFHLNFZQDFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VJJEU6M7SSYQU7WGFHLNFZQDFA","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":"0ca6dc365765841b6b34c0dc18e6f2b0ff567e0dfec09950bf85d067de47a01b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T15:09:12Z","title_canon_sha256":"d3242d5b43f8acc478cb5c7220d54f8cdd116a2670aa28736ceeeec7a12c9830"},"schema_version":"1.0","source":{"id":"1607.04545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04545","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04545v1","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04545","created_at":"2026-05-18T01:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"VJJEU6M7SSYQ","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VJJEU6M7SSYQU7WG","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VJJEU6M7","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:30e9f3962cf6eea8ef3a14590b83c5913c96a5344ef6ccaba25aeb5b9996f943","target":"graph","created_at":"2026-05-18T01:11:00Z","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":"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","authors_text":"Ioan Todinca, Pedro Montealegre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T15:09:12Z","title":"On Distance-$d$ Independent Set and other problems in graphs with few minimal separators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04545","kind":"arxiv","version":1},"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:456c1e4c8f2a1483721e5566e56718c392bb5300e33e223f56240ff2c1020f7e","target":"record","created_at":"2026-05-18T01:11:00Z","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":"0ca6dc365765841b6b34c0dc18e6f2b0ff567e0dfec09950bf85d067de47a01b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-15T15:09:12Z","title_canon_sha256":"d3242d5b43f8acc478cb5c7220d54f8cdd116a2670aa28736ceeeec7a12c9830"},"schema_version":"1.0","source":{"id":"1607.04545","kind":"arxiv","version":1}},"canonical_sha256":"aa524a799f94b10a7ec629d6d2e603283cdebf19479ea01195f5b60c00c5954e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa524a799f94b10a7ec629d6d2e603283cdebf19479ea01195f5b60c00c5954e","first_computed_at":"2026-05-18T01:11:00.914264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:00.914264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8f6qC8Lgqm4DWffULrzfgm8xPDemDc00NMGJp+jrhn5N/tAUhU3M/x84N0fLxhaNQJ/6FfGvWFbuY8Ytwv8HBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:00.914970Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:456c1e4c8f2a1483721e5566e56718c392bb5300e33e223f56240ff2c1020f7e","sha256:30e9f3962cf6eea8ef3a14590b83c5913c96a5344ef6ccaba25aeb5b9996f943"],"state_sha256":"ab60468e42cee8d50ad4c530680beedf90af878718635e08a0a5187f281603bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hs6Xn4ttrOvKI+5gLXKE0S0X9+anSqaeG8tYxwOjUhNepqjO+Z2dA4mEkxXewfP87vP7DGU9+MrlUamNGYRUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T04:14:48.036014Z","bundle_sha256":"91c646ed64d2c63adb8fc329693ef79a610ab9c14ef3dae4d3dfca522d4224fe"}}