{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4KITTLHDXEEOJC34S5B2TYGYKN","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":"1f5e792224495103a815a46db6d5ecb51e9611328529227f15d61b8a7b8b1413","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-26T12:32:34Z","title_canon_sha256":"84e92fe9963036964244602377887e6e2985bd75ad4243d14289aa34cf34f500"},"schema_version":"1.0","source":{"id":"1507.07194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07194","created_at":"2026-05-18T01:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07194v1","created_at":"2026-05-18T01:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07194","created_at":"2026-05-18T01:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"4KITTLHDXEEO","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4KITTLHDXEEOJC34","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4KITTLHD","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:c221e2ddb744ad29fa9db605d00d9e1912f1d5ec1ac05afd3e7130f6436adcf7","target":"graph","created_at":"2026-05-18T01:36:16Z","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":"Let $G$ be a graph and $v$ any vertex of $G$. We define the degenerate degree of $v$, denoted by $\\zeta(v)$ as $\\zeta(v)={\\max}_{H: v\\in H}~\\delta(H)$, where the maximum is taken over all subgraphs of $G$ containing the vertex $v$. We show that the degenerate degree sequence of any graph can be determined by an efficient algorithm. A $k$-independent set in $G$ is any set $S$ of vertices such that $\\Delta(G[S])\\leq k$. The largest cardinality of any $k$-independent set is denoted by $\\alpha_k(G)$. For $k\\in \\{1, 2, 3\\}$, we prove that $\\alpha_{k-1}(G)\\geq {\\sum}_{v\\in G} \\min \\{1, 1/(\\zeta(v)+(","authors_text":"Manouchehr Zaker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-26T12:32:34Z","title":"Lower bounds for independence and $k$-independence number of graphs using the concept of degenerate degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07194","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:a2ab974007f0e9a173a4d353ad18610f772bf8742164666a62e03ea2655bb393","target":"record","created_at":"2026-05-18T01:36:16Z","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":"1f5e792224495103a815a46db6d5ecb51e9611328529227f15d61b8a7b8b1413","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-26T12:32:34Z","title_canon_sha256":"84e92fe9963036964244602377887e6e2985bd75ad4243d14289aa34cf34f500"},"schema_version":"1.0","source":{"id":"1507.07194","kind":"arxiv","version":1}},"canonical_sha256":"e29139ace3b908e48b7c9743a9e0d8534ebabca0ecda0b3acdb2a8471a8f4543","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e29139ace3b908e48b7c9743a9e0d8534ebabca0ecda0b3acdb2a8471a8f4543","first_computed_at":"2026-05-18T01:36:16.956652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:16.956652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ecaC+rDmpIdEZwN7YgTkFmnkNH3mqwEu7g+/38DLQ2/mPZN8PnT09JLM1Fqb2YA/8jl5XHqNo7JZmut8fWlCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:16.957183Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a2ab974007f0e9a173a4d353ad18610f772bf8742164666a62e03ea2655bb393","sha256:c221e2ddb744ad29fa9db605d00d9e1912f1d5ec1ac05afd3e7130f6436adcf7"],"state_sha256":"b11f28bb2c2cf8f2f063a205982c6afba0e70f7e64d3f44eb2037cfd0fa48ba1"}