{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WMNZQL3XOHTJYMHC6NS3J4QUY4","short_pith_number":"pith:WMNZQL3X","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"},"canonical_sha256":"b31b982f7771e69c30e2f365b4f214c71109a38501f4e1560f60850d6f7bb004","source":{"kind":"arxiv","id":"1102.0401","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0401","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0401v2","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0401","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"pith_short_12","alias_value":"WMNZQL3XOHTJ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WMNZQL3XOHTJYMHC","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WMNZQL3X","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WMNZQL3XOHTJYMHC6NS3J4QUY4","target":"record","payload":{"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"},"canonical_sha256":"b31b982f7771e69c30e2f365b4f214c71109a38501f4e1560f60850d6f7bb004","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"},"source_kind":"arxiv","source_id":"1102.0401","source_version":2,"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-18T04:29:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pa+Ehp7/G12gNQdnh0LGzf4k9xHu/FkZarJJzsIRWotA6GnOP7lY830rhofibSgLk9bFabqA23B0tup1uG9LCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:53:37.772408Z"},"content_sha256":"43b01febb184c3fa0af71efecf94b825af95df579d0df2afbf22c45bcc4e61f9","schema_version":"1.0","event_id":"sha256:43b01febb184c3fa0af71efecf94b825af95df579d0df2afbf22c45bcc4e61f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WMNZQL3XOHTJYMHC6NS3J4QUY4","target":"graph","payload":{"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"},"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-18T04:29:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dK+M9SjwlDdeZNDNA6UaVLceHzya/yHRDp09Qqd9qzjpfdZdA4WdL6u4vH8TCeSVtGRfIiuNNDwXa6tgalQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:53:37.773021Z"},"content_sha256":"2e97ba95ba2752a397d28e58130367b9423614541d9105f255444da72f128828","schema_version":"1.0","event_id":"sha256:2e97ba95ba2752a397d28e58130367b9423614541d9105f255444da72f128828"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/bundle.json","state_url":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/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-05-29T19:53:37Z","links":{"resolver":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4","bundle":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/bundle.json","state":"https://pith.science/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMNZQL3XOHTJYMHC6NS3J4QUY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WMNZQL3XOHTJYMHC6NS3J4QUY4","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":"1096bffb096feece485171f0112b6c0a8550cd92286d97eb8746b592d587f0d3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-02T10:58:35Z","title_canon_sha256":"57fa9f01cf2e1dd1445752dbc4905a865705395b58e0851c864ba8f0f999c235"},"schema_version":"1.0","source":{"id":"1102.0401","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0401","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0401v2","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0401","created_at":"2026-05-18T04:29:55Z"},{"alias_kind":"pith_short_12","alias_value":"WMNZQL3XOHTJ","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WMNZQL3XOHTJYMHC","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WMNZQL3X","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:2e97ba95ba2752a397d28e58130367b9423614541d9105f255444da72f128828","target":"graph","created_at":"2026-05-18T04:29:55Z","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=(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","authors_text":"Eugen Mandrescu, Vadim E. Levit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-02T10:58:35Z","title":"Vertices Belonging to All Critical Independent Sets of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0401","kind":"arxiv","version":2},"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:43b01febb184c3fa0af71efecf94b825af95df579d0df2afbf22c45bcc4e61f9","target":"record","created_at":"2026-05-18T04:29:55Z","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":"1096bffb096feece485171f0112b6c0a8550cd92286d97eb8746b592d587f0d3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-02T10:58:35Z","title_canon_sha256":"57fa9f01cf2e1dd1445752dbc4905a865705395b58e0851c864ba8f0f999c235"},"schema_version":"1.0","source":{"id":"1102.0401","kind":"arxiv","version":2}},"canonical_sha256":"b31b982f7771e69c30e2f365b4f214c71109a38501f4e1560f60850d6f7bb004","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b31b982f7771e69c30e2f365b4f214c71109a38501f4e1560f60850d6f7bb004","first_computed_at":"2026-05-18T04:29:55.221665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:55.221665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f7caXOmV63ntNuJP33pZ3vjoV1b17dYPGTQWs1wOJscqhiDY7LjKJqzAQ6DQwkP3LMG4n9J9ACBKCK/Km6itDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:55.222162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0401","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43b01febb184c3fa0af71efecf94b825af95df579d0df2afbf22c45bcc4e61f9","sha256:2e97ba95ba2752a397d28e58130367b9423614541d9105f255444da72f128828"],"state_sha256":"1deaa229e01684f769b785a97a43432f2972637a06172829639e5732e546ac91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwSWvkmrhdAcMwJ/uD2Pr2caHjvzuHwi+uX6R00TjgO3uBnxi1p8j6Sna9nfQWA5liRWSpmFj/jY1IFMsvlcAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:53:37.776993Z","bundle_sha256":"b56b32d1a57c879a897dbffe719df24f48ffb3dc5a3aec730120bad205120a4c"}}