{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:76IPTWVM2BL6W4DM6BD7MEUKFT","short_pith_number":"pith:76IPTWVM","schema_version":"1.0","canonical_sha256":"ff90f9daacd057eb706cf047f6128a2cd3e086032fe7030bcc2e15977d403d93","source":{"kind":"arxiv","id":"1208.4734","version":1},"attestation_state":"computed","paper":{"title":"New approach to the $k$-independence number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Yair Caro","submitted_at":"2012-08-23T12:10:08Z","abstract_excerpt":"Let $G = (V,E)$ be a graph and $k \\ge 0$ an integer. A $k$-independent set $S \\subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\\alpha_k(G)$ we denote the maximum cardinality of a $k$-independent set of $G$. We prove that, for a graph $G$ on $n$ vertices and average degree $d$, $\\alpha_k(G) \\ge \\frac{k+1}{\\lceil d \\rceil + k + 1} n$, improving the hitherto best general lower bound due to Caro and Tuza [Improved lower bounds on k-independence, J. Graph Theory 15 (1991), 99-107]."},"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":"1208.4734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-23T12:10:08Z","cross_cats_sorted":[],"title_canon_sha256":"02ba31314b915d528498ee26e80832111c3ea8067f8a498f87f683a750cc1ccd","abstract_canon_sha256":"7790063348c7b2279ac4b3a3dfe2f00355f0082a6a6c9cdc5318a2753edf48a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:12.788034Z","signature_b64":"Fs0wphGZ4R9wG31Nj5YgPI5v70XXiGa+6t9+/MKSwjcw8ybi5/viIzaAagzZFd9GyqIWx8DArvEVBlifx5DfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff90f9daacd057eb706cf047f6128a2cd3e086032fe7030bcc2e15977d403d93","last_reissued_at":"2026-05-18T03:48:12.787380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:12.787380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New approach to the $k$-independence number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Yair Caro","submitted_at":"2012-08-23T12:10:08Z","abstract_excerpt":"Let $G = (V,E)$ be a graph and $k \\ge 0$ an integer. A $k$-independent set $S \\subseteq V$ is a set of vertices such that the maximum degree in the graph induced by $S$ is at most $k$. With $\\alpha_k(G)$ we denote the maximum cardinality of a $k$-independent set of $G$. We prove that, for a graph $G$ on $n$ vertices and average degree $d$, $\\alpha_k(G) \\ge \\frac{k+1}{\\lceil d \\rceil + k + 1} n$, improving the hitherto best general lower bound due to Caro and Tuza [Improved lower bounds on k-independence, J. Graph Theory 15 (1991), 99-107]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4734","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":"1208.4734","created_at":"2026-05-18T03:48:12.787476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4734v1","created_at":"2026-05-18T03:48:12.787476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4734","created_at":"2026-05-18T03:48:12.787476+00:00"},{"alias_kind":"pith_short_12","alias_value":"76IPTWVM2BL6","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"76IPTWVM2BL6W4DM","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"76IPTWVM","created_at":"2026-05-18T12:26:56.085431+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/76IPTWVM2BL6W4DM6BD7MEUKFT","json":"https://pith.science/pith/76IPTWVM2BL6W4DM6BD7MEUKFT.json","graph_json":"https://pith.science/api/pith-number/76IPTWVM2BL6W4DM6BD7MEUKFT/graph.json","events_json":"https://pith.science/api/pith-number/76IPTWVM2BL6W4DM6BD7MEUKFT/events.json","paper":"https://pith.science/paper/76IPTWVM"},"agent_actions":{"view_html":"https://pith.science/pith/76IPTWVM2BL6W4DM6BD7MEUKFT","download_json":"https://pith.science/pith/76IPTWVM2BL6W4DM6BD7MEUKFT.json","view_paper":"https://pith.science/paper/76IPTWVM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4734&json=true","fetch_graph":"https://pith.science/api/pith-number/76IPTWVM2BL6W4DM6BD7MEUKFT/graph.json","fetch_events":"https://pith.science/api/pith-number/76IPTWVM2BL6W4DM6BD7MEUKFT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/76IPTWVM2BL6W4DM6BD7MEUKFT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/76IPTWVM2BL6W4DM6BD7MEUKFT/action/storage_attestation","attest_author":"https://pith.science/pith/76IPTWVM2BL6W4DM6BD7MEUKFT/action/author_attestation","sign_citation":"https://pith.science/pith/76IPTWVM2BL6W4DM6BD7MEUKFT/action/citation_signature","submit_replication":"https://pith.science/pith/76IPTWVM2BL6W4DM6BD7MEUKFT/action/replication_record"}},"created_at":"2026-05-18T03:48:12.787476+00:00","updated_at":"2026-05-18T03:48:12.787476+00:00"}