{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WMNZQL3XOHTJYMHC6NS3J4QUY4","short_pith_number":"pith:WMNZQL3X","schema_version":"1.0","canonical_sha256":"b31b982f7771e69c30e2f365b4f214c71109a38501f4e1560f60850d6f7bb004","source":{"kind":"arxiv","id":"1102.0401","version":2},"attestation_state":"computed","paper":{"title":"Vertices Belonging to All Critical Independent Sets of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2011-02-02T10:58:35Z","abstract_excerpt":"Let G=(V,E) be a graph. A set S is independent if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, and mu(G) is the size of a maximum matching. The number id_{c}(G)=max{|I|-|N(I)|:I is an independent set} is called the critical independence difference of G, and A is critical if |A|-|N(A)|=id_{c}(G). We define core(G) as the intersection of all maximum independent sets, and ker(G)as the intersection of all critical independent sets. In this paper we prove that if a graph G is non-quasi-regularizable (i.e., there exists some i"},"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":"1102.0401","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-02T10:58:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"57fa9f01cf2e1dd1445752dbc4905a865705395b58e0851c864ba8f0f999c235","abstract_canon_sha256":"1096bffb096feece485171f0112b6c0a8550cd92286d97eb8746b592d587f0d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:55.222162Z","signature_b64":"f7caXOmV63ntNuJP33pZ3vjoV1b17dYPGTQWs1wOJscqhiDY7LjKJqzAQ6DQwkP3LMG4n9J9ACBKCK/Km6itDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b31b982f7771e69c30e2f365b4f214c71109a38501f4e1560f60850d6f7bb004","last_reissued_at":"2026-05-18T04:29:55.221665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:55.221665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertices Belonging to All Critical Independent Sets of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2011-02-02T10:58:35Z","abstract_excerpt":"Let G=(V,E) be a graph. A set S is independent if no two vertices from S are adjacent. The independence number alpha(G) is the cardinality of a maximum independent set, and mu(G) is the size of a maximum matching. The number id_{c}(G)=max{|I|-|N(I)|:I is an independent set} is called the critical independence difference of G, and A is critical if |A|-|N(A)|=id_{c}(G). We define core(G) as the intersection of all maximum independent sets, and ker(G)as the intersection of all critical independent sets. In this paper we prove that if a graph G is non-quasi-regularizable (i.e., there exists some i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0401","kind":"arxiv","version":2},"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":"1102.0401","created_at":"2026-05-18T04:29:55.221738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0401v2","created_at":"2026-05-18T04:29:55.221738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0401","created_at":"2026-05-18T04:29:55.221738+00:00"},{"alias_kind":"pith_short_12","alias_value":"WMNZQL3XOHTJ","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WMNZQL3XOHTJYMHC","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WMNZQL3X","created_at":"2026-05-18T12:26:44.992195+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/WMNZQL3XOHTJYMHC6NS3J4QUY4","json":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4.json","graph_json":"https://pith.science/api/pith-number/WMNZQL3XOHTJYMHC6NS3J4QUY4/graph.json","events_json":"https://pith.science/api/pith-number/WMNZQL3XOHTJYMHC6NS3J4QUY4/events.json","paper":"https://pith.science/paper/WMNZQL3X"},"agent_actions":{"view_html":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4","download_json":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4.json","view_paper":"https://pith.science/paper/WMNZQL3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0401&json=true","fetch_graph":"https://pith.science/api/pith-number/WMNZQL3XOHTJYMHC6NS3J4QUY4/graph.json","fetch_events":"https://pith.science/api/pith-number/WMNZQL3XOHTJYMHC6NS3J4QUY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/action/storage_attestation","attest_author":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/action/author_attestation","sign_citation":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/action/citation_signature","submit_replication":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/action/replication_record"}},"created_at":"2026-05-18T04:29:55.221738+00:00","updated_at":"2026-05-18T04:29:55.221738+00:00"}