{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:Q66VKLRU64XAQR2KFYOWXAWK47","short_pith_number":"pith:Q66VKLRU","schema_version":"1.0","canonical_sha256":"87bd552e34f72e08474a2e1d6b82cae7c8873499a4ed7fe7a1b0a7006c7ad954","source":{"kind":"arxiv","id":"1102.1138","version":2},"attestation_state":"computed","paper":{"title":"Critical Sets in Bipartite Graphs","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-06T11:07:57Z","abstract_excerpt":"Let G=(V,E) be a graph. A set S is independent if no two vertices from S are adjacent, alpha(G) is the size of a maximum independent set, and core(G) is the intersection of all maximum independent sets. The number d(X)=|X|-|N(X)| is the difference of the set X, and d_{c}(G)=max{d(I):I is an independent set} is called the critical difference of G. A set X is critical if d(X)=d_{c}(G). For a graph G we define ker(G) as the intersection of all critical independent sets, while diadem(G) is the union of all critical independent sets. For a bipartite graph G=(A,B,E), with bipartition {A,B}, Ore defi"},"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.1138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:07:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7c68c974f842f55702fabdd74097ffe600e9cf4015dbbd159aecd80c9b65735e","abstract_canon_sha256":"1e9a996b4783bb767908f6116a09d541756e4c0ddb52a6ebec6318b22223d8af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:44.287963Z","signature_b64":"psn7Ac5OJd+WhF21FxVZflmwe+e2ckHN+MsyfmwbZ3qcUeNyPYSn3GGvT5VbuE3zHIcqpqBRLpmjOCP6C+6LBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87bd552e34f72e08474a2e1d6b82cae7c8873499a4ed7fe7a1b0a7006c7ad954","last_reissued_at":"2026-05-18T04:29:44.287421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:44.287421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Critical Sets in Bipartite Graphs","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-06T11:07:57Z","abstract_excerpt":"Let G=(V,E) be a graph. A set S is independent if no two vertices from S are adjacent, alpha(G) is the size of a maximum independent set, and core(G) is the intersection of all maximum independent sets. The number d(X)=|X|-|N(X)| is the difference of the set X, and d_{c}(G)=max{d(I):I is an independent set} is called the critical difference of G. A set X is critical if d(X)=d_{c}(G). For a graph G we define ker(G) as the intersection of all critical independent sets, while diadem(G) is the union of all critical independent sets. For a bipartite graph G=(A,B,E), with bipartition {A,B}, Ore defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1138","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.1138","created_at":"2026-05-18T04:29:44.287511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1138v2","created_at":"2026-05-18T04:29:44.287511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1138","created_at":"2026-05-18T04:29:44.287511+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q66VKLRU64XA","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q66VKLRU64XAQR2K","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q66VKLRU","created_at":"2026-05-18T12:26:39.201973+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/Q66VKLRU64XAQR2KFYOWXAWK47","json":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47.json","graph_json":"https://pith.science/api/pith-number/Q66VKLRU64XAQR2KFYOWXAWK47/graph.json","events_json":"https://pith.science/api/pith-number/Q66VKLRU64XAQR2KFYOWXAWK47/events.json","paper":"https://pith.science/paper/Q66VKLRU"},"agent_actions":{"view_html":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47","download_json":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47.json","view_paper":"https://pith.science/paper/Q66VKLRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1138&json=true","fetch_graph":"https://pith.science/api/pith-number/Q66VKLRU64XAQR2KFYOWXAWK47/graph.json","fetch_events":"https://pith.science/api/pith-number/Q66VKLRU64XAQR2KFYOWXAWK47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47/action/storage_attestation","attest_author":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47/action/author_attestation","sign_citation":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47/action/citation_signature","submit_replication":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47/action/replication_record"}},"created_at":"2026-05-18T04:29:44.287511+00:00","updated_at":"2026-05-18T04:29:44.287511+00:00"}