{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Q66VKLRU64XAQR2KFYOWXAWK47","short_pith_number":"pith:Q66VKLRU","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"},"canonical_sha256":"87bd552e34f72e08474a2e1d6b82cae7c8873499a4ed7fe7a1b0a7006c7ad954","source":{"kind":"arxiv","id":"1102.1138","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1138","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1138v2","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1138","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q66VKLRU64XA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q66VKLRU64XAQR2K","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q66VKLRU","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Q66VKLRU64XAQR2KFYOWXAWK47","target":"record","payload":{"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"},"canonical_sha256":"87bd552e34f72e08474a2e1d6b82cae7c8873499a4ed7fe7a1b0a7006c7ad954","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"},"source_kind":"arxiv","source_id":"1102.1138","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:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JWd8Jf+Hv+rPJW5iSdJAoEHvMoqDqPp3TMBvp3mswJt/J3prtnTKoF1fHGJEMsbjNQxV2qQC2LyixUBwxsaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:31.272924Z"},"content_sha256":"632009c854e293e046381f451fbc295e0291f4b81bcdb52639d846351b7aed57","schema_version":"1.0","event_id":"sha256:632009c854e293e046381f451fbc295e0291f4b81bcdb52639d846351b7aed57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Q66VKLRU64XAQR2KFYOWXAWK47","target":"graph","payload":{"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"},"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:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ClEnmDgBh/6dbBHuRCE9HB8fmbVIH8yCJPN4AiUMKmI4KuMTLCmjlsb8e4QxV6Ry77nspM5lK3NQQo/z1SCICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:13:31.273637Z"},"content_sha256":"a838ff20ede388e9a0541450165ec3d07b7a88f5a80bdada533ce5361cfa930a","schema_version":"1.0","event_id":"sha256:a838ff20ede388e9a0541450165ec3d07b7a88f5a80bdada533ce5361cfa930a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47/bundle.json","state_url":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q66VKLRU64XAQR2KFYOWXAWK47/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-29T21:13:31Z","links":{"resolver":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47","bundle":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47/bundle.json","state":"https://pith.science/pith/Q66VKLRU64XAQR2KFYOWXAWK47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q66VKLRU64XAQR2KFYOWXAWK47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Q66VKLRU64XAQR2KFYOWXAWK47","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":"1e9a996b4783bb767908f6116a09d541756e4c0ddb52a6ebec6318b22223d8af","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:07:57Z","title_canon_sha256":"7c68c974f842f55702fabdd74097ffe600e9cf4015dbbd159aecd80c9b65735e"},"schema_version":"1.0","source":{"id":"1102.1138","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1138","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1138v2","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1138","created_at":"2026-05-18T04:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q66VKLRU64XA","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q66VKLRU64XAQR2K","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q66VKLRU","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:a838ff20ede388e9a0541450165ec3d07b7a88f5a80bdada533ce5361cfa930a","target":"graph","created_at":"2026-05-18T04:29:44Z","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, 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","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-06T11:07:57Z","title":"Critical Sets in Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1138","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:632009c854e293e046381f451fbc295e0291f4b81bcdb52639d846351b7aed57","target":"record","created_at":"2026-05-18T04:29:44Z","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":"1e9a996b4783bb767908f6116a09d541756e4c0ddb52a6ebec6318b22223d8af","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-06T11:07:57Z","title_canon_sha256":"7c68c974f842f55702fabdd74097ffe600e9cf4015dbbd159aecd80c9b65735e"},"schema_version":"1.0","source":{"id":"1102.1138","kind":"arxiv","version":2}},"canonical_sha256":"87bd552e34f72e08474a2e1d6b82cae7c8873499a4ed7fe7a1b0a7006c7ad954","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87bd552e34f72e08474a2e1d6b82cae7c8873499a4ed7fe7a1b0a7006c7ad954","first_computed_at":"2026-05-18T04:29:44.287421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:44.287421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"psn7Ac5OJd+WhF21FxVZflmwe+e2ckHN+MsyfmwbZ3qcUeNyPYSn3GGvT5VbuE3zHIcqpqBRLpmjOCP6C+6LBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:44.287963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1138","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:632009c854e293e046381f451fbc295e0291f4b81bcdb52639d846351b7aed57","sha256:a838ff20ede388e9a0541450165ec3d07b7a88f5a80bdada533ce5361cfa930a"],"state_sha256":"6c235fe4bf4f8c62db35fad1cccaad39af30ac365bab4b9602a0b207f9f9e010"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qen6GrvST8kWIxiF1Qaf76Gfgijy50VVrCbRFdckJbE0OB3tULguf0hv9EMD4PKRMD/vS3Ugsk0WNATqyDaZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:13:31.281529Z","bundle_sha256":"f32c14e3feba11cb6cc2822cebb63f894027dec7a1c14127ff213084fde37321"}}