{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2YRKWGU6HH3IEQODTA4VVJMS5F","short_pith_number":"pith:2YRKWGU6","schema_version":"1.0","canonical_sha256":"d622ab1a9e39f68241c398395aa592e94a68f2fab37a01eb4022ead40ce9da56","source":{"kind":"arxiv","id":"2303.13655","version":4},"attestation_state":"computed","paper":{"title":"Clustered independence and bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kolja Knauer, Torsten Ueckerdt","submitted_at":"2023-03-23T20:24:27Z","abstract_excerpt":"A set $S\\subseteq V$ of vertices of a graph $G$ is a $c$-clustered set if it induces a subgraph with components of order at most $c$ each, and $\\alpha_c(G)$ denotes the size of a largest $c$-clustered set. For any graph $G$ on $n$ vertices and treewidth $k$, we show that $\\alpha_c(G) \\geq \\frac{c}{c+k+1}n$, which improves a result of Dvo\\v{r}{\\'a}k and Wood [Innov.\\ Graph Theory, 2025], while we construct $n$-vertex graphs $G$ of treewidth $k$ with $\\alpha_c(G)\\leq \\frac{c}{c+k}n$. In the case $c\\leq 2$ or $k=1$ we prove the better lower bound $\\alpha_c(G) \\geq \\frac{c}{c+k}n$, which settles a"},"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":"2303.13655","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-23T20:24:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"622681a6be26663fd5f8b4f8ad3984fa4142155e1b578dfce5e16101ff7148c2","abstract_canon_sha256":"0d3010692e66607049e679acef3bdc32dfade8263d9ce2bdb51e6fe654bbd42c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:11.064830Z","signature_b64":"9rbfXVGRLP+IHOpfH8JIIzSjGD7T3oS/upximCI4xLrtWBs3h1ycfd6WqICr/2f/yLL+C9WXsFQaBxyBoEtgBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d622ab1a9e39f68241c398395aa592e94a68f2fab37a01eb4022ead40ce9da56","last_reissued_at":"2026-05-21T01:04:11.064033Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:11.064033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustered independence and bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kolja Knauer, Torsten Ueckerdt","submitted_at":"2023-03-23T20:24:27Z","abstract_excerpt":"A set $S\\subseteq V$ of vertices of a graph $G$ is a $c$-clustered set if it induces a subgraph with components of order at most $c$ each, and $\\alpha_c(G)$ denotes the size of a largest $c$-clustered set. For any graph $G$ on $n$ vertices and treewidth $k$, we show that $\\alpha_c(G) \\geq \\frac{c}{c+k+1}n$, which improves a result of Dvo\\v{r}{\\'a}k and Wood [Innov.\\ Graph Theory, 2025], while we construct $n$-vertex graphs $G$ of treewidth $k$ with $\\alpha_c(G)\\leq \\frac{c}{c+k}n$. In the case $c\\leq 2$ or $k=1$ we prove the better lower bound $\\alpha_c(G) \\geq \\frac{c}{c+k}n$, which settles a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.13655","kind":"arxiv","version":4},"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/2303.13655/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":"2303.13655","created_at":"2026-05-21T01:04:11.064132+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.13655v4","created_at":"2026-05-21T01:04:11.064132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.13655","created_at":"2026-05-21T01:04:11.064132+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YRKWGU6HH3I","created_at":"2026-05-21T01:04:11.064132+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YRKWGU6HH3IEQOD","created_at":"2026-05-21T01:04:11.064132+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YRKWGU6","created_at":"2026-05-21T01:04:11.064132+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/2YRKWGU6HH3IEQODTA4VVJMS5F","json":"https://pith.science/pith/2YRKWGU6HH3IEQODTA4VVJMS5F.json","graph_json":"https://pith.science/api/pith-number/2YRKWGU6HH3IEQODTA4VVJMS5F/graph.json","events_json":"https://pith.science/api/pith-number/2YRKWGU6HH3IEQODTA4VVJMS5F/events.json","paper":"https://pith.science/paper/2YRKWGU6"},"agent_actions":{"view_html":"https://pith.science/pith/2YRKWGU6HH3IEQODTA4VVJMS5F","download_json":"https://pith.science/pith/2YRKWGU6HH3IEQODTA4VVJMS5F.json","view_paper":"https://pith.science/paper/2YRKWGU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.13655&json=true","fetch_graph":"https://pith.science/api/pith-number/2YRKWGU6HH3IEQODTA4VVJMS5F/graph.json","fetch_events":"https://pith.science/api/pith-number/2YRKWGU6HH3IEQODTA4VVJMS5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YRKWGU6HH3IEQODTA4VVJMS5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YRKWGU6HH3IEQODTA4VVJMS5F/action/storage_attestation","attest_author":"https://pith.science/pith/2YRKWGU6HH3IEQODTA4VVJMS5F/action/author_attestation","sign_citation":"https://pith.science/pith/2YRKWGU6HH3IEQODTA4VVJMS5F/action/citation_signature","submit_replication":"https://pith.science/pith/2YRKWGU6HH3IEQODTA4VVJMS5F/action/replication_record"}},"created_at":"2026-05-21T01:04:11.064132+00:00","updated_at":"2026-05-21T01:04:11.064132+00:00"}